YES(?,POLY) * Step 1: FromIts WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,E,F,G,H,1,J) [-1*I + J >= 0 (?,1) && I + -1*J >= 0 && G + -1*H >= 0 && -1*G + H >= 0 && A + -1*F >= 0 && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && 1 >= A && B = C && D = E && F = A && G = H && I = J] 1. start(A,B,C,D,E,F,G,H,I,J) -> lbl31(A,K,C,D,E,F,G,H,1,J) [-1*I + J >= 0 (?,1) && I + -1*J >= 0 && G + -1*H >= 0 && -1*G + H >= 0 && 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 >= 2 && B = C && D = E && F = A && G = H && I = J] 2. lbl43(A,B,C,D,E,F,G,H,I,J) -> lbl43(A,B,C,D,E,F,-1 + G,H,I,J) [-1 + F + -1*I >= 0 (?,1) && -1 + A + -1*I >= 0 && -1 + I >= 0 && G + I >= 0 && -2 + -1*G + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && -3 + F + -1*G >= 0 && -3 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && G >= 0 && I >= 2 + G && A >= 1 + I && F = A] 3. lbl43(A,B,C,D,E,F,G,H,I,J) -> lbl13(A,B,C,I,E,F,G,H,1 + I,J) [-1 + F + -1*I >= 0 (?,1) && -1 + A + -1*I >= 0 && -1 + I >= 0 && G + I >= 0 && -2 + -1*G + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && -3 + F + -1*G >= 0 && -3 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && I >= 2 + G && A >= 1 + I && F = A] 4. lbl31(A,B,C,D,E,F,G,H,I,J) -> lbl43(A,B,C,D,E,F,-2 + I,H,I,J) [-1 + F + -1*I >= 0 (?,1) && -1 + A + -1*I >= 0 && -1 + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && I >= 1 && A >= 1 + I && F = A] 5. lbl31(A,B,C,D,E,F,G,H,I,J) -> lbl13(A,B,C,I,E,F,-1 + I,H,1 + I,J) [-1 + F + -1*I >= 0 (?,1) && -1 + A + -1*I >= 0 && -1 + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && I >= 1 && A >= 1 + I && F = A] 6. lbl13(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,E,F,G,H,I,J) [F + -1*I >= 0 (?,1) && 1 + D + -1*I >= 0 && A + -1*I >= 0 && -2 + I >= 0 && -1 + G + I >= 0 && -2 + -1*G + I >= 0 && -4 + F + I >= 0 && -3 + D + I >= 0 && -1 + -1*D + I >= 0 && -4 + A + I >= 0 && -2 + F + -1*G >= 0 && -1 + D + -1*G >= 0 && -2 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && D + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -3 + D + F >= 0 && -1 + -1*D + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -1 + A + -1*D >= 0 && -1 + D >= 0 && -3 + A + D >= 0 && -2 + A >= 0 && A + G >= 2 && A >= 2 + G && F = A && I = A && 1 + D = A] 7. lbl13(A,B,C,D,E,F,G,H,I,J) -> lbl31(A,K,C,D,E,F,G,H,I,J) [F + -1*I >= 0 (?,1) && 1 + D + -1*I >= 0 && A + -1*I >= 0 && -2 + I >= 0 && -1 + G + I >= 0 && -2 + -1*G + I >= 0 && -4 + F + I >= 0 && -3 + D + I >= 0 && -1 + -1*D + I >= 0 && -4 + A + I >= 0 && -2 + F + -1*G >= 0 && -1 + D + -1*G >= 0 && -2 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && D + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -3 + D + F >= 0 && -1 + -1*D + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -1 + A + -1*D >= 0 && -1 + D >= 0 && -3 + A + D >= 0 && -2 + A >= 0 && A >= 2 + D && D + G >= 1 && A >= 1 + D && D >= 1 + G && F = A && I = 1 + D] 8. start0(A,B,C,D,E,F,G,H,I,J) -> start(A,C,C,E,E,A,H,H,J,J) True (1,1) Signature: {(lbl13,10);(lbl31,10);(lbl43,10);(start,10);(start0,10);(stop,10)} Flow Graph: [0->{},1->{4,5},2->{2,3},3->{6,7},4->{2,3},5->{6,7},6->{},7->{4,5},8->{0,1}] + Applied Processor: FromIts + Details: () * Step 2: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: start(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,E,F,G,H,1,J) [-1*I + J >= 0 && I + -1*J >= 0 && G + -1*H >= 0 && -1*G + H >= 0 && A + -1*F >= 0 && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && 1 >= A && B = C && D = E && F = A && G = H && I = J] start(A,B,C,D,E,F,G,H,I,J) -> lbl31(A,K,C,D,E,F,G,H,1,J) [-1*I + J >= 0 && I + -1*J >= 0 && G + -1*H >= 0 && -1*G + H >= 0 && 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 >= 2 && B = C && D = E && F = A && G = H && I = J] lbl43(A,B,C,D,E,F,G,H,I,J) -> lbl43(A,B,C,D,E,F,-1 + G,H,I,J) [-1 + F + -1*I >= 0 && -1 + A + -1*I >= 0 && -1 + I >= 0 && G + I >= 0 && -2 + -1*G + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && -3 + F + -1*G >= 0 && -3 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && G >= 0 && I >= 2 + G && A >= 1 + I && F = A] lbl43(A,B,C,D,E,F,G,H,I,J) -> lbl13(A,B,C,I,E,F,G,H,1 + I,J) [-1 + F + -1*I >= 0 && -1 + A + -1*I >= 0 && -1 + I >= 0 && G + I >= 0 && -2 + -1*G + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && -3 + F + -1*G >= 0 && -3 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && I >= 2 + G && A >= 1 + I && F = A] lbl31(A,B,C,D,E,F,G,H,I,J) -> lbl43(A,B,C,D,E,F,-2 + I,H,I,J) [-1 + F + -1*I >= 0 && -1 + A + -1*I >= 0 && -1 + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && I >= 1 && A >= 1 + I && F = A] lbl31(A,B,C,D,E,F,G,H,I,J) -> lbl13(A,B,C,I,E,F,-1 + I,H,1 + I,J) [-1 + F + -1*I >= 0 && -1 + A + -1*I >= 0 && -1 + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && I >= 1 && A >= 1 + I && F = A] lbl13(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,E,F,G,H,I,J) [F + -1*I >= 0 && 1 + D + -1*I >= 0 && A + -1*I >= 0 && -2 + I >= 0 && -1 + G + I >= 0 && -2 + -1*G + I >= 0 && -4 + F + I >= 0 && -3 + D + I >= 0 && -1 + -1*D + I >= 0 && -4 + A + I >= 0 && -2 + F + -1*G >= 0 && -1 + D + -1*G >= 0 && -2 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && D + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -3 + D + F >= 0 && -1 + -1*D + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -1 + A + -1*D >= 0 && -1 + D >= 0 && -3 + A + D >= 0 && -2 + A >= 0 && A + G >= 2 && A >= 2 + G && F = A && I = A && 1 + D = A] lbl13(A,B,C,D,E,F,G,H,I,J) -> lbl31(A,K,C,D,E,F,G,H,I,J) [F + -1*I >= 0 && 1 + D + -1*I >= 0 && A + -1*I >= 0 && -2 + I >= 0 && -1 + G + I >= 0 && -2 + -1*G + I >= 0 && -4 + F + I >= 0 && -3 + D + I >= 0 && -1 + -1*D + I >= 0 && -4 + A + I >= 0 && -2 + F + -1*G >= 0 && -1 + D + -1*G >= 0 && -2 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && D + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -3 + D + F >= 0 && -1 + -1*D + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -1 + A + -1*D >= 0 && -1 + D >= 0 && -3 + A + D >= 0 && -2 + A >= 0 && A >= 2 + D && D + G >= 1 && A >= 1 + D && D >= 1 + G && F = A && I = 1 + D] start0(A,B,C,D,E,F,G,H,I,J) -> start(A,C,C,E,E,A,H,H,J,J) True Signature: {(lbl13,10);(lbl31,10);(lbl43,10);(start,10);(start0,10);(stop,10)} Rule Graph: [0->{},1->{4,5},2->{2,3},3->{6,7},4->{2,3},5->{6,7},6->{},7->{4,5},8->{0,1}] + Applied Processor: AddSinks + Details: () * Step 3: Decompose WORST_CASE(?,POLY) + Considered Problem: Rules: start(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,E,F,G,H,1,J) [-1*I + J >= 0 && I + -1*J >= 0 && G + -1*H >= 0 && -1*G + H >= 0 && A + -1*F >= 0 && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && 1 >= A && B = C && D = E && F = A && G = H && I = J] start(A,B,C,D,E,F,G,H,I,J) -> lbl31(A,K,C,D,E,F,G,H,1,J) [-1*I + J >= 0 && I + -1*J >= 0 && G + -1*H >= 0 && -1*G + H >= 0 && 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 >= 2 && B = C && D = E && F = A && G = H && I = J] lbl43(A,B,C,D,E,F,G,H,I,J) -> lbl43(A,B,C,D,E,F,-1 + G,H,I,J) [-1 + F + -1*I >= 0 && -1 + A + -1*I >= 0 && -1 + I >= 0 && G + I >= 0 && -2 + -1*G + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && -3 + F + -1*G >= 0 && -3 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && G >= 0 && I >= 2 + G && A >= 1 + I && F = A] lbl43(A,B,C,D,E,F,G,H,I,J) -> lbl13(A,B,C,I,E,F,G,H,1 + I,J) [-1 + F + -1*I >= 0 && -1 + A + -1*I >= 0 && -1 + I >= 0 && G + I >= 0 && -2 + -1*G + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && -3 + F + -1*G >= 0 && -3 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && I >= 2 + G && A >= 1 + I && F = A] lbl31(A,B,C,D,E,F,G,H,I,J) -> lbl43(A,B,C,D,E,F,-2 + I,H,I,J) [-1 + F + -1*I >= 0 && -1 + A + -1*I >= 0 && -1 + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && I >= 1 && A >= 1 + I && F = A] lbl31(A,B,C,D,E,F,G,H,I,J) -> lbl13(A,B,C,I,E,F,-1 + I,H,1 + I,J) [-1 + F + -1*I >= 0 && -1 + A + -1*I >= 0 && -1 + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && I >= 1 && A >= 1 + I && F = A] lbl13(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,E,F,G,H,I,J) [F + -1*I >= 0 && 1 + D + -1*I >= 0 && A + -1*I >= 0 && -2 + I >= 0 && -1 + G + I >= 0 && -2 + -1*G + I >= 0 && -4 + F + I >= 0 && -3 + D + I >= 0 && -1 + -1*D + I >= 0 && -4 + A + I >= 0 && -2 + F + -1*G >= 0 && -1 + D + -1*G >= 0 && -2 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && D + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -3 + D + F >= 0 && -1 + -1*D + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -1 + A + -1*D >= 0 && -1 + D >= 0 && -3 + A + D >= 0 && -2 + A >= 0 && A + G >= 2 && A >= 2 + G && F = A && I = A && 1 + D = A] lbl13(A,B,C,D,E,F,G,H,I,J) -> lbl31(A,K,C,D,E,F,G,H,I,J) [F + -1*I >= 0 && 1 + D + -1*I >= 0 && A + -1*I >= 0 && -2 + I >= 0 && -1 + G + I >= 0 && -2 + -1*G + I >= 0 && -4 + F + I >= 0 && -3 + D + I >= 0 && -1 + -1*D + I >= 0 && -4 + A + I >= 0 && -2 + F + -1*G >= 0 && -1 + D + -1*G >= 0 && -2 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && D + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -3 + D + F >= 0 && -1 + -1*D + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -1 + A + -1*D >= 0 && -1 + D >= 0 && -3 + A + D >= 0 && -2 + A >= 0 && A >= 2 + D && D + G >= 1 && A >= 1 + D && D >= 1 + G && F = A && I = 1 + D] start0(A,B,C,D,E,F,G,H,I,J) -> start(A,C,C,E,E,A,H,H,J,J) True stop(A,B,C,D,E,F,G,H,I,J) -> exitus616(A,B,C,D,E,F,G,H,I,J) True stop(A,B,C,D,E,F,G,H,I,J) -> exitus616(A,B,C,D,E,F,G,H,I,J) True Signature: {(exitus616,10);(lbl13,10);(lbl31,10);(lbl43,10);(start,10);(start0,10);(stop,10)} Rule Graph: [0->{10},1->{4,5},2->{2,3},3->{6,7},4->{2,3},5->{6,7},6->{9},7->{4,5},8->{0,1}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | `- p:[4,7,3,2,5] c: [3,4,5,7] | `- p:[2] c: [2] * Step 4: AbstractSize WORST_CASE(?,POLY) + Considered Problem: (Rules: start(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,E,F,G,H,1,J) [-1*I + J >= 0 && I + -1*J >= 0 && G + -1*H >= 0 && -1*G + H >= 0 && A + -1*F >= 0 && -1*A + F >= 0 && D + -1*E >= 0 && -1*D + E >= 0 && B + -1*C >= 0 && -1*B + C >= 0 && 1 >= A && B = C && D = E && F = A && G = H && I = J] start(A,B,C,D,E,F,G,H,I,J) -> lbl31(A,K,C,D,E,F,G,H,1,J) [-1*I + J >= 0 && I + -1*J >= 0 && G + -1*H >= 0 && -1*G + H >= 0 && 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 >= 2 && B = C && D = E && F = A && G = H && I = J] lbl43(A,B,C,D,E,F,G,H,I,J) -> lbl43(A,B,C,D,E,F,-1 + G,H,I,J) [-1 + F + -1*I >= 0 && -1 + A + -1*I >= 0 && -1 + I >= 0 && G + I >= 0 && -2 + -1*G + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && -3 + F + -1*G >= 0 && -3 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && G >= 0 && I >= 2 + G && A >= 1 + I && F = A] lbl43(A,B,C,D,E,F,G,H,I,J) -> lbl13(A,B,C,I,E,F,G,H,1 + I,J) [-1 + F + -1*I >= 0 && -1 + A + -1*I >= 0 && -1 + I >= 0 && G + I >= 0 && -2 + -1*G + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && -3 + F + -1*G >= 0 && -3 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && I >= 2 + G && A >= 1 + I && F = A] lbl31(A,B,C,D,E,F,G,H,I,J) -> lbl43(A,B,C,D,E,F,-2 + I,H,I,J) [-1 + F + -1*I >= 0 && -1 + A + -1*I >= 0 && -1 + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && I >= 1 && A >= 1 + I && F = A] lbl31(A,B,C,D,E,F,G,H,I,J) -> lbl13(A,B,C,I,E,F,-1 + I,H,1 + I,J) [-1 + F + -1*I >= 0 && -1 + A + -1*I >= 0 && -1 + I >= 0 && -3 + F + I >= 0 && -3 + A + I >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -2 + A >= 0 && I >= 1 && A >= 1 + I && F = A] lbl13(A,B,C,D,E,F,G,H,I,J) -> stop(A,B,C,D,E,F,G,H,I,J) [F + -1*I >= 0 && 1 + D + -1*I >= 0 && A + -1*I >= 0 && -2 + I >= 0 && -1 + G + I >= 0 && -2 + -1*G + I >= 0 && -4 + F + I >= 0 && -3 + D + I >= 0 && -1 + -1*D + I >= 0 && -4 + A + I >= 0 && -2 + F + -1*G >= 0 && -1 + D + -1*G >= 0 && -2 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && D + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -3 + D + F >= 0 && -1 + -1*D + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -1 + A + -1*D >= 0 && -1 + D >= 0 && -3 + A + D >= 0 && -2 + A >= 0 && A + G >= 2 && A >= 2 + G && F = A && I = A && 1 + D = A] lbl13(A,B,C,D,E,F,G,H,I,J) -> lbl31(A,K,C,D,E,F,G,H,I,J) [F + -1*I >= 0 && 1 + D + -1*I >= 0 && A + -1*I >= 0 && -2 + I >= 0 && -1 + G + I >= 0 && -2 + -1*G + I >= 0 && -4 + F + I >= 0 && -3 + D + I >= 0 && -1 + -1*D + I >= 0 && -4 + A + I >= 0 && -2 + F + -1*G >= 0 && -1 + D + -1*G >= 0 && -2 + A + -1*G >= 0 && 1 + G >= 0 && -1 + F + G >= 0 && D + G >= 0 && -1 + A + G >= 0 && A + -1*F >= 0 && -2 + F >= 0 && -3 + D + F >= 0 && -1 + -1*D + F >= 0 && -4 + A + F >= 0 && -1*A + F >= 0 && -1 + A + -1*D >= 0 && -1 + D >= 0 && -3 + A + D >= 0 && -2 + A >= 0 && A >= 2 + D && D + G >= 1 && A >= 1 + D && D >= 1 + G && F = A && I = 1 + D] start0(A,B,C,D,E,F,G,H,I,J) -> start(A,C,C,E,E,A,H,H,J,J) True stop(A,B,C,D,E,F,G,H,I,J) -> exitus616(A,B,C,D,E,F,G,H,I,J) True stop(A,B,C,D,E,F,G,H,I,J) -> exitus616(A,B,C,D,E,F,G,H,I,J) True Signature: {(exitus616,10);(lbl13,10);(lbl31,10);(lbl43,10);(start,10);(start0,10);(stop,10)} Rule Graph: [0->{10},1->{4,5},2->{2,3},3->{6,7},4->{2,3},5->{6,7},6->{9},7->{4,5},8->{0,1}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | `- p:[4,7,3,2,5] c: [3,4,5,7] | `- p:[2] c: [2]) + Applied Processor: AbstractSize Minimize + Details: () * Step 5: AbstractFlow WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,I,J,0.0,0.0.0] start ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= K, J <= J] start ~> lbl31 [A <= A, B <= unknown, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= K, J <= J] lbl43 ~> lbl43 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= F, H <= H, I <= I, J <= J] lbl43 ~> lbl13 [A <= A, B <= B, C <= C, D <= I, E <= E, F <= F, G <= G, H <= H, I <= F, J <= J] lbl31 ~> lbl43 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= I, H <= H, I <= I, J <= J] lbl31 ~> lbl13 [A <= A, B <= B, C <= C, D <= I, E <= E, F <= F, G <= F, H <= H, I <= F, J <= J] lbl13 ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J] lbl13 ~> lbl31 [A <= A, B <= unknown, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J] start0 ~> start [A <= A, B <= C, C <= C, D <= E, E <= E, F <= A, G <= H, H <= H, I <= J, J <= J] stop ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J] stop ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J] + Loop: [0.0 <= K + A + I] lbl31 ~> lbl43 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= I, H <= H, I <= I, J <= J] lbl13 ~> lbl31 [A <= A, B <= unknown, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J] lbl43 ~> lbl13 [A <= A, B <= B, C <= C, D <= I, E <= E, F <= F, G <= G, H <= H, I <= F, J <= J] lbl43 ~> lbl43 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= F, H <= H, I <= I, J <= J] lbl31 ~> lbl13 [A <= A, B <= B, C <= C, D <= I, E <= E, F <= F, G <= F, H <= H, I <= F, J <= J] + Loop: [0.0.0 <= K + A + G] lbl43 ~> lbl43 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= F, H <= H, I <= I, J <= J] + Applied Processor: AbstractFlow + Details: () * Step 6: Lare WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,I,J,0.0,0.0.0] start ~> stop [K ~=> I] start ~> lbl31 [K ~=> I,huge ~=> B] lbl43 ~> lbl43 [F ~=> G] lbl43 ~> lbl13 [F ~=> I,I ~=> D] lbl31 ~> lbl43 [I ~=> G] lbl31 ~> lbl13 [F ~=> G,F ~=> I,I ~=> D] lbl13 ~> stop [] lbl13 ~> lbl31 [huge ~=> B] start0 ~> start [A ~=> F,C ~=> B,E ~=> D,H ~=> G,J ~=> I] stop ~> exitus616 [] stop ~> exitus616 [] + Loop: [A ~+> 0.0,I ~+> 0.0,K ~+> 0.0] lbl31 ~> lbl43 [I ~=> G] lbl13 ~> lbl31 [huge ~=> B] lbl43 ~> lbl13 [F ~=> I,I ~=> D] lbl43 ~> lbl43 [F ~=> G] lbl31 ~> lbl13 [F ~=> G,F ~=> I,I ~=> D] + Loop: [A ~+> 0.0.0,G ~+> 0.0.0,K ~+> 0.0.0] lbl43 ~> lbl43 [F ~=> G] + Applied Processor: Lare + Details: start0 ~> exitus616 [A ~=> D ,A ~=> F ,A ~=> G ,A ~=> I ,C ~=> B ,E ~=> D ,H ~=> G ,K ~=> D ,K ~=> G ,K ~=> I ,huge ~=> B ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> 0.0.0 ,A ~*> tick ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] + lbl13> [F ~=> D ,F ~=> G ,F ~=> I ,I ~=> D ,I ~=> G ,huge ~=> B ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> tick ,F ~+> 0.0.0 ,F ~+> tick ,I ~+> 0.0 ,I ~+> 0.0.0 ,I ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,F ~*> tick ,I ~*> tick ,K ~*> tick] + lbl43> [F ~=> G ,A ~+> 0.0.0 ,A ~+> tick ,G ~+> 0.0.0 ,G ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] YES(?,POLY)