YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,-1 + H,L) [1 >= A && B = C && D = E && F = G && H = A && I = J && K = L] (?,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (?,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (?,1) 3. lbl71(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,1,E,F,G,H,1 + I,J,K,L) [D >= 0 && I >= D && K >= 1 + I && A >= 1 + K && H = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [B >= 0 && A >= 2 + B && I = 1 + B && D = 0 && K = 1 + B && H = A] (?,1) 5. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl13(A,B,C,D,E,F,G,H,I,J,-1 + K,L) [0 >= 1 + D && B >= 0 && D >= 0 && 1 >= D && A >= 2 + B && I = 1 + B && K = 1 + B && H = A] (?,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl13(A,B,C,D,E,F,G,H,I,J,-1 + K,L) [B >= 0 && A >= 2 + B && D = 1 && I = 1 + B && K = 1 + B && H = A] (?,1) 7. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,D,E,M,G,H,I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 8. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,D,E,F,G,H,1 + I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 2 && K = 0 && D = 1 && H = A && I = 1 && B = 0] (?,1) 10. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 11. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 12. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,A,J,J,L,L) True (1,1) Signature: {(lbl13,12);(lbl53,12);(lbl71,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{3},2->{4,5,6,7,8},3->{4,5,6,7,8},4->{},5->{9,10,11},6->{9,10,11},7->{3},8->{4,5,6,7,8},9->{} ,10->{3},11->{4,5,6,7,8},12->{0,1,2}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatRules WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,-1 + H,L) [1 >= A && B = C && D = E && F = G && H = A && I = J && K = L] (1,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (1,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (1,1) 3. lbl71(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,1,E,F,G,H,1 + I,J,K,L) [D >= 0 && I >= D && K >= 1 + I && A >= 1 + K && H = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [B >= 0 && A >= 2 + B && I = 1 + B && D = 0 && K = 1 + B && H = A] (1,1) 5. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl13(A,B,C,D,E,F,G,H,I,J,-1 + K,L) [0 >= 1 + D && B >= 0 && D >= 0 && 1 >= D && A >= 2 + B && I = 1 + B && K = 1 + B && H = A] (?,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl13(A,B,C,D,E,F,G,H,I,J,-1 + K,L) [B >= 0 && A >= 2 + B && D = 1 && I = 1 + B && K = 1 + B && H = A] (?,1) 7. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,D,E,M,G,H,I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 8. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,D,E,F,G,H,1 + I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 2 && K = 0 && D = 1 && H = A && I = 1 && B = 0] (1,1) 10. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 11. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 12. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,A,J,J,L,L) True (1,1) Signature: {(lbl13,12);(lbl53,12);(lbl71,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{3},2->{4,5,6,7,8},3->{4,5,6,7,8},4->{},5->{9,10,11},6->{9,10,11},7->{3},8->{4,5,6,7,8},9->{} ,10->{3},11->{4,5,6,7,8},12->{0,1,2}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [5] * Step 3: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,-1 + H,L) [1 >= A && B = C && D = E && F = G && H = A && I = J && K = L] (1,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (1,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (1,1) 3. lbl71(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,1,E,F,G,H,1 + I,J,K,L) [D >= 0 && I >= D && K >= 1 + I && A >= 1 + K && H = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [B >= 0 && A >= 2 + B && I = 1 + B && D = 0 && K = 1 + B && H = A] (1,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl13(A,B,C,D,E,F,G,H,I,J,-1 + K,L) [B >= 0 && A >= 2 + B && D = 1 && I = 1 + B && K = 1 + B && H = A] (?,1) 7. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,D,E,M,G,H,I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 8. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,D,E,F,G,H,1 + I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 2 && K = 0 && D = 1 && H = A && I = 1 && B = 0] (1,1) 10. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 11. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 12. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,A,J,J,L,L) True (1,1) Signature: {(lbl13,12);(lbl53,12);(lbl71,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{3},2->{4,6,7,8},3->{4,6,7,8},4->{},6->{9,10,11},7->{3},8->{4,6,7,8},9->{},10->{3},11->{4,6,7,8} ,12->{0,1,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,6),(3,4),(11,6)] * Step 4: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,-1 + H,L) [1 >= A && B = C && D = E && F = G && H = A && I = J && K = L] (1,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (1,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (1,1) 3. lbl71(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,1,E,F,G,H,1 + I,J,K,L) [D >= 0 && I >= D && K >= 1 + I && A >= 1 + K && H = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [B >= 0 && A >= 2 + B && I = 1 + B && D = 0 && K = 1 + B && H = A] (1,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl13(A,B,C,D,E,F,G,H,I,J,-1 + K,L) [B >= 0 && A >= 2 + B && D = 1 && I = 1 + B && K = 1 + B && H = A] (?,1) 7. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,D,E,M,G,H,I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 8. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,D,E,F,G,H,1 + I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 2 && K = 0 && D = 1 && H = A && I = 1 && B = 0] (1,1) 10. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 11. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 12. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,A,J,J,L,L) True (1,1) Signature: {(lbl13,12);(lbl53,12);(lbl71,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{3},2->{4,7,8},3->{6,7,8},4->{},6->{9,10,11},7->{3},8->{4,6,7,8},9->{},10->{3},11->{4,7,8} ,12->{0,1,2}] + Applied Processor: AddSinks + Details: () * Step 5: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,-1 + H,L) [1 >= A && B = C && D = E && F = G && H = A && I = J && K = L] (?,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (?,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (?,1) 3. lbl71(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,1,E,F,G,H,1 + I,J,K,L) [D >= 0 && I >= D && K >= 1 + I && A >= 1 + K && H = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [B >= 0 && A >= 2 + B && I = 1 + B && D = 0 && K = 1 + B && H = A] (?,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl13(A,B,C,D,E,F,G,H,I,J,-1 + K,L) [B >= 0 && A >= 2 + B && D = 1 && I = 1 + B && K = 1 + B && H = A] (?,1) 7. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,D,E,M,G,H,I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 8. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,D,E,F,G,H,1 + I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 2 && K = 0 && D = 1 && H = A && I = 1 && B = 0] (?,1) 10. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 11. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 12. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,A,J,J,L,L) True (1,1) 13. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) 14. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) 15. start(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) Signature: {(exitus616,12);(lbl13,12);(lbl53,12);(lbl71,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{3},2->{4,6,7,8,13},3->{4,6,7,8,13},4->{},6->{9,10,11,14},7->{3},8->{4,6,7,8,13},9->{},10->{3} ,11->{4,6,7,8,13},12->{0,1,2,15},13->{},14->{},15->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,6),(3,4),(11,6)] * Step 6: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,-1 + H,L) [1 >= A && B = C && D = E && F = G && H = A && I = J && K = L] (?,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (?,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (?,1) 3. lbl71(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,1,E,F,G,H,1 + I,J,K,L) [D >= 0 && I >= D && K >= 1 + I && A >= 1 + K && H = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [B >= 0 && A >= 2 + B && I = 1 + B && D = 0 && K = 1 + B && H = A] (?,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl13(A,B,C,D,E,F,G,H,I,J,-1 + K,L) [B >= 0 && A >= 2 + B && D = 1 && I = 1 + B && K = 1 + B && H = A] (?,1) 7. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,D,E,M,G,H,I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 8. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,D,E,F,G,H,1 + I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 2 && K = 0 && D = 1 && H = A && I = 1 && B = 0] (?,1) 10. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 11. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 12. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,A,J,J,L,L) True (1,1) 13. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) 14. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) 15. start(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) Signature: {(exitus616,12);(lbl13,12);(lbl53,12);(lbl71,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{3},2->{4,7,8,13},3->{6,7,8,13},4->{},6->{9,10,11,14},7->{3},8->{4,6,7,8,13},9->{},10->{3} ,11->{4,7,8,13},12->{0,1,2,15},13->{},14->{},15->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,6,7,8,9,10,11,12,13,14,15] | `- p:[3,7,8,11,6,10] c: [11] | `- p:[3,7,8,10,6] c: [10] | `- p:[3,7,8] c: [8] | `- p:[3,7] c: [7] * Step 7: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. start(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,-1 + H,L) [1 >= A && B = C && D = E && F = G && H = A && I = J && K = L] (?,1) 1. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (?,1) 2. start(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,-1 + H,L) [A >= 2 && B = C && D = E && F = G && H = A && I = J && K = L] (?,1) 3. lbl71(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,1,E,F,G,H,1 + I,J,K,L) [D >= 0 && I >= D && K >= 1 + I && A >= 1 + K && H = A] (?,1) 4. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [B >= 0 && A >= 2 + B && I = 1 + B && D = 0 && K = 1 + B && H = A] (?,1) 6. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl13(A,B,C,D,E,F,G,H,I,J,-1 + K,L) [B >= 0 && A >= 2 + B && D = 1 && I = 1 + B && K = 1 + B && H = A] (?,1) 7. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,D,E,M,G,H,I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 8. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,I,C,D,E,F,G,H,1 + I,J,K,L) [K >= 2 + B && B >= 0 && D >= 0 && K >= 1 + B && 1 >= D && A >= 1 + K && I = 1 + B && H = A] (?,1) 9. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> stop(A,B,C,D,E,F,G,H,I,J,K,L) [A >= 2 && K = 0 && D = 1 && H = A && I = 1 && B = 0] (?,1) 10. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl71(A,B,C,0,E,M,G,H,0,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 11. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> lbl53(A,0,C,0,E,F,G,H,1,J,K,L) [B >= 1 && B >= 0 && A >= 2 + B && D = 1 && H = A && K = B && I = 1 + B] (?,1) 12. start0(A,B,C,D,E,F,G,H,I,J,K,L) -> start(A,C,C,E,E,G,G,A,J,J,L,L) True (1,1) 13. lbl53(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) 14. lbl13(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) 15. start(A,B,C,D,E,F,G,H,I,J,K,L) -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L) True (?,1) Signature: {(exitus616,12);(lbl13,12);(lbl53,12);(lbl71,12);(start,12);(start0,12);(stop,12)} Flow Graph: [0->{},1->{3},2->{4,7,8,13},3->{6,7,8,13},4->{},6->{9,10,11,14},7->{3},8->{4,6,7,8,13},9->{},10->{3} ,11->{4,7,8,13},12->{0,1,2,15},13->{},14->{},15->{}] ,We construct a looptree: P: [0,1,2,3,4,6,7,8,9,10,11,12,13,14,15] | `- p:[3,7,8,11,6,10] c: [11] | `- p:[3,7,8,10,6] c: [10] | `- p:[3,7,8] c: [8] | `- p:[3,7] c: [7]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 8: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,F,G,H,I,J,K,L,0.0,0.0.0,0.0.0.0,0.0.0.0.0] start ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K + H, L <= L] start ~> lbl71 [A <= A, B <= B, C <= C, D <= 0*K, E <= E, F <= unknown, G <= G, H <= H, I <= 0*K, J <= J, K <= H, L <= L] start ~> lbl53 [A <= A, B <= 0*K, C <= C, D <= 0*K, E <= E, F <= F, G <= G, H <= H, I <= K, J <= J, K <= H, L <= L] lbl71 ~> lbl53 [A <= A, B <= I, C <= C, D <= K, E <= E, F <= F, G <= G, H <= H, I <= A, J <= J, K <= K, L <= L] lbl53 ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] lbl53 ~> lbl13 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= A, L <= L] lbl53 ~> lbl71 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= unknown, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] lbl53 ~> lbl53 [A <= A, B <= I, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= A, J <= J, K <= K, L <= L] lbl13 ~> stop [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] lbl13 ~> lbl71 [A <= A, B <= B, C <= C, D <= 0*K, E <= E, F <= unknown, G <= G, H <= H, I <= 0*K, J <= J, K <= K, L <= L] lbl13 ~> lbl53 [A <= A, B <= 0*K, C <= C, D <= 0*K, E <= E, F <= F, G <= G, H <= H, I <= K, J <= J, K <= K, L <= L] start0 ~> start [A <= A, B <= C, C <= C, D <= E, E <= E, F <= G, G <= G, H <= A, I <= J, J <= J, K <= L, L <= L] lbl53 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] lbl13 ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] start ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] + Loop: [0.0 <= K + B + K] lbl71 ~> lbl53 [A <= A, B <= I, C <= C, D <= K, E <= E, F <= F, G <= G, H <= H, I <= A, J <= J, K <= K, L <= L] lbl53 ~> lbl71 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= unknown, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] lbl53 ~> lbl53 [A <= A, B <= I, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= A, J <= J, K <= K, L <= L] lbl13 ~> lbl53 [A <= A, B <= 0*K, C <= C, D <= 0*K, E <= E, F <= F, G <= G, H <= H, I <= K, J <= J, K <= K, L <= L] lbl53 ~> lbl13 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= A, L <= L] lbl13 ~> lbl71 [A <= A, B <= B, C <= C, D <= 0*K, E <= E, F <= unknown, G <= G, H <= H, I <= 0*K, J <= J, K <= K, L <= L] + Loop: [0.0.0 <= K + K] lbl71 ~> lbl53 [A <= A, B <= I, C <= C, D <= K, E <= E, F <= F, G <= G, H <= H, I <= A, J <= J, K <= K, L <= L] lbl53 ~> lbl71 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= unknown, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] lbl53 ~> lbl53 [A <= A, B <= I, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= A, J <= J, K <= K, L <= L] lbl13 ~> lbl71 [A <= A, B <= B, C <= C, D <= 0*K, E <= E, F <= unknown, G <= G, H <= H, I <= 0*K, J <= J, K <= K, L <= L] lbl53 ~> lbl13 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= I, J <= J, K <= A, L <= L] + Loop: [0.0.0.0 <= I + K] lbl71 ~> lbl53 [A <= A, B <= I, C <= C, D <= K, E <= E, F <= F, G <= G, H <= H, I <= A, J <= J, K <= K, L <= L] lbl53 ~> lbl71 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= unknown, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] lbl53 ~> lbl53 [A <= A, B <= I, C <= C, D <= D, E <= E, F <= F, G <= G, H <= H, I <= A, J <= J, K <= K, L <= L] + Loop: [0.0.0.0.0 <= K + B + I + K] lbl71 ~> lbl53 [A <= A, B <= I, C <= C, D <= K, E <= E, F <= F, G <= G, H <= H, I <= A, J <= J, K <= K, L <= L] lbl53 ~> lbl71 [A <= A, B <= B, C <= C, D <= D, E <= E, F <= unknown, G <= G, H <= H, I <= I, J <= J, K <= K, L <= L] + Applied Processor: FlowAbstraction + Details: () * Step 9: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,F,G,H,I,J,K,L,0.0,0.0.0,0.0.0.0,0.0.0.0.0] start ~> stop [H ~+> K,K ~+> K] start ~> lbl71 [H ~=> K,K ~=> D,K ~=> I,huge ~=> F] start ~> lbl53 [H ~=> K,K ~=> B,K ~=> D,K ~=> I] lbl71 ~> lbl53 [A ~=> I,I ~=> B,K ~=> D] lbl53 ~> stop [] lbl53 ~> lbl13 [A ~=> K] lbl53 ~> lbl71 [huge ~=> F] lbl53 ~> lbl53 [A ~=> I,I ~=> B] lbl13 ~> stop [] lbl13 ~> lbl71 [K ~=> D,K ~=> I,huge ~=> F] lbl13 ~> lbl53 [K ~=> B,K ~=> D,K ~=> I] start0 ~> start [A ~=> H,C ~=> B,E ~=> D,G ~=> F,J ~=> I,L ~=> K] lbl53 ~> exitus616 [] lbl13 ~> exitus616 [] start ~> exitus616 [] + Loop: [B ~+> 0.0,K ~+> 0.0,K ~+> 0.0] lbl71 ~> lbl53 [A ~=> I,I ~=> B,K ~=> D] lbl53 ~> lbl71 [huge ~=> F] lbl53 ~> lbl53 [A ~=> I,I ~=> B] lbl13 ~> lbl53 [K ~=> B,K ~=> D,K ~=> I] lbl53 ~> lbl13 [A ~=> K] lbl13 ~> lbl71 [K ~=> D,K ~=> I,huge ~=> F] + Loop: [K ~+> 0.0.0,K ~+> 0.0.0] lbl71 ~> lbl53 [A ~=> I,I ~=> B,K ~=> D] lbl53 ~> lbl71 [huge ~=> F] lbl53 ~> lbl53 [A ~=> I,I ~=> B] lbl13 ~> lbl71 [K ~=> D,K ~=> I,huge ~=> F] lbl53 ~> lbl13 [A ~=> K] + Loop: [I ~+> 0.0.0.0,K ~+> 0.0.0.0] lbl71 ~> lbl53 [A ~=> I,I ~=> B,K ~=> D] lbl53 ~> lbl71 [huge ~=> F] lbl53 ~> lbl53 [A ~=> I,I ~=> B] + Loop: [B ~+> 0.0.0.0.0,I ~+> 0.0.0.0.0,K ~+> 0.0.0.0.0,K ~+> 0.0.0.0.0] lbl71 ~> lbl53 [A ~=> I,I ~=> B,K ~=> D] lbl53 ~> lbl71 [huge ~=> F] + Applied Processor: LareProcessor + Details: start0 ~> stop [A ~=> B ,A ~=> H ,A ~=> I ,A ~=> K ,C ~=> B ,E ~=> D ,G ~=> F ,J ~=> I ,K ~=> B ,K ~=> D ,K ~=> I ,huge ~=> F ,A ~+> K ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,C ~+> 0.0 ,C ~+> 0.0.0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> K ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> 0.0 ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,C ~*> tick ,K ~*> 0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick] start0 ~> exitus616 [A ~=> B ,A ~=> H ,A ~=> I ,A ~=> K ,C ~=> B ,E ~=> D ,G ~=> F ,J ~=> I ,L ~=> K ,K ~=> B ,K ~=> D ,K ~=> I ,huge ~=> F ,A ~+> 0.0 ,A ~+> 0.0.0 ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,C ~+> 0.0 ,C ~+> 0.0.0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> 0.0 ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,C ~*> tick ,K ~*> 0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick] + lbl53> [A ~=> B ,A ~=> I ,A ~=> K ,I ~=> B ,K ~=> B ,K ~=> D ,K ~=> I ,huge ~=> F ,A ~+> 0.0.0 ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,I ~+> 0.0.0.0 ,I ~+> 0.0.0.0.0 ,I ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> tick ,I ~*> tick ,K ~*> tick ,K ~*> 0.0.0.0.0 ,K ~*> tick] lbl13> [A ~=> B ,A ~=> I ,A ~=> K ,I ~=> B ,K ~=> B ,K ~=> D ,K ~=> I ,huge ~=> F ,A ~+> 0.0.0 ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,I ~+> 0.0.0.0 ,I ~+> 0.0.0.0.0 ,I ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> tick ,I ~*> tick ,K ~*> tick ,K ~*> 0.0.0.0.0 ,K ~*> tick] lbl53> [A ~=> B ,A ~=> I ,A ~=> K ,I ~=> B ,K ~=> B ,K ~=> D ,K ~=> I ,huge ~=> F ,A ~+> 0.0.0 ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,I ~+> 0.0.0.0 ,I ~+> 0.0.0.0.0 ,I ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> tick ,I ~*> tick ,K ~*> tick ,K ~*> 0.0.0.0.0 ,K ~*> tick] lbl13> [A ~=> B ,A ~=> I ,A ~=> K ,I ~=> B ,K ~=> B ,K ~=> D ,K ~=> I ,huge ~=> F ,A ~+> 0.0.0 ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,I ~+> 0.0.0.0 ,I ~+> 0.0.0.0.0 ,I ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> tick ,I ~*> tick ,K ~*> tick ,K ~*> 0.0.0.0.0 ,K ~*> tick] + lbl53> [A ~=> B ,A ~=> I ,A ~=> K ,I ~=> B ,K ~=> B ,K ~=> D ,K ~=> I ,huge ~=> F ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0.0.0.0 ,B ~+> tick ,I ~+> 0.0.0.0 ,I ~+> 0.0.0.0.0 ,I ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> tick ,I ~*> tick ,K ~*> tick ,K ~*> 0.0.0.0.0 ,K ~*> tick] lbl13> [A ~=> B ,A ~=> I ,A ~=> K ,I ~=> B ,K ~=> B ,K ~=> D ,K ~=> I ,huge ~=> F ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0.0.0.0 ,B ~+> tick ,I ~+> 0.0.0.0 ,I ~+> 0.0.0.0.0 ,I ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> tick ,I ~*> tick ,K ~*> tick ,K ~*> 0.0.0.0.0 ,K ~*> tick] lbl53> [A ~=> B ,A ~=> I ,A ~=> K ,I ~=> B ,K ~=> B ,K ~=> D ,K ~=> I ,huge ~=> F ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0.0.0.0 ,B ~+> tick ,I ~+> 0.0.0.0 ,I ~+> 0.0.0.0.0 ,I ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> tick ,I ~*> tick ,K ~*> tick ,K ~*> 0.0.0.0.0 ,K ~*> tick] lbl13> [A ~=> B ,A ~=> I ,A ~=> K ,I ~=> B ,K ~=> B ,K ~=> D ,K ~=> I ,huge ~=> F ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0.0.0.0 ,B ~+> tick ,I ~+> 0.0.0.0 ,I ~+> 0.0.0.0.0 ,I ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> tick ,I ~*> tick ,K ~*> tick ,K ~*> 0.0.0.0.0 ,K ~*> tick] + lbl53> [A ~=> B ,A ~=> I ,I ~=> B ,K ~=> D ,huge ~=> F ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0.0.0.0 ,B ~+> tick ,I ~+> 0.0.0.0 ,I ~+> 0.0.0.0.0 ,I ~+> tick ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> tick ,I ~*> tick ,K ~*> tick ,K ~*> tick] lbl53> [A ~=> B ,A ~=> I ,I ~=> B ,K ~=> D ,huge ~=> F ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0.0.0.0 ,B ~+> tick ,I ~+> 0.0.0.0 ,I ~+> 0.0.0.0.0 ,I ~+> tick ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> tick ,I ~*> tick ,K ~*> tick ,K ~*> tick] + lbl53> [A ~=> B ,A ~=> I ,I ~=> B ,K ~=> D ,huge ~=> F ,B ~+> 0.0.0.0.0 ,B ~+> tick ,I ~+> 0.0.0.0.0 ,I ~+> tick ,K ~+> 0.0.0.0.0 ,K ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0.0 ,K ~+> tick] lbl53> [A ~=> B ,A ~=> I ,I ~=> B ,K ~=> D ,huge ~=> F ,B ~+> 0.0.0.0.0 ,B ~+> tick ,I ~+> 0.0.0.0.0 ,I ~+> tick ,K ~+> 0.0.0.0.0 ,K ~+> tick ,tick ~+> tick ,K ~+> 0.0.0.0.0 ,K ~+> tick] YES(?,POLY)