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