YES(?,O(1)) * Step 1: ArgumentFilter WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f16(A,B,C,D,E,F,G,H,I,J) -> f19(A,0,C,D,E,F,G,H,I,J) [A >= 0 && 19 >= A] (?,1) 1. f33(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,0,E,F,G,H,I,J) [C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && 19 >= C] (?,1) 2. f52(A,B,C,D,E,F,G,H,I,J) -> f55(A,B,C,D,E,0,G,H,I,J) [E >= 0 (?,1) && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= E] 3. f55(A,B,C,D,E,F,G,H,I,J) -> f59(A,B,C,D,E,F,0,H,I,J) [F >= 0 (?,1) && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= F] 4. f59(A,B,C,D,E,F,G,H,I,J) -> f59(A,B,C,D,E,F,1 + G,H,I,J) [G >= 0 (?,1) && F + G >= 0 && E + G >= 0 && -20 + C + G >= 0 && -20 + A + G >= 0 && F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= G] 5. f59(A,B,C,D,E,F,G,H,I,J) -> f55(A,B,C,D,E,1 + F,G,H,I,J) [G >= 0 (?,1) && F + G >= 0 && E + G >= 0 && -20 + C + G >= 0 && -20 + A + G >= 0 && F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && G >= 20] 6. f55(A,B,C,D,E,F,G,H,I,J) -> f52(A,B,C,D,1 + E,F,G,H,I,J) [F >= 0 (?,1) && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && F >= 20] 7. f52(A,B,C,D,E,F,G,H,I,J) -> f73(A,B,C,D,E,F,G,H,I,J) [E >= 0 (?,1) && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && E >= 20] 8. f36(A,B,C,D,E,F,G,H,I,J) -> f36(A,B,C,1 + D,E,F,G,K,K,J) [D >= 0 && C + D >= 0 && -20 + A + D >= 0 && C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && 19 >= D] (?,1) 9. f36(A,B,C,D,E,F,G,H,I,J) -> f33(A,B,1 + C,D,E,F,G,H,I,J) [D >= 0 && C + D >= 0 && -20 + A + D >= 0 && C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && D >= 20] (?,1) 10. f33(A,B,C,D,E,F,G,H,I,J) -> f52(A,B,C,D,0,F,G,H,I,J) [C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && C >= 20] (?,1) 11. f19(A,B,C,D,E,F,G,H,I,J) -> f19(A,1 + B,C,D,E,F,G,K,I,K) [B >= 0 && A + B >= 0 && A >= 0 && 19 >= B] (?,1) 12. f19(A,B,C,D,E,F,G,H,I,J) -> f16(1 + A,B,C,D,E,F,G,H,I,J) [B >= 0 && A + B >= 0 && A >= 0 && B >= 20] (?,1) 13. f16(A,B,C,D,E,F,G,H,I,J) -> f33(A,B,0,D,E,F,G,H,I,J) [A >= 0 && A >= 20] (?,1) 14. f0(A,B,C,D,E,F,G,H,I,J) -> f16(0,B,C,D,E,F,G,0,I,J) True (1,1) Signature: {(f0,10);(f16,10);(f19,10);(f33,10);(f36,10);(f52,10);(f55,10);(f59,10);(f73,10)} Flow Graph: [0->{11,12},1->{8,9},2->{3,6},3->{4,5},4->{4,5},5->{3,6},6->{2,7},7->{},8->{8,9},9->{1,10},10->{2,7} ,11->{11,12},12->{0,13},13->{1,10},14->{0,13}] + Applied Processor: ArgumentFilter [7,8,9] + Details: We remove following argument positions: [7,8,9]. * Step 2: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f16(A,B,C,D,E,F,G) -> f19(A,0,C,D,E,F,G) [A >= 0 && 19 >= A] (?,1) 1. f33(A,B,C,D,E,F,G) -> f36(A,B,C,0,E,F,G) [C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && 19 >= C] (?,1) 2. f52(A,B,C,D,E,F,G) -> f55(A,B,C,D,E,0,G) [E >= 0 (?,1) && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= E] 3. f55(A,B,C,D,E,F,G) -> f59(A,B,C,D,E,F,0) [F >= 0 (?,1) && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= F] 4. f59(A,B,C,D,E,F,G) -> f59(A,B,C,D,E,F,1 + G) [G >= 0 (?,1) && F + G >= 0 && E + G >= 0 && -20 + C + G >= 0 && -20 + A + G >= 0 && F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= G] 5. f59(A,B,C,D,E,F,G) -> f55(A,B,C,D,E,1 + F,G) [G >= 0 (?,1) && F + G >= 0 && E + G >= 0 && -20 + C + G >= 0 && -20 + A + G >= 0 && F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && G >= 20] 6. f55(A,B,C,D,E,F,G) -> f52(A,B,C,D,1 + E,F,G) [F >= 0 (?,1) && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && F >= 20] 7. f52(A,B,C,D,E,F,G) -> f73(A,B,C,D,E,F,G) [E >= 0 (?,1) && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && E >= 20] 8. f36(A,B,C,D,E,F,G) -> f36(A,B,C,1 + D,E,F,G) [D >= 0 && C + D >= 0 && -20 + A + D >= 0 && C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && 19 >= D] (?,1) 9. f36(A,B,C,D,E,F,G) -> f33(A,B,1 + C,D,E,F,G) [D >= 0 && C + D >= 0 && -20 + A + D >= 0 && C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && D >= 20] (?,1) 10. f33(A,B,C,D,E,F,G) -> f52(A,B,C,D,0,F,G) [C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && C >= 20] (?,1) 11. f19(A,B,C,D,E,F,G) -> f19(A,1 + B,C,D,E,F,G) [B >= 0 && A + B >= 0 && A >= 0 && 19 >= B] (?,1) 12. f19(A,B,C,D,E,F,G) -> f16(1 + A,B,C,D,E,F,G) [B >= 0 && A + B >= 0 && A >= 0 && B >= 20] (?,1) 13. f16(A,B,C,D,E,F,G) -> f33(A,B,0,D,E,F,G) [A >= 0 && A >= 20] (?,1) 14. f0(A,B,C,D,E,F,G) -> f16(0,B,C,D,E,F,G) True (1,1) Signature: {(f0,10);(f16,10);(f19,10);(f33,10);(f36,10);(f52,10);(f55,10);(f59,10);(f73,10)} Flow Graph: [0->{11,12},1->{8,9},2->{3,6},3->{4,5},4->{4,5},5->{3,6},6->{2,7},7->{},8->{8,9},9->{1,10},10->{2,7} ,11->{11,12},12->{0,13},13->{1,10},14->{0,13}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,12),(1,9),(2,6),(3,5),(10,7),(13,10),(14,13)] * Step 3: FromIts WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f16(A,B,C,D,E,F,G) -> f19(A,0,C,D,E,F,G) [A >= 0 && 19 >= A] (?,1) 1. f33(A,B,C,D,E,F,G) -> f36(A,B,C,0,E,F,G) [C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && 19 >= C] (?,1) 2. f52(A,B,C,D,E,F,G) -> f55(A,B,C,D,E,0,G) [E >= 0 (?,1) && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= E] 3. f55(A,B,C,D,E,F,G) -> f59(A,B,C,D,E,F,0) [F >= 0 (?,1) && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= F] 4. f59(A,B,C,D,E,F,G) -> f59(A,B,C,D,E,F,1 + G) [G >= 0 (?,1) && F + G >= 0 && E + G >= 0 && -20 + C + G >= 0 && -20 + A + G >= 0 && F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= G] 5. f59(A,B,C,D,E,F,G) -> f55(A,B,C,D,E,1 + F,G) [G >= 0 (?,1) && F + G >= 0 && E + G >= 0 && -20 + C + G >= 0 && -20 + A + G >= 0 && F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && G >= 20] 6. f55(A,B,C,D,E,F,G) -> f52(A,B,C,D,1 + E,F,G) [F >= 0 (?,1) && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && F >= 20] 7. f52(A,B,C,D,E,F,G) -> f73(A,B,C,D,E,F,G) [E >= 0 (?,1) && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && E >= 20] 8. f36(A,B,C,D,E,F,G) -> f36(A,B,C,1 + D,E,F,G) [D >= 0 && C + D >= 0 && -20 + A + D >= 0 && C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && 19 >= D] (?,1) 9. f36(A,B,C,D,E,F,G) -> f33(A,B,1 + C,D,E,F,G) [D >= 0 && C + D >= 0 && -20 + A + D >= 0 && C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && D >= 20] (?,1) 10. f33(A,B,C,D,E,F,G) -> f52(A,B,C,D,0,F,G) [C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && C >= 20] (?,1) 11. f19(A,B,C,D,E,F,G) -> f19(A,1 + B,C,D,E,F,G) [B >= 0 && A + B >= 0 && A >= 0 && 19 >= B] (?,1) 12. f19(A,B,C,D,E,F,G) -> f16(1 + A,B,C,D,E,F,G) [B >= 0 && A + B >= 0 && A >= 0 && B >= 20] (?,1) 13. f16(A,B,C,D,E,F,G) -> f33(A,B,0,D,E,F,G) [A >= 0 && A >= 20] (?,1) 14. f0(A,B,C,D,E,F,G) -> f16(0,B,C,D,E,F,G) True (1,1) Signature: {(f0,10);(f16,10);(f19,10);(f33,10);(f36,10);(f52,10);(f55,10);(f59,10);(f73,10)} Flow Graph: [0->{11},1->{8},2->{3},3->{4},4->{4,5},5->{3,6},6->{2,7},7->{},8->{8,9},9->{1,10},10->{2},11->{11,12} ,12->{0,13},13->{1},14->{0}] + Applied Processor: FromIts + Details: () * Step 4: AddSinks WORST_CASE(?,O(1)) + Considered Problem: Rules: f16(A,B,C,D,E,F,G) -> f19(A,0,C,D,E,F,G) [A >= 0 && 19 >= A] f33(A,B,C,D,E,F,G) -> f36(A,B,C,0,E,F,G) [C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && 19 >= C] f52(A,B,C,D,E,F,G) -> f55(A,B,C,D,E,0,G) [E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= E] f55(A,B,C,D,E,F,G) -> f59(A,B,C,D,E,F,0) [F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= F] f59(A,B,C,D,E,F,G) -> f59(A,B,C,D,E,F,1 + G) [G >= 0 && F + G >= 0 && E + G >= 0 && -20 + C + G >= 0 && -20 + A + G >= 0 && F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= G] f59(A,B,C,D,E,F,G) -> f55(A,B,C,D,E,1 + F,G) [G >= 0 && F + G >= 0 && E + G >= 0 && -20 + C + G >= 0 && -20 + A + G >= 0 && F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && G >= 20] f55(A,B,C,D,E,F,G) -> f52(A,B,C,D,1 + E,F,G) [F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && F >= 20] f52(A,B,C,D,E,F,G) -> f73(A,B,C,D,E,F,G) [E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && E >= 20] f36(A,B,C,D,E,F,G) -> f36(A,B,C,1 + D,E,F,G) [D >= 0 && C + D >= 0 && -20 + A + D >= 0 && C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && 19 >= D] f36(A,B,C,D,E,F,G) -> f33(A,B,1 + C,D,E,F,G) [D >= 0 && C + D >= 0 && -20 + A + D >= 0 && C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && D >= 20] f33(A,B,C,D,E,F,G) -> f52(A,B,C,D,0,F,G) [C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && C >= 20] f19(A,B,C,D,E,F,G) -> f19(A,1 + B,C,D,E,F,G) [B >= 0 && A + B >= 0 && A >= 0 && 19 >= B] f19(A,B,C,D,E,F,G) -> f16(1 + A,B,C,D,E,F,G) [B >= 0 && A + B >= 0 && A >= 0 && B >= 20] f16(A,B,C,D,E,F,G) -> f33(A,B,0,D,E,F,G) [A >= 0 && A >= 20] f0(A,B,C,D,E,F,G) -> f16(0,B,C,D,E,F,G) True Signature: {(f0,10);(f16,10);(f19,10);(f33,10);(f36,10);(f52,10);(f55,10);(f59,10);(f73,10)} Rule Graph: [0->{11},1->{8},2->{3},3->{4},4->{4,5},5->{3,6},6->{2,7},7->{},8->{8,9},9->{1,10},10->{2},11->{11,12} ,12->{0,13},13->{1},14->{0}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose WORST_CASE(?,O(1)) + Considered Problem: Rules: f16(A,B,C,D,E,F,G) -> f19(A,0,C,D,E,F,G) [A >= 0 && 19 >= A] f33(A,B,C,D,E,F,G) -> f36(A,B,C,0,E,F,G) [C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && 19 >= C] f52(A,B,C,D,E,F,G) -> f55(A,B,C,D,E,0,G) [E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= E] f55(A,B,C,D,E,F,G) -> f59(A,B,C,D,E,F,0) [F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= F] f59(A,B,C,D,E,F,G) -> f59(A,B,C,D,E,F,1 + G) [G >= 0 && F + G >= 0 && E + G >= 0 && -20 + C + G >= 0 && -20 + A + G >= 0 && F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= G] f59(A,B,C,D,E,F,G) -> f55(A,B,C,D,E,1 + F,G) [G >= 0 && F + G >= 0 && E + G >= 0 && -20 + C + G >= 0 && -20 + A + G >= 0 && F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && G >= 20] f55(A,B,C,D,E,F,G) -> f52(A,B,C,D,1 + E,F,G) [F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && F >= 20] f52(A,B,C,D,E,F,G) -> f73(A,B,C,D,E,F,G) [E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && E >= 20] f36(A,B,C,D,E,F,G) -> f36(A,B,C,1 + D,E,F,G) [D >= 0 && C + D >= 0 && -20 + A + D >= 0 && C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && 19 >= D] f36(A,B,C,D,E,F,G) -> f33(A,B,1 + C,D,E,F,G) [D >= 0 && C + D >= 0 && -20 + A + D >= 0 && C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && D >= 20] f33(A,B,C,D,E,F,G) -> f52(A,B,C,D,0,F,G) [C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && C >= 20] f19(A,B,C,D,E,F,G) -> f19(A,1 + B,C,D,E,F,G) [B >= 0 && A + B >= 0 && A >= 0 && 19 >= B] f19(A,B,C,D,E,F,G) -> f16(1 + A,B,C,D,E,F,G) [B >= 0 && A + B >= 0 && A >= 0 && B >= 20] f16(A,B,C,D,E,F,G) -> f33(A,B,0,D,E,F,G) [A >= 0 && A >= 20] f0(A,B,C,D,E,F,G) -> f16(0,B,C,D,E,F,G) True f73(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True Signature: {(exitus616,7);(f0,10);(f16,10);(f19,10);(f33,10);(f36,10);(f52,10);(f55,10);(f59,10);(f73,10)} Rule Graph: [0->{11},1->{8},2->{3},3->{4},4->{4,5},5->{3,6},6->{2,7},7->{15},8->{8,9},9->{1,10},10->{2},11->{11,12} ,12->{0,13},13->{1},14->{0}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15] | +- p:[0,12,11] c: [0,12] | | | `- p:[11] c: [11] | +- p:[1,9,8] c: [1,9] | | | `- p:[8] c: [8] | `- p:[2,6,5,4,3] c: [2,6] | `- p:[3,5,4] c: [3,5] | `- p:[4] c: [4] * Step 6: AbstractSize WORST_CASE(?,O(1)) + Considered Problem: (Rules: f16(A,B,C,D,E,F,G) -> f19(A,0,C,D,E,F,G) [A >= 0 && 19 >= A] f33(A,B,C,D,E,F,G) -> f36(A,B,C,0,E,F,G) [C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && 19 >= C] f52(A,B,C,D,E,F,G) -> f55(A,B,C,D,E,0,G) [E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= E] f55(A,B,C,D,E,F,G) -> f59(A,B,C,D,E,F,0) [F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= F] f59(A,B,C,D,E,F,G) -> f59(A,B,C,D,E,F,1 + G) [G >= 0 && F + G >= 0 && E + G >= 0 && -20 + C + G >= 0 && -20 + A + G >= 0 && F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && 19 >= G] f59(A,B,C,D,E,F,G) -> f55(A,B,C,D,E,1 + F,G) [G >= 0 && F + G >= 0 && E + G >= 0 && -20 + C + G >= 0 && -20 + A + G >= 0 && F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && G >= 20] f55(A,B,C,D,E,F,G) -> f52(A,B,C,D,1 + E,F,G) [F >= 0 && E + F >= 0 && -20 + C + F >= 0 && -20 + A + F >= 0 && E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && F >= 20] f52(A,B,C,D,E,F,G) -> f73(A,B,C,D,E,F,G) [E >= 0 && -20 + C + E >= 0 && -20 + A + E >= 0 && -20 + C >= 0 && -40 + A + C >= 0 && -20 + A >= 0 && E >= 20] f36(A,B,C,D,E,F,G) -> f36(A,B,C,1 + D,E,F,G) [D >= 0 && C + D >= 0 && -20 + A + D >= 0 && C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && 19 >= D] f36(A,B,C,D,E,F,G) -> f33(A,B,1 + C,D,E,F,G) [D >= 0 && C + D >= 0 && -20 + A + D >= 0 && C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && D >= 20] f33(A,B,C,D,E,F,G) -> f52(A,B,C,D,0,F,G) [C >= 0 && -20 + A + C >= 0 && -20 + A >= 0 && C >= 20] f19(A,B,C,D,E,F,G) -> f19(A,1 + B,C,D,E,F,G) [B >= 0 && A + B >= 0 && A >= 0 && 19 >= B] f19(A,B,C,D,E,F,G) -> f16(1 + A,B,C,D,E,F,G) [B >= 0 && A + B >= 0 && A >= 0 && B >= 20] f16(A,B,C,D,E,F,G) -> f33(A,B,0,D,E,F,G) [A >= 0 && A >= 20] f0(A,B,C,D,E,F,G) -> f16(0,B,C,D,E,F,G) True f73(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True Signature: {(exitus616,7);(f0,10);(f16,10);(f19,10);(f33,10);(f36,10);(f52,10);(f55,10);(f59,10);(f73,10)} Rule Graph: [0->{11},1->{8},2->{3},3->{4},4->{4,5},5->{3,6},6->{2,7},7->{15},8->{8,9},9->{1,10},10->{2},11->{11,12} ,12->{0,13},13->{1},14->{0}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15] | +- p:[0,12,11] c: [0,12] | | | `- p:[11] c: [11] | +- p:[1,9,8] c: [1,9] | | | `- p:[8] c: [8] | `- p:[2,6,5,4,3] c: [2,6] | `- p:[3,5,4] c: [3,5] | `- p:[4] c: [4]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,0.0,0.0.0,0.1,0.1.0,0.2,0.2.0,0.2.0.0] f16 ~> f19 [A <= A, B <= 0*K, C <= C, D <= D, E <= E, F <= F, G <= G] f33 ~> f36 [A <= A, B <= B, C <= C, D <= 0*K, E <= E, F <= F, G <= G] f52 ~> f55 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= 0*K, G <= G] f55 ~> f59 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= 0*K] f59 ~> f59 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= 20*K] f59 ~> f55 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F + G, G <= G] f55 ~> f52 [A <= A, B <= B, C <= C, D <= D, E <= E + F, F <= F, G <= G] f52 ~> f73 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] f36 ~> f36 [A <= A, B <= B, C <= C, D <= 20*K, E <= E, F <= F, G <= G] f36 ~> f33 [A <= A, B <= B, C <= C + D, D <= D, E <= E, F <= F, G <= G] f33 ~> f52 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= G] f19 ~> f19 [A <= A, B <= 20*K, C <= C, D <= D, E <= E, F <= F, G <= G] f19 ~> f16 [A <= A + B, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] f16 ~> f33 [A <= A, B <= B, C <= 0*K, D <= D, E <= E, F <= F, G <= G] f0 ~> f16 [A <= 0*K, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] f73 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] + Loop: [0.0 <= 19*K + A] f16 ~> f19 [A <= A, B <= 0*K, C <= C, D <= D, E <= E, F <= F, G <= G] f19 ~> f16 [A <= A + B, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] f19 ~> f19 [A <= A, B <= 20*K, C <= C, D <= D, E <= E, F <= F, G <= G] + Loop: [0.0.0 <= 19*K + B] f19 ~> f19 [A <= A, B <= 20*K, C <= C, D <= D, E <= E, F <= F, G <= G] + Loop: [0.1 <= 19*K + C] f33 ~> f36 [A <= A, B <= B, C <= C, D <= 0*K, E <= E, F <= F, G <= G] f36 ~> f33 [A <= A, B <= B, C <= C + D, D <= D, E <= E, F <= F, G <= G] f36 ~> f36 [A <= A, B <= B, C <= C, D <= 20*K, E <= E, F <= F, G <= G] + Loop: [0.1.0 <= 19*K + D] f36 ~> f36 [A <= A, B <= B, C <= C, D <= 20*K, E <= E, F <= F, G <= G] + Loop: [0.2 <= 19*K + E] f52 ~> f55 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= 0*K, G <= G] f55 ~> f52 [A <= A, B <= B, C <= C, D <= D, E <= E + F, F <= F, G <= G] f59 ~> f55 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F + G, G <= G] f59 ~> f59 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= 20*K] f55 ~> f59 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= 0*K] + Loop: [0.2.0 <= 19*K + F] f55 ~> f59 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= 0*K] f59 ~> f55 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F + G, G <= G] f59 ~> f59 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= 20*K] + Loop: [0.2.0.0 <= 19*K + G] f59 ~> f59 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= 20*K] + Applied Processor: AbstractFlow + Details: () * Step 8: Lare WORST_CASE(?,O(1)) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,0.0,0.0.0,0.1,0.1.0,0.2,0.2.0,0.2.0.0] f16 ~> f19 [K ~=> B] f33 ~> f36 [K ~=> D] f52 ~> f55 [K ~=> F] f55 ~> f59 [K ~=> G] f59 ~> f59 [K ~=> G] f59 ~> f55 [F ~+> F,G ~+> F] f55 ~> f52 [E ~+> E,F ~+> E] f52 ~> f73 [] f36 ~> f36 [K ~=> D] f36 ~> f33 [C ~+> C,D ~+> C] f33 ~> f52 [K ~=> E] f19 ~> f19 [K ~=> B] f19 ~> f16 [A ~+> A,B ~+> A] f16 ~> f33 [K ~=> C] f0 ~> f16 [K ~=> A] f73 ~> exitus616 [] + Loop: [A ~+> 0.0,K ~*> 0.0] f16 ~> f19 [K ~=> B] f19 ~> f16 [A ~+> A,B ~+> A] f19 ~> f19 [K ~=> B] + Loop: [B ~+> 0.0.0,K ~*> 0.0.0] f19 ~> f19 [K ~=> B] + Loop: [C ~+> 0.1,K ~*> 0.1] f33 ~> f36 [K ~=> D] f36 ~> f33 [C ~+> C,D ~+> C] f36 ~> f36 [K ~=> D] + Loop: [D ~+> 0.1.0,K ~*> 0.1.0] f36 ~> f36 [K ~=> D] + Loop: [E ~+> 0.2,K ~*> 0.2] f52 ~> f55 [K ~=> F] f55 ~> f52 [E ~+> E,F ~+> E] f59 ~> f55 [F ~+> F,G ~+> F] f59 ~> f59 [K ~=> G] f55 ~> f59 [K ~=> G] + Loop: [F ~+> 0.2.0,K ~*> 0.2.0] f55 ~> f59 [K ~=> G] f59 ~> f55 [F ~+> F,G ~+> F] f59 ~> f59 [K ~=> G] + Loop: [G ~+> 0.2.0.0,K ~*> 0.2.0.0] f59 ~> f59 [K ~=> G] + Applied Processor: Lare + Details: f0 ~> exitus616 [K ~=> A ,K ~=> B ,K ~=> C ,K ~=> D ,K ~=> E ,K ~=> F ,K ~=> G ,tick ~+> tick ,K ~+> A ,K ~+> C ,K ~+> E ,K ~+> F ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.1 ,K ~+> 0.1.0 ,K ~+> 0.2 ,K ~+> 0.2.0 ,K ~+> 0.2.0.0 ,K ~+> tick ,K ~*> A ,K ~*> C ,K ~*> E ,K ~*> F ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> 0.1 ,K ~*> 0.1.0 ,K ~*> 0.2 ,K ~*> 0.2.0 ,K ~*> 0.2.0.0 ,K ~*> tick ,K ~^> E ,K ~^> F] + f16> [K ~=> B ,A ~+> A ,A ~+> 0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> tick ,K ~*> A ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] + f19> [K ~=> B,B ~+> 0.0.0,B ~+> tick,tick ~+> tick,K ~*> 0.0.0,K ~*> tick] + f33> [K ~=> D ,C ~+> C ,C ~+> 0.1 ,C ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> 0.1.0 ,K ~+> tick ,C ~*> C ,C ~*> tick ,K ~*> C ,K ~*> 0.1 ,K ~*> 0.1.0 ,K ~*> tick] + f36> [K ~=> D,D ~+> 0.1.0,D ~+> tick,tick ~+> tick,K ~*> 0.1.0,K ~*> tick] + f52> [K ~=> F ,K ~=> G ,E ~+> E ,E ~+> 0.2 ,E ~+> tick ,tick ~+> tick ,K ~+> E ,K ~+> F ,K ~+> 0.2.0 ,K ~+> 0.2.0.0 ,K ~+> tick ,E ~*> E ,E ~*> F ,E ~*> tick ,K ~*> E ,K ~*> F ,K ~*> 0.2 ,K ~*> 0.2.0 ,K ~*> 0.2.0.0 ,K ~*> tick ,E ~^> E ,E ~^> F ,K ~^> E ,K ~^> F] + f55> [K ~=> G ,F ~+> F ,F ~+> 0.2.0 ,F ~+> tick ,tick ~+> tick ,K ~+> F ,K ~+> 0.2.0.0 ,K ~+> tick ,F ~*> F ,F ~*> tick ,K ~*> F ,K ~*> 0.2.0 ,K ~*> 0.2.0.0 ,K ~*> tick] + f59> [K ~=> G,G ~+> 0.2.0.0,G ~+> tick,tick ~+> tick,K ~*> 0.2.0.0,K ~*> tick] YES(?,O(1))