[ty] Cache sparse reachability checkpoints (#26811)
## Summary
#26810 avoids repeatedly scanning and inferring the statement-call
prefix, but each standalone expression-inference query can still walk
the complete accumulated reachability decision diagram. Repeating that
walk after every statement remains quadratic even when the individual
predicate analyses are already cached.
This change adds a Salsa-tracked checkpoint at every 256th
statement-call predicate. Later evaluations can reuse the result of an
earlier decision-diagram suffix while retaining only a sparse set of
query keys and memos. Scopes with at most 16 calls continue to use the
direct evaluator, and checkpoint queries conservatively participate in
cycle recovery.
This is the second part of the fix for
https://github.com/astral-sh/ty/issues/3986 and is stacked on #26810.