YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f10(H,0,C,D,E,F,G) True (1,1) 1. f10(A,B,C,D,E,F,G) -> f10(A,1 + B,C,D,E,F,G) [B >= 0 && C >= 1 + B] (?,1) 2. f18(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,0,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && D >= 2 + E] 3. f21(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,1 + F,G) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && D >= 2 + E + F] 4. f21(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,1 + F,H) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && D >= 2 + E + F] 5. f32(A,B,C,D,E,F,G) -> f32(A,B,C,D,1 + E,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && D >= 2 + E] 6. f32(A,B,C,D,E,F,G) -> f41(A,B,C,D,E,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && 1 + E >= D] 7. f21(A,B,C,D,E,F,G) -> f18(A,B,C,D,1 + E,F,G) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && 1 + E + F >= D] 8. f18(A,B,C,D,E,F,G) -> f32(A,B,C,D,0,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && 1 + E >= D] 9. f10(A,B,C,D,E,F,G) -> f18(A,B,C,C,0,F,G) [B >= 0 && B >= C] (?,1) Signature: {(f0,7);(f10,7);(f18,7);(f21,7);(f32,7);(f41,7)} Flow Graph: [0->{1,9},1->{1,9},2->{3,4,7},3->{3,4,7},4->{3,4,7},5->{5,6},6->{},7->{2,8},8->{5,6},9->{2,8}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f10(H,0,C,D,E,F,G) True (1,1) 1. f10(A,B,C,D,E,F,G) -> f10(A,1 + B,C,D,E,F,G) [B >= 0 && C >= 1 + B] (?,1) 2. f18(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,0,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && D >= 2 + E] 3. f21(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,1 + F,G) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && D >= 2 + E + F] 4. f21(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,1 + F,H) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && D >= 2 + E + F] 5. f32(A,B,C,D,E,F,G) -> f32(A,B,C,D,1 + E,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && D >= 2 + E] 6. f32(A,B,C,D,E,F,G) -> f41(A,B,C,D,E,F,G) [B + -1*E >= 0 (1,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && 1 + E >= D] 7. f21(A,B,C,D,E,F,G) -> f18(A,B,C,D,1 + E,F,G) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && 1 + E + F >= D] 8. f18(A,B,C,D,E,F,G) -> f32(A,B,C,D,0,F,G) [B + -1*E >= 0 (1,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && 1 + E >= D] 9. f10(A,B,C,D,E,F,G) -> f18(A,B,C,C,0,F,G) [B >= 0 && B >= C] (1,1) Signature: {(f0,7);(f10,7);(f18,7);(f21,7);(f32,7);(f41,7)} Flow Graph: [0->{1,9},1->{1,9},2->{3,4,7},3->{3,4,7},4->{3,4,7},5->{5,6},6->{},7->{2,8},8->{5,6},9->{2,8}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,7)] * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f10(H,0,C,D,E,F,G) True (1,1) 1. f10(A,B,C,D,E,F,G) -> f10(A,1 + B,C,D,E,F,G) [B >= 0 && C >= 1 + B] (?,1) 2. f18(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,0,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && D >= 2 + E] 3. f21(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,1 + F,G) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && D >= 2 + E + F] 4. f21(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,1 + F,H) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && D >= 2 + E + F] 5. f32(A,B,C,D,E,F,G) -> f32(A,B,C,D,1 + E,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && D >= 2 + E] 6. f32(A,B,C,D,E,F,G) -> f41(A,B,C,D,E,F,G) [B + -1*E >= 0 (1,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && 1 + E >= D] 7. f21(A,B,C,D,E,F,G) -> f18(A,B,C,D,1 + E,F,G) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && 1 + E + F >= D] 8. f18(A,B,C,D,E,F,G) -> f32(A,B,C,D,0,F,G) [B + -1*E >= 0 (1,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && 1 + E >= D] 9. f10(A,B,C,D,E,F,G) -> f18(A,B,C,C,0,F,G) [B >= 0 && B >= C] (1,1) Signature: {(f0,7);(f10,7);(f18,7);(f21,7);(f32,7);(f41,7)} Flow Graph: [0->{1,9},1->{1,9},2->{3,4},3->{3,4,7},4->{3,4,7},5->{5,6},6->{},7->{2,8},8->{5,6},9->{2,8}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f10(H,0,C,D,E,F,G) True (1,1) 1. f10(A,B,C,D,E,F,G) -> f10(A,1 + B,C,D,E,F,G) [B >= 0 && C >= 1 + B] (?,1) 2. f18(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,0,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && D >= 2 + E] 3. f21(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,1 + F,G) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && D >= 2 + E + F] 4. f21(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,1 + F,H) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && D >= 2 + E + F] 5. f32(A,B,C,D,E,F,G) -> f32(A,B,C,D,1 + E,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && D >= 2 + E] 6. f32(A,B,C,D,E,F,G) -> f41(A,B,C,D,E,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && 1 + E >= D] 7. f21(A,B,C,D,E,F,G) -> f18(A,B,C,D,1 + E,F,G) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && 1 + E + F >= D] 8. f18(A,B,C,D,E,F,G) -> f32(A,B,C,D,0,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && 1 + E >= D] 9. f10(A,B,C,D,E,F,G) -> f18(A,B,C,C,0,F,G) [B >= 0 && B >= C] (?,1) 10. f32(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True (?,1) Signature: {(exitus616,7);(f0,7);(f10,7);(f18,7);(f21,7);(f32,7);(f41,7)} Flow Graph: [0->{1,9},1->{1,9},2->{3,4,7},3->{3,4,7},4->{3,4,7},5->{5,6,10},6->{},7->{2,8},8->{5,6,10},9->{2,8} ,10->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,7)] * Step 5: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f10(H,0,C,D,E,F,G) True (1,1) 1. f10(A,B,C,D,E,F,G) -> f10(A,1 + B,C,D,E,F,G) [B >= 0 && C >= 1 + B] (?,1) 2. f18(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,0,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && D >= 2 + E] 3. f21(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,1 + F,G) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && D >= 2 + E + F] 4. f21(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,1 + F,H) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && D >= 2 + E + F] 5. f32(A,B,C,D,E,F,G) -> f32(A,B,C,D,1 + E,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && D >= 2 + E] 6. f32(A,B,C,D,E,F,G) -> f41(A,B,C,D,E,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && 1 + E >= D] 7. f21(A,B,C,D,E,F,G) -> f18(A,B,C,D,1 + E,F,G) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && 1 + E + F >= D] 8. f18(A,B,C,D,E,F,G) -> f32(A,B,C,D,0,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && 1 + E >= D] 9. f10(A,B,C,D,E,F,G) -> f18(A,B,C,C,0,F,G) [B >= 0 && B >= C] (?,1) 10. f32(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True (?,1) Signature: {(exitus616,7);(f0,7);(f10,7);(f18,7);(f21,7);(f32,7);(f41,7)} Flow Graph: [0->{1,9},1->{1,9},2->{3,4},3->{3,4,7},4->{3,4,7},5->{5,6,10},6->{},7->{2,8},8->{5,6,10},9->{2,8},10->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | +- p:[1] c: [1] | +- p:[2,7,3,4] c: [7] | | | `- p:[3,4] c: [4] | | | `- p:[3] c: [3] | `- p:[5] c: [5] * Step 6: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. f0(A,B,C,D,E,F,G) -> f10(H,0,C,D,E,F,G) True (1,1) 1. f10(A,B,C,D,E,F,G) -> f10(A,1 + B,C,D,E,F,G) [B >= 0 && C >= 1 + B] (?,1) 2. f18(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,0,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && D >= 2 + E] 3. f21(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,1 + F,G) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && D >= 2 + E + F] 4. f21(A,B,C,D,E,F,G) -> f21(A,B,C,D,E,1 + F,H) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && D >= 2 + E + F] 5. f32(A,B,C,D,E,F,G) -> f32(A,B,C,D,1 + E,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && D >= 2 + E] 6. f32(A,B,C,D,E,F,G) -> f41(A,B,C,D,E,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && 1 + E >= D] 7. f21(A,B,C,D,E,F,G) -> f18(A,B,C,D,1 + E,F,G) [F >= 0 (?,1) && E + F >= 0 && -2 + D + F >= 0 && -2 + C + F >= 0 && -2 + B + F >= 0 && -2 + D + -1*E >= 0 && -2 + C + -1*E >= 0 && -2 + B + -1*E >= 0 && E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -2 + D >= 0 && -4 + C + D >= 0 && -1*C + D >= 0 && -4 + B + D >= 0 && B + -1*C >= 0 && -2 + C >= 0 && -4 + B + C >= 0 && -2 + B >= 0 && 1 + E + F >= D] 8. f18(A,B,C,D,E,F,G) -> f32(A,B,C,D,0,F,G) [B + -1*E >= 0 (?,1) && E >= 0 && B + E >= 0 && C + -1*D >= 0 && B + -1*D >= 0 && -1*C + D >= 0 && B + -1*C >= 0 && B >= 0 && 1 + E >= D] 9. f10(A,B,C,D,E,F,G) -> f18(A,B,C,C,0,F,G) [B >= 0 && B >= C] (?,1) 10. f32(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True (?,1) Signature: {(exitus616,7);(f0,7);(f10,7);(f18,7);(f21,7);(f32,7);(f41,7)} Flow Graph: [0->{1,9},1->{1,9},2->{3,4},3->{3,4,7},4->{3,4,7},5->{5,6,10},6->{},7->{2,8},8->{5,6,10},9->{2,8},10->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | +- p:[1] c: [1] | +- p:[2,7,3,4] c: [7] | | | `- p:[3,4] c: [4] | | | `- p:[3] c: [3] | `- p:[5] c: [5]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,0.0,0.1,0.1.0,0.1.0.0,0.2] f0 ~> f10 [A <= unknown, B <= 0*K, C <= C, D <= D, E <= E, F <= F, G <= G] f10 ~> f10 [A <= A, B <= C, C <= C, D <= D, E <= E, F <= F, G <= G] f18 ~> f21 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= 0*K, G <= G] f21 ~> f21 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= B, G <= G] f21 ~> f21 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= B, G <= unknown] f32 ~> f32 [A <= A, B <= B, C <= C, D <= D, E <= C, F <= F, G <= G] f32 ~> f41 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] f21 ~> f18 [A <= A, B <= B, C <= C, D <= D, E <= C, F <= F, G <= G] f18 ~> f32 [A <= A, B <= B, C <= C, D <= D, E <= 0*K, F <= F, G <= G] f10 ~> f18 [A <= A, B <= B, C <= C, D <= C, E <= 0*K, F <= F, G <= G] f32 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G] + Loop: [0.0 <= B + C] f10 ~> f10 [A <= A, B <= C, C <= C, D <= D, E <= E, F <= F, G <= G] + Loop: [0.1 <= B + E] f18 ~> f21 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= 0*K, G <= G] f21 ~> f18 [A <= A, B <= B, C <= C, D <= D, E <= C, F <= F, G <= G] f21 ~> f21 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= B, G <= G] f21 ~> f21 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= B, G <= unknown] + Loop: [0.1.0 <= D + F] f21 ~> f21 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= B, G <= G] f21 ~> f21 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= B, G <= unknown] + Loop: [0.1.0.0 <= D + F] f21 ~> f21 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= B, G <= G] + Loop: [0.2 <= K + D + E] f32 ~> f32 [A <= A, B <= B, C <= C, D <= D, E <= C, F <= F, G <= G] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,0.0,0.1,0.1.0,0.1.0.0,0.2] f0 ~> f10 [K ~=> B,huge ~=> A] f10 ~> f10 [C ~=> B] f18 ~> f21 [K ~=> F] f21 ~> f21 [B ~=> F] f21 ~> f21 [B ~=> F,huge ~=> G] f32 ~> f32 [C ~=> E] f32 ~> f41 [] f21 ~> f18 [C ~=> E] f18 ~> f32 [K ~=> E] f10 ~> f18 [C ~=> D,K ~=> E] f32 ~> exitus616 [] + Loop: [B ~+> 0.0,C ~+> 0.0] f10 ~> f10 [C ~=> B] + Loop: [B ~+> 0.1,E ~+> 0.1] f18 ~> f21 [K ~=> F] f21 ~> f18 [C ~=> E] f21 ~> f21 [B ~=> F] f21 ~> f21 [B ~=> F,huge ~=> G] + Loop: [D ~+> 0.1.0,F ~+> 0.1.0] f21 ~> f21 [B ~=> F] f21 ~> f21 [B ~=> F,huge ~=> G] + Loop: [D ~+> 0.1.0.0,F ~+> 0.1.0.0] f21 ~> f21 [B ~=> F] + Loop: [D ~+> 0.2,E ~+> 0.2,K ~+> 0.2] f32 ~> f32 [C ~=> E] + Applied Processor: LareProcessor + Details: f0 ~> exitus616 [C ~=> B ,C ~=> D ,C ~=> E ,C ~=> F ,K ~=> B ,K ~=> E ,K ~=> F ,huge ~=> A ,huge ~=> G ,C ~+> 0.0 ,C ~+> 0.1 ,C ~+> 0.1.0 ,C ~+> 0.1.0.0 ,C ~+> 0.2 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> 0.1.0 ,K ~+> 0.1.0.0 ,K ~+> 0.2 ,K ~+> tick ,C ~*> 0.1.0 ,C ~*> 0.1.0.0 ,C ~*> tick ,K ~*> 0.1 ,K ~*> 0.2 ,K ~*> tick] f0 ~> f41 [C ~=> B ,C ~=> D ,C ~=> E ,C ~=> F ,K ~=> B ,K ~=> E ,K ~=> F ,huge ~=> A ,huge ~=> G ,C ~+> 0.0 ,C ~+> 0.1 ,C ~+> 0.1.0 ,C ~+> 0.1.0.0 ,C ~+> 0.2 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.1 ,K ~+> 0.1.0 ,K ~+> 0.1.0.0 ,K ~+> 0.2 ,K ~+> tick ,C ~*> 0.1.0 ,C ~*> 0.1.0.0 ,C ~*> tick ,K ~*> 0.1 ,K ~*> 0.2 ,K ~*> tick] + f10> [C ~=> B,B ~+> 0.0,B ~+> tick,C ~+> 0.0,C ~+> tick,tick ~+> tick] + f18> [B ~=> F ,C ~=> E ,K ~=> F ,huge ~=> G ,B ~+> 0.1 ,B ~+> 0.1.0 ,B ~+> 0.1.0.0 ,B ~+> tick ,D ~+> 0.1.0 ,D ~+> 0.1.0.0 ,D ~+> tick ,E ~+> 0.1 ,E ~+> tick ,tick ~+> tick ,K ~+> 0.1.0 ,K ~+> 0.1.0.0 ,K ~+> tick ,B ~*> tick ,D ~*> tick ,E ~*> tick ,K ~*> tick] + f21> [B ~=> F ,huge ~=> G ,B ~+> 0.1.0.0 ,B ~+> tick ,D ~+> 0.1.0 ,D ~+> 0.1.0.0 ,D ~+> tick ,F ~+> 0.1.0 ,F ~+> 0.1.0.0 ,F ~+> tick ,tick ~+> tick ,D ~*> tick ,F ~*> tick] + f21> [B ~=> F,D ~+> 0.1.0.0,D ~+> tick,F ~+> 0.1.0.0,F ~+> tick,tick ~+> tick] + f32> [C ~=> E,D ~+> 0.2,D ~+> tick,E ~+> 0.2,E ~+> tick,tick ~+> tick,K ~+> 0.2,K ~+> tick] YES(?,POLY)