MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. f1(A,B) -> f2(A,B) [0 >= 1 + A + B && A >= 1] (1,1) 1. f2(A,B) -> f2(A + -1*B,B) [A >= 0] (?,1) 2. f2(A,B) -> f3(A,B) [0 >= 1 + A] (?,1) Signature: {(f1,2);(f2,2);(f3,2)} Flow Graph: [0->{1,2},1->{1,2},2->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f1(A,B) -> f2(A,B) [0 >= 1 + A + B && A >= 1] (1,1) 1. f2(A,B) -> f2(A + -1*B,B) [A >= 0] (?,1) 2. f2(A,B) -> f3(A,B) [0 >= 1 + A] (1,1) Signature: {(f1,2);(f2,2);(f3,2)} Flow Graph: [0->{1,2},1->{1,2},2->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,2)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. f1(A,B) -> f2(A,B) [0 >= 1 + A + B && A >= 1] (1,1) 1. f2(A,B) -> f2(A + -1*B,B) [A >= 0] (?,1) 2. f2(A,B) -> f3(A,B) [0 >= 1 + A] (1,1) Signature: {(f1,2);(f2,2);(f3,2)} Flow Graph: [0->{1},1->{1,2},2->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. f1(A,B) -> f2(A,B) [0 >= 1 + A + B && A >= 1] (1,1) 1. f2(A,B) -> f2(A + -1*B,B) [A >= 0] (?,1) 2. f2(A,B) -> f3(A,B) [0 >= 1 + A] (?,1) 3. f2(A,B) -> exitus616(A,B) True (?,1) Signature: {(exitus616,2);(f1,2);(f2,2);(f3,2)} Flow Graph: [0->{1,2,3},1->{1,2,3},2->{},3->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,2)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. f1(A,B) -> f2(A,B) [0 >= 1 + A + B && A >= 1] (1,1) 1. f2(A,B) -> f2(A + -1*B,B) [A >= 0] (?,1) 2. f2(A,B) -> f3(A,B) [0 >= 1 + A] (?,1) 3. f2(A,B) -> exitus616(A,B) True (?,1) Signature: {(exitus616,2);(f1,2);(f2,2);(f3,2)} Flow Graph: [0->{1,3},1->{1,2,3},2->{},3->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3] | `- p:[1] c: [] MAYBE