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