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