NO * Step 1: Looptree NO + Considered Problem: Rules: 0. start(A,B) -> eval(A,B) True (1,1) 1. eval(A,B) -> eval(-2 + B,1 + A) [A >= 1 && B >= 1] (?,1) 2. eval(A,B) -> eval(-1 + A,A) [A >= 1 && B >= 1] (?,1) Signature: {(eval,2);(start,2)} Flow Graph: [0->{1,2},1->{1,2},2->{1,2}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2] | `- p:[1,2] c: [] NO