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