Propagation computes output value information and may inline or fold calls. If a later recursive propagation iteration folds a previously inlined call, the old inlined body is discarded so cleanup uses the newly computed constant result.

Calls are annotated with their input information before constraints derived from their results are applied. Predicate folding uses these annotations to record dependencies during cleanup. Using input information already narrowed by the predicate's own result can miss class changes that invalidate the original assumption.