YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + 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) [1 + -1*C >= 0 && -1 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 101] (?,1) 2. eval1(A,B,C,D) -> eval3(A,B,C,D) [1 + -1*C >= 0 && -1 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 100 >= A] (?,1) 3. eval3(A,B,C,D) -> eval3(11 + A,B,1 + C,D) [-1 + C >= 0 && 99 + -1*B + C >= 0 && 100 + -1*B >= 0 && A + -1*B >= 0 && 100 >= A] (?,1) 4. eval3(A,B,C,D) -> eval5(A,B,C,D) [-1 + C >= 0 && 99 + -1*B + C >= 0 && 100 + -1*B >= 0 && A + -1*B >= 0 && A >= 101] (?,1) 5. eval5(A,B,C,D) -> eval7(-10 + A,B,-1 + C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -102 + A + C >= 0 && 100 + -1*B >= 0 && -1 + A + -1*B >= 0 && -101 + A >= 0 && C >= 2] 6. eval7(A,B,C,D) -> eval5(A,B,C,-10 + A) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && A >= 101 && C = 1] 7. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 100 >= A] 8. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 2 >= C] 9. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && C >= 0] 10. eval9(A,B,C,D) -> eval11(-10 + A,B,-1 + C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && A >= 101] 11. eval9(A,B,C,D) -> eval11(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 100 >= A] 12. eval11(A,B,C,D) -> eval5(11 + A,B,1 + C,D) [C >= 0 && 100 + -1*B + C >= 0 && -91 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0] (?,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 WORST_CASE(?,POLY) + 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) [1 + -1*C >= 0 && -1 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 101] (1,1) 2. eval1(A,B,C,D) -> eval3(A,B,C,D) [1 + -1*C >= 0 && -1 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 100 >= A] (1,1) 3. eval3(A,B,C,D) -> eval3(11 + A,B,1 + C,D) [-1 + C >= 0 && 99 + -1*B + C >= 0 && 100 + -1*B >= 0 && A + -1*B >= 0 && 100 >= A] (?,1) 4. eval3(A,B,C,D) -> eval5(A,B,C,D) [-1 + C >= 0 && 99 + -1*B + C >= 0 && 100 + -1*B >= 0 && A + -1*B >= 0 && A >= 101] (1,1) 5. eval5(A,B,C,D) -> eval7(-10 + A,B,-1 + C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -102 + A + C >= 0 && 100 + -1*B >= 0 && -1 + A + -1*B >= 0 && -101 + A >= 0 && C >= 2] 6. eval7(A,B,C,D) -> eval5(A,B,C,-10 + A) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && A >= 101 && C = 1] 7. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 100 >= A] 8. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 2 >= C] 9. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && C >= 0] 10. eval9(A,B,C,D) -> eval11(-10 + A,B,-1 + C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && A >= 101] 11. eval9(A,B,C,D) -> eval11(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 100 >= A] 12. eval11(A,B,C,D) -> eval5(11 + A,B,1 + C,D) [C >= 0 && 100 + -1*B + C >= 0 && -91 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0] (?,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 WORST_CASE(?,POLY) + 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) [1 + -1*C >= 0 && -1 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 101] (1,1) 2. eval1(A,B,C,D) -> eval3(A,B,C,D) [1 + -1*C >= 0 && -1 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 100 >= A] (1,1) 3. eval3(A,B,C,D) -> eval3(11 + A,B,1 + C,D) [-1 + C >= 0 && 99 + -1*B + C >= 0 && 100 + -1*B >= 0 && A + -1*B >= 0 && 100 >= A] (?,1) 4. eval3(A,B,C,D) -> eval5(A,B,C,D) [-1 + C >= 0 && 99 + -1*B + C >= 0 && 100 + -1*B >= 0 && A + -1*B >= 0 && A >= 101] (1,1) 5. eval5(A,B,C,D) -> eval7(-10 + A,B,-1 + C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -102 + A + C >= 0 && 100 + -1*B >= 0 && -1 + A + -1*B >= 0 && -101 + A >= 0 && C >= 2] 6. eval7(A,B,C,D) -> eval5(A,B,C,-10 + A) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && A >= 101 && C = 1] 7. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 100 >= A] 8. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 2 >= C] 9. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && C >= 0] 10. eval9(A,B,C,D) -> eval11(-10 + A,B,-1 + C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && A >= 101] 11. eval9(A,B,C,D) -> eval11(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 100 >= A] 12. eval11(A,B,C,D) -> eval5(11 + A,B,1 + C,D) [C >= 0 && 100 + -1*B + C >= 0 && -91 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0] (?,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 WORST_CASE(?,POLY) + 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) [1 + -1*C >= 0 && -1 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 101] (?,1) 2. eval1(A,B,C,D) -> eval3(A,B,C,D) [1 + -1*C >= 0 && -1 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 100 >= A] (?,1) 3. eval3(A,B,C,D) -> eval3(11 + A,B,1 + C,D) [-1 + C >= 0 && 99 + -1*B + C >= 0 && 100 + -1*B >= 0 && A + -1*B >= 0 && 100 >= A] (?,1) 4. eval3(A,B,C,D) -> eval5(A,B,C,D) [-1 + C >= 0 && 99 + -1*B + C >= 0 && 100 + -1*B >= 0 && A + -1*B >= 0 && A >= 101] (?,1) 5. eval5(A,B,C,D) -> eval7(-10 + A,B,-1 + C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -102 + A + C >= 0 && 100 + -1*B >= 0 && -1 + A + -1*B >= 0 && -101 + A >= 0 && C >= 2] 6. eval7(A,B,C,D) -> eval5(A,B,C,-10 + A) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && A >= 101 && C = 1] 7. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 100 >= A] 8. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 2 >= C] 9. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && C >= 0] 10. eval9(A,B,C,D) -> eval11(-10 + A,B,-1 + C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && A >= 101] 11. eval9(A,B,C,D) -> eval11(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 100 >= A] 12. eval11(A,B,C,D) -> eval5(11 + A,B,1 + C,D) [C >= 0 && 100 + -1*B + C >= 0 && -91 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0] (?,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: LooptreeTransformer WORST_CASE(?,POLY) + 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) [1 + -1*C >= 0 && -1 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 101] (?,1) 2. eval1(A,B,C,D) -> eval3(A,B,C,D) [1 + -1*C >= 0 && -1 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 100 >= A] (?,1) 3. eval3(A,B,C,D) -> eval3(11 + A,B,1 + C,D) [-1 + C >= 0 && 99 + -1*B + C >= 0 && 100 + -1*B >= 0 && A + -1*B >= 0 && 100 >= A] (?,1) 4. eval3(A,B,C,D) -> eval5(A,B,C,D) [-1 + C >= 0 && 99 + -1*B + C >= 0 && 100 + -1*B >= 0 && A + -1*B >= 0 && A >= 101] (?,1) 5. eval5(A,B,C,D) -> eval7(-10 + A,B,-1 + C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -102 + A + C >= 0 && 100 + -1*B >= 0 && -1 + A + -1*B >= 0 && -101 + A >= 0 && C >= 2] 6. eval7(A,B,C,D) -> eval5(A,B,C,-10 + A) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && A >= 101 && C = 1] 7. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 100 >= A] 8. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 2 >= C] 9. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && C >= 0] 10. eval9(A,B,C,D) -> eval11(-10 + A,B,-1 + C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && A >= 101] 11. eval9(A,B,C,D) -> eval11(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 100 >= A] 12. eval11(A,B,C,D) -> eval5(11 + A,B,1 + C,D) [C >= 0 && 100 + -1*B + C >= 0 && -91 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0] (?,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: [11] | `- p:[5,12,10,8,9] c: [12] * Step 6: SizeAbstraction WORST_CASE(?,POLY) + 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) [1 + -1*C >= 0 && -1 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && A >= 101] (?,1) 2. eval1(A,B,C,D) -> eval3(A,B,C,D) [1 + -1*C >= 0 && -1 + C >= 0 && A + -1*B >= 0 && -1*A + B >= 0 && 100 >= A] (?,1) 3. eval3(A,B,C,D) -> eval3(11 + A,B,1 + C,D) [-1 + C >= 0 && 99 + -1*B + C >= 0 && 100 + -1*B >= 0 && A + -1*B >= 0 && 100 >= A] (?,1) 4. eval3(A,B,C,D) -> eval5(A,B,C,D) [-1 + C >= 0 && 99 + -1*B + C >= 0 && 100 + -1*B >= 0 && A + -1*B >= 0 && A >= 101] (?,1) 5. eval5(A,B,C,D) -> eval7(-10 + A,B,-1 + C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -102 + A + C >= 0 && 100 + -1*B >= 0 && -1 + A + -1*B >= 0 && -101 + A >= 0 && C >= 2] 6. eval7(A,B,C,D) -> eval5(A,B,C,-10 + A) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && A >= 101 && C = 1] 7. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 100 >= A] 8. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 2 >= C] 9. eval7(A,B,C,D) -> eval9(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && C >= 0] 10. eval9(A,B,C,D) -> eval11(-10 + A,B,-1 + C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && A >= 101] 11. eval9(A,B,C,D) -> eval11(A,B,C,D) [-1 + C >= 0 (?,1) && 99 + -1*B + C >= 0 && -92 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0 && 100 >= A] 12. eval11(A,B,C,D) -> eval5(11 + A,B,1 + C,D) [C >= 0 && 100 + -1*B + C >= 0 && -91 + A + C >= 0 && 100 + -1*B >= 0 && 9 + A + -1*B >= 0 && -91 + A >= 0] (?,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->{}] ,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: [11] | `- p:[5,12,10,8,9] c: [12]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,0.0,0.1,0.1.0] eval0 ~> eval1 [A <= B, B <= B, C <= K, D <= D] eval1 ~> end [A <= A, B <= B, C <= C, D <= D] eval1 ~> eval3 [A <= A, B <= B, C <= C, D <= D] eval3 ~> eval3 [A <= 10*K + A + C, B <= B, C <= K + C, D <= D] eval3 ~> eval5 [A <= A, B <= B, C <= C, D <= D] eval5 ~> eval7 [A <= A, B <= B, C <= C, D <= D] eval7 ~> eval5 [A <= A, B <= B, C <= C, D <= A] eval7 ~> eval9 [A <= A, B <= B, C <= C, D <= D] eval7 ~> eval9 [A <= A, B <= B, C <= C, D <= D] eval7 ~> eval9 [A <= A, B <= B, C <= C, D <= D] eval9 ~> eval11 [A <= A, B <= B, C <= C, D <= D] eval9 ~> eval11 [A <= A, B <= B, C <= C, D <= D] eval11 ~> eval5 [A <= 11*K + A, B <= B, C <= A + C, D <= D] eval7 ~> exitus616 [A <= A, B <= B, C <= C, D <= D] eval1 ~> exitus616 [A <= A, B <= B, C <= C, D <= D] + Loop: [0.0 <= 1091*K + A + 10*B + 10*C] eval3 ~> eval3 [A <= 10*K + A + C, B <= B, C <= K + C, D <= D] + Loop: [0.1 <= 93*K + A + 9*C] eval5 ~> eval7 [A <= A, B <= B, C <= C, D <= D] eval11 ~> eval5 [A <= 11*K + A, B <= B, C <= A + C, D <= D] eval9 ~> eval11 [A <= A, B <= B, C <= C, D <= D] eval7 ~> eval9 [A <= A, B <= B, C <= C, D <= D] eval7 ~> eval9 [A <= A, B <= B, C <= C, D <= D] eval9 ~> eval11 [A <= A, B <= B, C <= C, D <= D] eval7 ~> eval9 [A <= A, B <= B, C <= C, D <= D] + Loop: [0.1.0 <= K + C] eval5 ~> eval7 [A <= A, B <= B, C <= C, D <= D] eval11 ~> eval5 [A <= 11*K + A, B <= B, C <= A + C, D <= D] eval9 ~> eval11 [A <= A, B <= B, C <= C, D <= D] eval7 ~> eval9 [A <= A, B <= B, C <= C, D <= D] eval7 ~> eval9 [A <= A, B <= B, C <= C, D <= D] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,0.0,0.1,0.1.0] eval0 ~> eval1 [B ~=> A,K ~=> C] eval1 ~> end [] eval1 ~> eval3 [] eval3 ~> eval3 [A ~+> A,C ~+> A,C ~+> C,K ~+> C,K ~*> A] eval3 ~> eval5 [] eval5 ~> eval7 [] eval7 ~> eval5 [A ~=> D] eval7 ~> eval9 [] eval7 ~> eval9 [] eval7 ~> eval9 [] eval9 ~> eval11 [] eval9 ~> eval11 [] eval11 ~> eval5 [A ~+> A,A ~+> C,C ~+> C,K ~*> A] eval7 ~> exitus616 [] eval1 ~> exitus616 [] + Loop: [A ~+> 0.0,B ~*> 0.0,C ~*> 0.0,K ~*> 0.0] eval3 ~> eval3 [A ~+> A,C ~+> A,C ~+> C,K ~+> C,K ~*> A] + Loop: [A ~+> 0.1,C ~*> 0.1,K ~*> 0.1] eval5 ~> eval7 [] eval11 ~> eval5 [A ~+> A,A ~+> C,C ~+> C,K ~*> A] eval9 ~> eval11 [] eval7 ~> eval9 [] eval7 ~> eval9 [] eval9 ~> eval11 [] eval7 ~> eval9 [] + Loop: [C ~+> 0.1.0,K ~+> 0.1.0] eval5 ~> eval7 [] eval11 ~> eval5 [A ~+> A,A ~+> C,C ~+> C,K ~*> A] eval9 ~> eval11 [] eval7 ~> eval9 [] eval7 ~> eval9 [] + Applied Processor: LareProcessor + Details: eval0 ~> exitus616 [B ~=> A ,B ~=> D ,K ~=> C ,B ~+> A ,B ~+> C ,B ~+> D ,B ~+> 0.0 ,B ~+> 0.1 ,B ~+> 0.1.0 ,B ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> C ,K ~+> D ,K ~+> 0.1 ,K ~+> 0.1.0 ,K ~+> tick ,B ~*> A ,B ~*> C ,B ~*> D ,B ~*> 0.0 ,B ~*> 0.1 ,B ~*> 0.1.0 ,B ~*> tick ,K ~*> A ,K ~*> C ,K ~*> D ,K ~*> 0.0 ,K ~*> 0.1 ,K ~*> 0.1.0 ,K ~*> tick] eval0 ~> end [B ~=> A,K ~=> C] + eval3> [A ~+> A ,A ~+> 0.0 ,A ~+> tick ,C ~+> A ,C ~+> C ,tick ~+> tick ,K ~+> A ,K ~+> C ,A ~*> A ,A ~*> C ,B ~*> A ,B ~*> C ,B ~*> 0.0 ,B ~*> tick ,C ~*> A ,C ~*> C ,C ~*> 0.0 ,C ~*> tick ,K ~*> A ,K ~*> C ,K ~*> 0.0 ,K ~*> tick] + eval7> [A ~+> A ,A ~+> C ,A ~+> 0.1 ,A ~+> tick ,C ~+> C ,C ~+> 0.1.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.1.0 ,K ~+> tick ,A ~*> C ,C ~*> A ,C ~*> C ,C ~*> 0.1 ,C ~*> tick ,K ~*> A ,K ~*> C ,K ~*> 0.1 ,K ~*> tick] + eval7> [A ~+> A ,A ~+> C ,C ~+> C ,C ~+> 0.1.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.1.0 ,K ~+> tick ,A ~*> C ,C ~*> A ,C ~*> C ,K ~*> A ,K ~*> C] YES(?,POLY)