MAYBE * Step 1: AddSinks MAYBE + Considered Problem: Rules: 0. f0(A,B) -> f1(A,B) [A >= 1 && 0 >= 1 + B] (1,1) 1. f1(A,B) -> f1(A + -1*B,B) [A >= 1 + B && 0 >= 1 + B] (?,1) Signature: {(f0,2);(f1,2)} Flow Graph: [0->{1},1->{1}] + Applied Processor: AddSinks + Details: () * Step 2: Failure MAYBE + Considered Problem: Rules: 0. f0(A,B) -> f1(A,B) [A >= 1 && 0 >= 1 + B] (1,1) 1. f1(A,B) -> f1(A + -1*B,B) [A >= 1 + B && 0 >= 1 + B] (?,1) 2. f1(A,B) -> exitus616(A,B) True (?,1) Signature: {(exitus616,2);(f0,2);(f1,2)} Flow Graph: [0->{1,2},1->{1,2},2->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2] | `- p:[1] c: [] MAYBE