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