State machine: ============== Initial State 0 (needStrongRefs[], collectableWeakRefs[i], weakRefs[], collectSets[[i]], boundVars[]) -->[next] to State 1 State 1 (needStrongRefs[], collectableWeakRefs[i], weakRefs[], collectSets[[i]], boundVars[i]) -->[next] to State 2 -->[SKIP(newDaCapoRun)] to State 1 -->[SKIP(hasNext)] to State 1 -->[SKIP(next)] to State 1 Final State 2 (needStrongRefs[], collectableWeakRefs[], weakRefs[i], collectSets[], boundVars[i]) State 1 - collectable indices: [i] - primitive indices: [] - weak indices: [] - other indices: [] ===================================================== Symbol advice methods for tracematch tracematch$0: before$1 newDaCapoRun before$2 hasNext before$3 next Sync advice method for tracematch tracematch$0: beforeafter$4 Some advice method for tracematch tracematch$0: beforeafter$5 Body advice method for tracematch tracematch$0: tracematch$0$body Advice Dependencies for tracematch tracematch$0: strong: HasNext.before$3(i) weak: HasNext.before$2(i), HasNext.before$1, HasNext.tracematch$0$body, HasNext.beforeafter$5, HasNext.beforeafter$4 - - - - - - - - - - - - - - - - - - - - - - - - - - - ====================================================