YES(?,O(n^1)) * Step 1: TrivialSCCs WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. eval_start_start(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb0_in(v__0,v__01,v_1,v_x,v_y) True (1,1) 1. eval_start_bb0_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_0(v__0,v__01,v_1,v_x,v_y) True (?,1) 2. eval_start_0(v__0,v__01,v_1,v_x,v_y) -> eval_start_1(v__0,v__01,v_1,v_x,v_y) True (?,1) 3. eval_start_1(v__0,v__01,v_1,v_x,v_y) -> eval_start_2(v__0,v__01,v_1,v_x,v_y) True (?,1) 4. eval_start_2(v__0,v__01,v_1,v_x,v_y) -> eval_start_3(v__0,v__01,v_1,v_x,v_y) True (?,1) 5. eval_start_3(v__0,v__01,v_1,v_x,v_y) -> eval_start_4(v__0,v__01,v_1,v_x,v_y) True (?,1) 6. eval_start_4(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(v_x,v_y,v_1,v_x,v_y) True (?,1) 7. eval_start_bb1_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb2_in(v__0,v__01,v_1,v_x,v_y) [-1 + v__0 >= v__01] (?,1) 8. eval_start_bb1_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb3_in(v__0,v__01,v_1,v_x,v_y) [v__01 >= v__0] (?,1) 9. eval_start_bb2_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_5(v__0,v__01,v_1,v_x,v_y) True (?,1) 10. eval_start_5(v__0,v__01,v_1,v_x,v_y) -> eval_start_6(v__0,v__01,nondef_0,v_x,v_y) True (?,1) 11. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(v__0,1 + v__01,v_1,v_x,v_y) [-1 + v_1 >= 0 && -1 + v_1 >= 0] (?,1) 12. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(-1 + v__0,1 + v__01,v_1,v_x,v_y) [-1 + v_1 >= 0 && 0 >= v_1] (?,1) 13. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(v__0,v__01,v_1,v_x,v_y) [0 >= v_1 && -1 + v_1 >= 0] (?,1) 14. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(-1 + v__0,v__01,v_1,v_x,v_y) [0 >= v_1 && 0 >= v_1] (?,1) 15. eval_start_bb3_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_stop(v__0,v__01,v_1,v_x,v_y) True (?,1) Signature: {(eval_start_0,5) ;(eval_start_1,5) ;(eval_start_2,5) ;(eval_start_3,5) ;(eval_start_4,5) ;(eval_start_5,5) ;(eval_start_6,5) ;(eval_start_bb0_in,5) ;(eval_start_bb1_in,5) ;(eval_start_bb2_in,5) ;(eval_start_bb3_in,5) ;(eval_start_start,5) ;(eval_start_stop,5)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7,8},7->{9},8->{15},9->{10},10->{11,12,13,14},11->{7,8} ,12->{7,8},13->{7,8},14->{7,8},15->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatRules WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. eval_start_start(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb0_in(v__0,v__01,v_1,v_x,v_y) True (1,1) 1. eval_start_bb0_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_0(v__0,v__01,v_1,v_x,v_y) True (1,1) 2. eval_start_0(v__0,v__01,v_1,v_x,v_y) -> eval_start_1(v__0,v__01,v_1,v_x,v_y) True (1,1) 3. eval_start_1(v__0,v__01,v_1,v_x,v_y) -> eval_start_2(v__0,v__01,v_1,v_x,v_y) True (1,1) 4. eval_start_2(v__0,v__01,v_1,v_x,v_y) -> eval_start_3(v__0,v__01,v_1,v_x,v_y) True (1,1) 5. eval_start_3(v__0,v__01,v_1,v_x,v_y) -> eval_start_4(v__0,v__01,v_1,v_x,v_y) True (1,1) 6. eval_start_4(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(v_x,v_y,v_1,v_x,v_y) True (1,1) 7. eval_start_bb1_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb2_in(v__0,v__01,v_1,v_x,v_y) [-1 + v__0 >= v__01] (?,1) 8. eval_start_bb1_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb3_in(v__0,v__01,v_1,v_x,v_y) [v__01 >= v__0] (1,1) 9. eval_start_bb2_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_5(v__0,v__01,v_1,v_x,v_y) True (?,1) 10. eval_start_5(v__0,v__01,v_1,v_x,v_y) -> eval_start_6(v__0,v__01,nondef_0,v_x,v_y) True (?,1) 11. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(v__0,1 + v__01,v_1,v_x,v_y) [-1 + v_1 >= 0 && -1 + v_1 >= 0] (?,1) 12. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(-1 + v__0,1 + v__01,v_1,v_x,v_y) [-1 + v_1 >= 0 && 0 >= v_1] (?,1) 13. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(v__0,v__01,v_1,v_x,v_y) [0 >= v_1 && -1 + v_1 >= 0] (?,1) 14. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(-1 + v__0,v__01,v_1,v_x,v_y) [0 >= v_1 && 0 >= v_1] (?,1) 15. eval_start_bb3_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_stop(v__0,v__01,v_1,v_x,v_y) True (1,1) Signature: {(eval_start_0,5) ;(eval_start_1,5) ;(eval_start_2,5) ;(eval_start_3,5) ;(eval_start_4,5) ;(eval_start_5,5) ;(eval_start_6,5) ;(eval_start_bb0_in,5) ;(eval_start_bb1_in,5) ;(eval_start_bb2_in,5) ;(eval_start_bb3_in,5) ;(eval_start_start,5) ;(eval_start_stop,5)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7,8},7->{9},8->{15},9->{10},10->{11,12,13,14},11->{7,8} ,12->{7,8},13->{7,8},14->{7,8},15->{}] + Applied Processor: UnsatRules + Details: Following transitions have unsatisfiable constraints and are removed: [12,13] * Step 3: AddSinks WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. eval_start_start(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb0_in(v__0,v__01,v_1,v_x,v_y) True (1,1) 1. eval_start_bb0_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_0(v__0,v__01,v_1,v_x,v_y) True (1,1) 2. eval_start_0(v__0,v__01,v_1,v_x,v_y) -> eval_start_1(v__0,v__01,v_1,v_x,v_y) True (1,1) 3. eval_start_1(v__0,v__01,v_1,v_x,v_y) -> eval_start_2(v__0,v__01,v_1,v_x,v_y) True (1,1) 4. eval_start_2(v__0,v__01,v_1,v_x,v_y) -> eval_start_3(v__0,v__01,v_1,v_x,v_y) True (1,1) 5. eval_start_3(v__0,v__01,v_1,v_x,v_y) -> eval_start_4(v__0,v__01,v_1,v_x,v_y) True (1,1) 6. eval_start_4(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(v_x,v_y,v_1,v_x,v_y) True (1,1) 7. eval_start_bb1_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb2_in(v__0,v__01,v_1,v_x,v_y) [-1 + v__0 >= v__01] (?,1) 8. eval_start_bb1_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb3_in(v__0,v__01,v_1,v_x,v_y) [v__01 >= v__0] (1,1) 9. eval_start_bb2_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_5(v__0,v__01,v_1,v_x,v_y) True (?,1) 10. eval_start_5(v__0,v__01,v_1,v_x,v_y) -> eval_start_6(v__0,v__01,nondef_0,v_x,v_y) True (?,1) 11. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(v__0,1 + v__01,v_1,v_x,v_y) [-1 + v_1 >= 0 && -1 + v_1 >= 0] (?,1) 14. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(-1 + v__0,v__01,v_1,v_x,v_y) [0 >= v_1 && 0 >= v_1] (?,1) 15. eval_start_bb3_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_stop(v__0,v__01,v_1,v_x,v_y) True (1,1) Signature: {(eval_start_0,5) ;(eval_start_1,5) ;(eval_start_2,5) ;(eval_start_3,5) ;(eval_start_4,5) ;(eval_start_5,5) ;(eval_start_6,5) ;(eval_start_bb0_in,5) ;(eval_start_bb1_in,5) ;(eval_start_bb2_in,5) ;(eval_start_bb3_in,5) ;(eval_start_start,5) ;(eval_start_stop,5)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7,8},7->{9},8->{15},9->{10},10->{11,14},11->{7,8},14->{7,8} ,15->{}] + Applied Processor: AddSinks + Details: () * Step 4: LooptreeTransformer WORST_CASE(?,O(n^1)) + Considered Problem: Rules: 0. eval_start_start(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb0_in(v__0,v__01,v_1,v_x,v_y) True (1,1) 1. eval_start_bb0_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_0(v__0,v__01,v_1,v_x,v_y) True (?,1) 2. eval_start_0(v__0,v__01,v_1,v_x,v_y) -> eval_start_1(v__0,v__01,v_1,v_x,v_y) True (?,1) 3. eval_start_1(v__0,v__01,v_1,v_x,v_y) -> eval_start_2(v__0,v__01,v_1,v_x,v_y) True (?,1) 4. eval_start_2(v__0,v__01,v_1,v_x,v_y) -> eval_start_3(v__0,v__01,v_1,v_x,v_y) True (?,1) 5. eval_start_3(v__0,v__01,v_1,v_x,v_y) -> eval_start_4(v__0,v__01,v_1,v_x,v_y) True (?,1) 6. eval_start_4(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(v_x,v_y,v_1,v_x,v_y) True (?,1) 7. eval_start_bb1_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb2_in(v__0,v__01,v_1,v_x,v_y) [-1 + v__0 >= v__01] (?,1) 8. eval_start_bb1_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb3_in(v__0,v__01,v_1,v_x,v_y) [v__01 >= v__0] (?,1) 9. eval_start_bb2_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_5(v__0,v__01,v_1,v_x,v_y) True (?,1) 10. eval_start_5(v__0,v__01,v_1,v_x,v_y) -> eval_start_6(v__0,v__01,nondef_0,v_x,v_y) True (?,1) 11. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(v__0,1 + v__01,v_1,v_x,v_y) [-1 + v_1 >= 0 && -1 + v_1 >= 0] (?,1) 14. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(-1 + v__0,v__01,v_1,v_x,v_y) [0 >= v_1 && 0 >= v_1] (?,1) 15. eval_start_bb3_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_stop(v__0,v__01,v_1,v_x,v_y) True (?,1) 16. eval_start_bb3_in(v__0,v__01,v_1,v_x,v_y) -> exitus616(v__0,v__01,v_1,v_x,v_y) True (?,1) Signature: {(eval_start_0,5) ;(eval_start_1,5) ;(eval_start_2,5) ;(eval_start_3,5) ;(eval_start_4,5) ;(eval_start_5,5) ;(eval_start_6,5) ;(eval_start_bb0_in,5) ;(eval_start_bb1_in,5) ;(eval_start_bb2_in,5) ;(eval_start_bb3_in,5) ;(eval_start_start,5) ;(eval_start_stop,5) ;(exitus616,5)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7,8},7->{9},8->{15,16},9->{10},10->{11,14},11->{7,8},14->{7 ,8},15->{},16->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,14,15,16] | `- p:[7,11,10,9,14] c: [7] * Step 5: SizeAbstraction WORST_CASE(?,O(n^1)) + Considered Problem: (Rules: 0. eval_start_start(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb0_in(v__0,v__01,v_1,v_x,v_y) True (1,1) 1. eval_start_bb0_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_0(v__0,v__01,v_1,v_x,v_y) True (?,1) 2. eval_start_0(v__0,v__01,v_1,v_x,v_y) -> eval_start_1(v__0,v__01,v_1,v_x,v_y) True (?,1) 3. eval_start_1(v__0,v__01,v_1,v_x,v_y) -> eval_start_2(v__0,v__01,v_1,v_x,v_y) True (?,1) 4. eval_start_2(v__0,v__01,v_1,v_x,v_y) -> eval_start_3(v__0,v__01,v_1,v_x,v_y) True (?,1) 5. eval_start_3(v__0,v__01,v_1,v_x,v_y) -> eval_start_4(v__0,v__01,v_1,v_x,v_y) True (?,1) 6. eval_start_4(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(v_x,v_y,v_1,v_x,v_y) True (?,1) 7. eval_start_bb1_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb2_in(v__0,v__01,v_1,v_x,v_y) [-1 + v__0 >= v__01] (?,1) 8. eval_start_bb1_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb3_in(v__0,v__01,v_1,v_x,v_y) [v__01 >= v__0] (?,1) 9. eval_start_bb2_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_5(v__0,v__01,v_1,v_x,v_y) True (?,1) 10. eval_start_5(v__0,v__01,v_1,v_x,v_y) -> eval_start_6(v__0,v__01,nondef_0,v_x,v_y) True (?,1) 11. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(v__0,1 + v__01,v_1,v_x,v_y) [-1 + v_1 >= 0 && -1 + v_1 >= 0] (?,1) 14. eval_start_6(v__0,v__01,v_1,v_x,v_y) -> eval_start_bb1_in(-1 + v__0,v__01,v_1,v_x,v_y) [0 >= v_1 && 0 >= v_1] (?,1) 15. eval_start_bb3_in(v__0,v__01,v_1,v_x,v_y) -> eval_start_stop(v__0,v__01,v_1,v_x,v_y) True (?,1) 16. eval_start_bb3_in(v__0,v__01,v_1,v_x,v_y) -> exitus616(v__0,v__01,v_1,v_x,v_y) True (?,1) Signature: {(eval_start_0,5) ;(eval_start_1,5) ;(eval_start_2,5) ;(eval_start_3,5) ;(eval_start_4,5) ;(eval_start_5,5) ;(eval_start_6,5) ;(eval_start_bb0_in,5) ;(eval_start_bb1_in,5) ;(eval_start_bb2_in,5) ;(eval_start_bb3_in,5) ;(eval_start_start,5) ;(eval_start_stop,5) ;(exitus616,5)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7,8},7->{9},8->{15,16},9->{10},10->{11,14},11->{7,8},14->{7 ,8},15->{},16->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,14,15,16] | `- p:[7,11,10,9,14] c: [7]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 6: FlowAbstraction WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [v__0,v__01,v_1,v_x,v_y,0.0] eval_start_start ~> eval_start_bb0_in [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_bb0_in ~> eval_start_0 [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_0 ~> eval_start_1 [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_1 ~> eval_start_2 [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_2 ~> eval_start_3 [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_3 ~> eval_start_4 [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_4 ~> eval_start_bb1_in [v__0 <= v_x, v__01 <= v_y, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_bb1_in ~> eval_start_bb2_in [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_bb1_in ~> eval_start_bb3_in [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_bb2_in ~> eval_start_5 [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_5 ~> eval_start_6 [v__0 <= v__0, v__01 <= v__01, v_1 <= unknown, v_x <= v_x, v_y <= v_y] eval_start_6 ~> eval_start_bb1_in [v__0 <= v__0, v__01 <= K + v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_6 ~> eval_start_bb1_in [v__0 <= K + v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_bb3_in ~> eval_start_stop [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_bb3_in ~> exitus616 [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] + Loop: [0.0 <= 2*K + v__0 + v__01] eval_start_bb1_in ~> eval_start_bb2_in [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_6 ~> eval_start_bb1_in [v__0 <= v__0, v__01 <= K + v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_5 ~> eval_start_6 [v__0 <= v__0, v__01 <= v__01, v_1 <= unknown, v_x <= v_x, v_y <= v_y] eval_start_bb2_in ~> eval_start_5 [v__0 <= v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] eval_start_6 ~> eval_start_bb1_in [v__0 <= K + v__0, v__01 <= v__01, v_1 <= v_1, v_x <= v_x, v_y <= v_y] + Applied Processor: FlowAbstraction + Details: () * Step 7: LareProcessor WORST_CASE(?,O(n^1)) + Considered Problem: Program: Domain: [tick,huge,K,v__0,v__01,v_1,v_x,v_y,0.0] eval_start_start ~> eval_start_bb0_in [] eval_start_bb0_in ~> eval_start_0 [] eval_start_0 ~> eval_start_1 [] eval_start_1 ~> eval_start_2 [] eval_start_2 ~> eval_start_3 [] eval_start_3 ~> eval_start_4 [] eval_start_4 ~> eval_start_bb1_in [v_x ~=> v__0,v_y ~=> v__01] eval_start_bb1_in ~> eval_start_bb2_in [] eval_start_bb1_in ~> eval_start_bb3_in [] eval_start_bb2_in ~> eval_start_5 [] eval_start_5 ~> eval_start_6 [huge ~=> v_1] eval_start_6 ~> eval_start_bb1_in [v__01 ~+> v__01,K ~+> v__01] eval_start_6 ~> eval_start_bb1_in [v__0 ~+> v__0,K ~+> v__0] eval_start_bb3_in ~> eval_start_stop [] eval_start_bb3_in ~> exitus616 [] + Loop: [v__0 ~+> 0.0,v__01 ~+> 0.0,K ~*> 0.0] eval_start_bb1_in ~> eval_start_bb2_in [] eval_start_6 ~> eval_start_bb1_in [v__01 ~+> v__01,K ~+> v__01] eval_start_5 ~> eval_start_6 [huge ~=> v_1] eval_start_bb2_in ~> eval_start_5 [] eval_start_6 ~> eval_start_bb1_in [v__0 ~+> v__0,K ~+> v__0] + Applied Processor: LareProcessor + Details: eval_start_start ~> eval_start_stop [v_x ~=> v__0 ,v_y ~=> v__01 ,huge ~=> v_1 ,v_x ~+> v__0 ,v_x ~+> 0.0 ,v_x ~+> tick ,v_y ~+> v__01 ,v_y ~+> 0.0 ,v_y ~+> tick ,tick ~+> tick ,K ~+> v__0 ,K ~+> v__01 ,v_x ~*> v__0 ,v_x ~*> v__01 ,v_y ~*> v__0 ,v_y ~*> v__01 ,K ~*> v__0 ,K ~*> v__01 ,K ~*> 0.0 ,K ~*> tick] eval_start_start ~> exitus616 [v_x ~=> v__0 ,v_y ~=> v__01 ,huge ~=> v_1 ,v_x ~+> v__0 ,v_x ~+> 0.0 ,v_x ~+> tick ,v_y ~+> v__01 ,v_y ~+> 0.0 ,v_y ~+> tick ,tick ~+> tick ,K ~+> v__0 ,K ~+> v__01 ,v_x ~*> v__0 ,v_x ~*> v__01 ,v_y ~*> v__0 ,v_y ~*> v__01 ,K ~*> v__0 ,K ~*> v__01 ,K ~*> 0.0 ,K ~*> tick] + eval_start_bb1_in> [huge ~=> v_1 ,v__0 ~+> v__0 ,v__0 ~+> 0.0 ,v__0 ~+> tick ,v__01 ~+> v__01 ,v__01 ~+> 0.0 ,v__01 ~+> tick ,tick ~+> tick ,K ~+> v__0 ,K ~+> v__01 ,v__0 ~*> v__0 ,v__0 ~*> v__01 ,v__01 ~*> v__0 ,v__01 ~*> v__01 ,K ~*> v__0 ,K ~*> v__01 ,K ~*> 0.0 ,K ~*> tick] YES(?,O(n^1))