YES(?,POLY) * Step 1: 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) 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 2: FromIts 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},7->{0,1,2}] + Applied Processor: FromIts + Details: () * Step 3: Unfold WORST_CASE(?,POLY) + Considered Problem: Rules: start(A,B,C,D,E,F) -> stop(A,B,C,F,E,F) [A + -1*F >= 0 && -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] start(A,B,C,D,E,F) -> lbl52(A,-1 + B,C,F,E,F) [A + -1*F >= 0 && -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] start(A,B,C,D,E,F) -> lbl72(A,F,C,-1 + F,E,F) [A + -1*F >= 0 && -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] lbl52(A,B,C,D,E,F) -> lbl52(A,-1 + B,C,D,E,F) [A + -1*F >= 0 && -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] lbl52(A,B,C,D,E,F) -> lbl72(A,F,C,-1 + D,E,F) [A + -1*F >= 0 && -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] lbl72(A,B,C,D,E,F) -> stop(A,B,C,D,E,F) [B + -1*F >= 0 && 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] lbl72(A,B,C,D,E,F) -> lbl52(A,-1 + B,C,D,E,F) [B + -1*F >= 0 && 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] start0(A,B,C,D,E,F) -> start(A,C,C,E,E,A) True Signature: {(lbl52,6);(lbl72,6);(start,6);(start0,6);(stop,6)} Rule Graph: [0->{},1->{3,4},2->{5,6},3->{3,4},4->{5,6},5->{},6->{3},7->{0,1,2}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: start.0(A,B,C,D,E,F) -> stop.8(A,B,C,F,E,F) [A + -1*F >= 0 && -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] start.1(A,B,C,D,E,F) -> lbl52.3(A,-1 + B,C,F,E,F) [A + -1*F >= 0 && -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] start.1(A,B,C,D,E,F) -> lbl52.4(A,-1 + B,C,F,E,F) [A + -1*F >= 0 && -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] start.2(A,B,C,D,E,F) -> lbl72.5(A,F,C,-1 + F,E,F) [A + -1*F >= 0 && -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] start.2(A,B,C,D,E,F) -> lbl72.6(A,F,C,-1 + F,E,F) [A + -1*F >= 0 && -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] lbl52.3(A,B,C,D,E,F) -> lbl52.3(A,-1 + B,C,D,E,F) [A + -1*F >= 0 && -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] lbl52.3(A,B,C,D,E,F) -> lbl52.4(A,-1 + B,C,D,E,F) [A + -1*F >= 0 && -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] lbl52.4(A,B,C,D,E,F) -> lbl72.5(A,F,C,-1 + D,E,F) [A + -1*F >= 0 && -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] lbl52.4(A,B,C,D,E,F) -> lbl72.6(A,F,C,-1 + D,E,F) [A + -1*F >= 0 && -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] lbl72.5(A,B,C,D,E,F) -> stop.8(A,B,C,D,E,F) [B + -1*F >= 0 && 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] lbl72.6(A,B,C,D,E,F) -> lbl52.3(A,-1 + B,C,D,E,F) [B + -1*F >= 0 && 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] start0.7(A,B,C,D,E,F) -> start.0(A,C,C,E,E,A) True start0.7(A,B,C,D,E,F) -> start.1(A,C,C,E,E,A) True start0.7(A,B,C,D,E,F) -> start.2(A,C,C,E,E,A) True Signature: {(lbl52.3,6) ;(lbl52.4,6) ;(lbl72.5,6) ;(lbl72.6,6) ;(start.0,6) ;(start.1,6) ;(start.2,6) ;(start0.7,6) ;(stop.8,6)} Rule Graph: [0->{},1->{5,6},2->{7,8},3->{9},4->{10},5->{5,6},6->{7,8},7->{9},8->{10},9->{},10->{5,6},11->{0},12->{1,2} ,13->{3,4}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose WORST_CASE(?,POLY) + Considered Problem: Rules: start.0(A,B,C,D,E,F) -> stop.8(A,B,C,F,E,F) [A + -1*F >= 0 && -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] start.1(A,B,C,D,E,F) -> lbl52.3(A,-1 + B,C,F,E,F) [A + -1*F >= 0 && -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] start.1(A,B,C,D,E,F) -> lbl52.4(A,-1 + B,C,F,E,F) [A + -1*F >= 0 && -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] start.2(A,B,C,D,E,F) -> lbl72.5(A,F,C,-1 + F,E,F) [A + -1*F >= 0 && -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] start.2(A,B,C,D,E,F) -> lbl72.6(A,F,C,-1 + F,E,F) [A + -1*F >= 0 && -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] lbl52.3(A,B,C,D,E,F) -> lbl52.3(A,-1 + B,C,D,E,F) [A + -1*F >= 0 && -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] lbl52.3(A,B,C,D,E,F) -> lbl52.4(A,-1 + B,C,D,E,F) [A + -1*F >= 0 && -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] lbl52.4(A,B,C,D,E,F) -> lbl72.5(A,F,C,-1 + D,E,F) [A + -1*F >= 0 && -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] lbl52.4(A,B,C,D,E,F) -> lbl72.6(A,F,C,-1 + D,E,F) [A + -1*F >= 0 && -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] lbl72.5(A,B,C,D,E,F) -> stop.8(A,B,C,D,E,F) [B + -1*F >= 0 && 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] lbl72.6(A,B,C,D,E,F) -> lbl52.3(A,-1 + B,C,D,E,F) [B + -1*F >= 0 && 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] start0.7(A,B,C,D,E,F) -> start.0(A,C,C,E,E,A) True start0.7(A,B,C,D,E,F) -> start.1(A,C,C,E,E,A) True start0.7(A,B,C,D,E,F) -> start.2(A,C,C,E,E,A) True stop.8(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.8(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.8(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.8(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.8(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True Signature: {(exitus616,6) ;(lbl52.3,6) ;(lbl52.4,6) ;(lbl72.5,6) ;(lbl72.6,6) ;(start.0,6) ;(start.1,6) ;(start.2,6) ;(start0.7,6) ;(stop.8,6)} Rule Graph: [0->{18},1->{5,6},2->{7,8},3->{9},4->{10},5->{5,6},6->{7,8},7->{9},8->{10},9->{14,15,16,17},10->{5,6} ,11->{0},12->{1,2},13->{3,4}] + 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,16,17,18] | `- p:[5,10,8,6] c: [6,8,10] | `- p:[5] c: [5] * Step 6: AbstractSize WORST_CASE(?,POLY) + Considered Problem: (Rules: start.0(A,B,C,D,E,F) -> stop.8(A,B,C,F,E,F) [A + -1*F >= 0 && -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] start.1(A,B,C,D,E,F) -> lbl52.3(A,-1 + B,C,F,E,F) [A + -1*F >= 0 && -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] start.1(A,B,C,D,E,F) -> lbl52.4(A,-1 + B,C,F,E,F) [A + -1*F >= 0 && -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] start.2(A,B,C,D,E,F) -> lbl72.5(A,F,C,-1 + F,E,F) [A + -1*F >= 0 && -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] start.2(A,B,C,D,E,F) -> lbl72.6(A,F,C,-1 + F,E,F) [A + -1*F >= 0 && -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] lbl52.3(A,B,C,D,E,F) -> lbl52.3(A,-1 + B,C,D,E,F) [A + -1*F >= 0 && -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] lbl52.3(A,B,C,D,E,F) -> lbl52.4(A,-1 + B,C,D,E,F) [A + -1*F >= 0 && -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] lbl52.4(A,B,C,D,E,F) -> lbl72.5(A,F,C,-1 + D,E,F) [A + -1*F >= 0 && -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] lbl52.4(A,B,C,D,E,F) -> lbl72.6(A,F,C,-1 + D,E,F) [A + -1*F >= 0 && -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] lbl72.5(A,B,C,D,E,F) -> stop.8(A,B,C,D,E,F) [B + -1*F >= 0 && 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] lbl72.6(A,B,C,D,E,F) -> lbl52.3(A,-1 + B,C,D,E,F) [B + -1*F >= 0 && 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] start0.7(A,B,C,D,E,F) -> start.0(A,C,C,E,E,A) True start0.7(A,B,C,D,E,F) -> start.1(A,C,C,E,E,A) True start0.7(A,B,C,D,E,F) -> start.2(A,C,C,E,E,A) True stop.8(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.8(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.8(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.8(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True stop.8(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True Signature: {(exitus616,6) ;(lbl52.3,6) ;(lbl52.4,6) ;(lbl72.5,6) ;(lbl72.6,6) ;(start.0,6) ;(start.1,6) ;(start.2,6) ;(start0.7,6) ;(stop.8,6)} Rule Graph: [0->{18},1->{5,6},2->{7,8},3->{9},4->{10},5->{5,6},6->{7,8},7->{9},8->{10},9->{14,15,16,17},10->{5,6} ,11->{0},12->{1,2},13->{3,4}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18] | `- p:[5,10,8,6] c: [6,8,10] | `- p:[5] c: [5]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,0.0,0.0.0] start.0 ~> stop.8 [A <= A, B <= B, C <= C, D <= F, E <= E, F <= F] start.1 ~> lbl52.3 [A <= A, B <= C, C <= C, D <= F, E <= E, F <= F] start.1 ~> lbl52.4 [A <= A, B <= C, C <= C, D <= F, E <= E, F <= F] start.2 ~> lbl72.5 [A <= A, B <= F, C <= C, D <= F, E <= E, F <= F] start.2 ~> lbl72.6 [A <= A, B <= F, C <= C, D <= F, E <= E, F <= F] lbl52.3 ~> lbl52.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl52.3 ~> lbl52.4 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl52.4 ~> lbl72.5 [A <= A, B <= F, C <= C, D <= F, E <= E, F <= F] lbl52.4 ~> lbl72.6 [A <= A, B <= F, C <= C, D <= F, E <= E, F <= F] lbl72.5 ~> stop.8 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl72.6 ~> lbl52.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] start0.7 ~> start.0 [A <= A, B <= C, C <= C, D <= E, E <= E, F <= A] start0.7 ~> start.1 [A <= A, B <= C, C <= C, D <= E, E <= E, F <= A] start0.7 ~> start.2 [A <= A, B <= C, C <= C, D <= E, E <= E, F <= A] stop.8 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop.8 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop.8 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop.8 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] stop.8 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] + Loop: [0.0 <= K + D] lbl52.3 ~> lbl52.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl72.6 ~> lbl52.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] lbl52.4 ~> lbl72.6 [A <= A, B <= F, C <= C, D <= F, E <= E, F <= F] lbl52.3 ~> lbl52.4 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] + Loop: [0.0.0 <= K + B + F] lbl52.3 ~> lbl52.3 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F] + Applied Processor: AbstractFlow + Details: () * Step 8: Lare WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,0.0,0.0.0] start.0 ~> stop.8 [F ~=> D] start.1 ~> lbl52.3 [C ~=> B,F ~=> D] start.1 ~> lbl52.4 [C ~=> B,F ~=> D] start.2 ~> lbl72.5 [F ~=> B,F ~=> D] start.2 ~> lbl72.6 [F ~=> B,F ~=> D] lbl52.3 ~> lbl52.3 [] lbl52.3 ~> lbl52.4 [] lbl52.4 ~> lbl72.5 [F ~=> B,F ~=> D] lbl52.4 ~> lbl72.6 [F ~=> B,F ~=> D] lbl72.5 ~> stop.8 [] lbl72.6 ~> lbl52.3 [] start0.7 ~> start.0 [A ~=> F,C ~=> B,E ~=> D] start0.7 ~> start.1 [A ~=> F,C ~=> B,E ~=> D] start0.7 ~> start.2 [A ~=> F,C ~=> B,E ~=> D] stop.8 ~> exitus616 [] stop.8 ~> exitus616 [] stop.8 ~> exitus616 [] stop.8 ~> exitus616 [] stop.8 ~> exitus616 [] + Loop: [D ~+> 0.0,K ~+> 0.0] lbl52.3 ~> lbl52.3 [] lbl72.6 ~> lbl52.3 [] lbl52.4 ~> lbl72.6 [F ~=> B,F ~=> D] lbl52.3 ~> lbl52.4 [] + Loop: [B ~+> 0.0.0,F ~+> 0.0.0,K ~+> 0.0.0] lbl52.3 ~> lbl52.3 [] + Applied Processor: Lare + Details: start0.7 ~> exitus616 [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 ~*> 0.0.0 ,A ~*> tick ,C ~*> tick ,K ~*> tick] + lbl52.4> [F ~=> B ,F ~=> D ,D ~+> 0.0 ,D ~+> tick ,F ~+> 0.0.0 ,F ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,D ~*> tick ,F ~*> 0.0.0 ,F ~*> tick ,K ~*> tick] lbl52.4> [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 ~*> 0.0.0 ,F ~*> tick ,K ~*> tick] lbl52.4> [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 ~*> 0.0.0 ,F ~*> tick ,K ~*> tick] + lbl52.3> [B ~+> 0.0.0 ,B ~+> tick ,F ~+> 0.0.0 ,F ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] YES(?,POLY)