MAYBE * Step 1: TrivialSCCs MAYBE + Considered Problem: Rules: 0. eval0(A,B,C,D) -> eval1(B,B,1,D) True (1,1) 1. eval1(A,B,C,D) -> end(A,B,C,D) [A >= 101] (?,1) 2. eval1(A,B,C,D) -> eval3(A,B,C,D) [100 >= A] (?,1) 3. eval3(A,B,C,D) -> eval3(11 + A,B,1 + C,D) [100 >= A] (?,1) 4. eval3(A,B,C,D) -> eval5(A,B,C,D) [A >= 101] (?,1) 5. eval5(A,B,C,D) -> eval7(-10 + A,B,-1 + C,D) [C >= 2] (?,1) 6. eval7(A,B,C,D) -> eval5(A,B,C,-10 + A) [A >= 101 && C = 1] (?,1) 7. eval7(A,B,C,D) -> eval9(A,B,C,D) [100 >= A] (?,1) 8. eval7(A,B,C,D) -> eval9(A,B,C,D) [2 >= C] (?,1) 9. eval7(A,B,C,D) -> eval9(A,B,C,D) [C >= 0] (?,1) 10. eval9(A,B,C,D) -> eval11(-10 + A,B,-1 + C,D) [A >= 101] (?,1) 11. eval9(A,B,C,D) -> eval11(A,B,C,D) [100 >= A] (?,1) 12. eval11(A,B,C,D) -> eval5(11 + A,B,1 + C,D) True (?,1) Signature: {(end,4);(eval0,4);(eval1,4);(eval11,4);(eval3,4);(eval5,4);(eval7,4);(eval9,4)} Flow Graph: [0->{1,2},1->{},2->{3,4},3->{3,4},4->{5},5->{6,7,8,9},6->{5},7->{10,11},8->{10,11},9->{10,11},10->{12} ,11->{12},12->{5}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. eval0(A,B,C,D) -> eval1(B,B,1,D) True (1,1) 1. eval1(A,B,C,D) -> end(A,B,C,D) [A >= 101] (1,1) 2. eval1(A,B,C,D) -> eval3(A,B,C,D) [100 >= A] (1,1) 3. eval3(A,B,C,D) -> eval3(11 + A,B,1 + C,D) [100 >= A] (?,1) 4. eval3(A,B,C,D) -> eval5(A,B,C,D) [A >= 101] (1,1) 5. eval5(A,B,C,D) -> eval7(-10 + A,B,-1 + C,D) [C >= 2] (?,1) 6. eval7(A,B,C,D) -> eval5(A,B,C,-10 + A) [A >= 101 && C = 1] (?,1) 7. eval7(A,B,C,D) -> eval9(A,B,C,D) [100 >= A] (?,1) 8. eval7(A,B,C,D) -> eval9(A,B,C,D) [2 >= C] (?,1) 9. eval7(A,B,C,D) -> eval9(A,B,C,D) [C >= 0] (?,1) 10. eval9(A,B,C,D) -> eval11(-10 + A,B,-1 + C,D) [A >= 101] (?,1) 11. eval9(A,B,C,D) -> eval11(A,B,C,D) [100 >= A] (?,1) 12. eval11(A,B,C,D) -> eval5(11 + A,B,1 + C,D) True (?,1) Signature: {(end,4);(eval0,4);(eval1,4);(eval11,4);(eval3,4);(eval5,4);(eval7,4);(eval9,4)} Flow Graph: [0->{1,2},1->{},2->{3,4},3->{3,4},4->{5},5->{6,7,8,9},6->{5},7->{10,11},8->{10,11},9->{10,11},10->{12} ,11->{12},12->{5}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,4),(6,5),(7,10)] * Step 3: AddSinks MAYBE + Considered Problem: Rules: 0. eval0(A,B,C,D) -> eval1(B,B,1,D) True (1,1) 1. eval1(A,B,C,D) -> end(A,B,C,D) [A >= 101] (1,1) 2. eval1(A,B,C,D) -> eval3(A,B,C,D) [100 >= A] (1,1) 3. eval3(A,B,C,D) -> eval3(11 + A,B,1 + C,D) [100 >= A] (?,1) 4. eval3(A,B,C,D) -> eval5(A,B,C,D) [A >= 101] (1,1) 5. eval5(A,B,C,D) -> eval7(-10 + A,B,-1 + C,D) [C >= 2] (?,1) 6. eval7(A,B,C,D) -> eval5(A,B,C,-10 + A) [A >= 101 && C = 1] (?,1) 7. eval7(A,B,C,D) -> eval9(A,B,C,D) [100 >= A] (?,1) 8. eval7(A,B,C,D) -> eval9(A,B,C,D) [2 >= C] (?,1) 9. eval7(A,B,C,D) -> eval9(A,B,C,D) [C >= 0] (?,1) 10. eval9(A,B,C,D) -> eval11(-10 + A,B,-1 + C,D) [A >= 101] (?,1) 11. eval9(A,B,C,D) -> eval11(A,B,C,D) [100 >= A] (?,1) 12. eval11(A,B,C,D) -> eval5(11 + A,B,1 + C,D) True (?,1) Signature: {(end,4);(eval0,4);(eval1,4);(eval11,4);(eval3,4);(eval5,4);(eval7,4);(eval9,4)} Flow Graph: [0->{1,2},1->{},2->{3},3->{3,4},4->{5},5->{6,7,8,9},6->{},7->{11},8->{10,11},9->{10,11},10->{12},11->{12} ,12->{5}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + Considered Problem: Rules: 0. eval0(A,B,C,D) -> eval1(B,B,1,D) True (1,1) 1. eval1(A,B,C,D) -> end(A,B,C,D) [A >= 101] (?,1) 2. eval1(A,B,C,D) -> eval3(A,B,C,D) [100 >= A] (?,1) 3. eval3(A,B,C,D) -> eval3(11 + A,B,1 + C,D) [100 >= A] (?,1) 4. eval3(A,B,C,D) -> eval5(A,B,C,D) [A >= 101] (?,1) 5. eval5(A,B,C,D) -> eval7(-10 + A,B,-1 + C,D) [C >= 2] (?,1) 6. eval7(A,B,C,D) -> eval5(A,B,C,-10 + A) [A >= 101 && C = 1] (?,1) 7. eval7(A,B,C,D) -> eval9(A,B,C,D) [100 >= A] (?,1) 8. eval7(A,B,C,D) -> eval9(A,B,C,D) [2 >= C] (?,1) 9. eval7(A,B,C,D) -> eval9(A,B,C,D) [C >= 0] (?,1) 10. eval9(A,B,C,D) -> eval11(-10 + A,B,-1 + C,D) [A >= 101] (?,1) 11. eval9(A,B,C,D) -> eval11(A,B,C,D) [100 >= A] (?,1) 12. eval11(A,B,C,D) -> eval5(11 + A,B,1 + C,D) True (?,1) 13. eval7(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) 14. eval1(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) Signature: {(end,4);(eval0,4);(eval1,4);(eval11,4);(eval3,4);(eval5,4);(eval7,4);(eval9,4);(exitus616,4)} Flow Graph: [0->{1,2,14},1->{},2->{3,4},3->{3,4},4->{5},5->{6,7,8,9,13},6->{5},7->{10,11},8->{10,11},9->{10,11} ,10->{12},11->{12},12->{5},13->{},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,4),(6,5),(7,10)] * Step 5: Failure MAYBE + Considered Problem: Rules: 0. eval0(A,B,C,D) -> eval1(B,B,1,D) True (1,1) 1. eval1(A,B,C,D) -> end(A,B,C,D) [A >= 101] (?,1) 2. eval1(A,B,C,D) -> eval3(A,B,C,D) [100 >= A] (?,1) 3. eval3(A,B,C,D) -> eval3(11 + A,B,1 + C,D) [100 >= A] (?,1) 4. eval3(A,B,C,D) -> eval5(A,B,C,D) [A >= 101] (?,1) 5. eval5(A,B,C,D) -> eval7(-10 + A,B,-1 + C,D) [C >= 2] (?,1) 6. eval7(A,B,C,D) -> eval5(A,B,C,-10 + A) [A >= 101 && C = 1] (?,1) 7. eval7(A,B,C,D) -> eval9(A,B,C,D) [100 >= A] (?,1) 8. eval7(A,B,C,D) -> eval9(A,B,C,D) [2 >= C] (?,1) 9. eval7(A,B,C,D) -> eval9(A,B,C,D) [C >= 0] (?,1) 10. eval9(A,B,C,D) -> eval11(-10 + A,B,-1 + C,D) [A >= 101] (?,1) 11. eval9(A,B,C,D) -> eval11(A,B,C,D) [100 >= A] (?,1) 12. eval11(A,B,C,D) -> eval5(11 + A,B,1 + C,D) True (?,1) 13. eval7(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) 14. eval1(A,B,C,D) -> exitus616(A,B,C,D) True (?,1) Signature: {(end,4);(eval0,4);(eval1,4);(eval11,4);(eval3,4);(eval5,4);(eval7,4);(eval9,4);(exitus616,4)} Flow Graph: [0->{1,2,14},1->{},2->{3},3->{3,4},4->{5},5->{6,7,8,9,13},6->{},7->{11},8->{10,11},9->{10,11},10->{12} ,11->{12},12->{5},13->{},14->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14] | +- p:[3] c: [3] | `- p:[5,12,10,8,9,11,7] c: [] MAYBE