YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb0_in(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_0(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 2. eval_start_0(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_1(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 3. eval_start_1(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_2(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 4. eval_start_2(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_3(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 5. eval_start_3(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_4(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 6. eval_start_4(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_5(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 7. eval_start_5(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb1_in(v_n,v__1,1,v_flag_1,v_n) True (?,1) 8. eval_start_bb1_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb2_in(v__0,v__0,v_flag_0,0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) [0 >= v_flag_0] (?,1) 10. eval_start_bb2_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb3_in(v__0,v__1,v_flag_0,v_flag_1,v_n) [-1 + v__1 >= 0] (?,1) 11. eval_start_bb2_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb1_in(v__1,v__1,v_flag_1,v_flag_1,v_n) [0 >= v__1] (?,1) 12. eval_start_bb3_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb2_in(v__0,-1 + v__1,v_flag_0,1,v_n) True (?,1) 13. eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_stop(v__0,v__1,v_flag_0,v_flag_1,v_n) 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_bb0_in,5) ;(eval_start_bb1_in,5) ;(eval_start_bb2_in,5) ;(eval_start_bb3_in,5) ;(eval_start_bb4_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},7->{8,9},8->{10,11},9->{13},10->{12},11->{8,9},12->{10 ,11},13->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb0_in(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_0(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 2. eval_start_0(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_1(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 3. eval_start_1(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_2(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 4. eval_start_2(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_3(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 5. eval_start_3(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_4(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 6. eval_start_4(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_5(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 7. eval_start_5(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb1_in(v_n,v__1,1,v_flag_1,v_n) True (1,1) 8. eval_start_bb1_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb2_in(v__0,v__0,v_flag_0,0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) [0 >= v_flag_0] (1,1) 10. eval_start_bb2_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb3_in(v__0,v__1,v_flag_0,v_flag_1,v_n) [-1 + v__1 >= 0] (?,1) 11. eval_start_bb2_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb1_in(v__1,v__1,v_flag_1,v_flag_1,v_n) [0 >= v__1] (?,1) 12. eval_start_bb3_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb2_in(v__0,-1 + v__1,v_flag_0,1,v_n) True (?,1) 13. eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_stop(v__0,v__1,v_flag_0,v_flag_1,v_n) 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_bb0_in,5) ;(eval_start_bb1_in,5) ;(eval_start_bb2_in,5) ;(eval_start_bb3_in,5) ;(eval_start_bb4_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},7->{8,9},8->{10,11},9->{13},10->{12},11->{8,9},12->{10 ,11},13->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(7,9)] * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb0_in(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_0(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 2. eval_start_0(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_1(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 3. eval_start_1(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_2(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 4. eval_start_2(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_3(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 5. eval_start_3(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_4(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 6. eval_start_4(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_5(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 7. eval_start_5(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb1_in(v_n,v__1,1,v_flag_1,v_n) True (1,1) 8. eval_start_bb1_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb2_in(v__0,v__0,v_flag_0,0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) [0 >= v_flag_0] (1,1) 10. eval_start_bb2_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb3_in(v__0,v__1,v_flag_0,v_flag_1,v_n) [-1 + v__1 >= 0] (?,1) 11. eval_start_bb2_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb1_in(v__1,v__1,v_flag_1,v_flag_1,v_n) [0 >= v__1] (?,1) 12. eval_start_bb3_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb2_in(v__0,-1 + v__1,v_flag_0,1,v_n) True (?,1) 13. eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_stop(v__0,v__1,v_flag_0,v_flag_1,v_n) 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_bb0_in,5) ;(eval_start_bb1_in,5) ;(eval_start_bb2_in,5) ;(eval_start_bb3_in,5) ;(eval_start_bb4_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},7->{8},8->{10,11},9->{13},10->{12},11->{8,9},12->{10,11} ,13->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb0_in(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_0(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 2. eval_start_0(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_1(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 3. eval_start_1(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_2(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 4. eval_start_2(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_3(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 5. eval_start_3(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_4(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 6. eval_start_4(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_5(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 7. eval_start_5(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb1_in(v_n,v__1,1,v_flag_1,v_n) True (?,1) 8. eval_start_bb1_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb2_in(v__0,v__0,v_flag_0,0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) [0 >= v_flag_0] (?,1) 10. eval_start_bb2_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb3_in(v__0,v__1,v_flag_0,v_flag_1,v_n) [-1 + v__1 >= 0] (?,1) 11. eval_start_bb2_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb1_in(v__1,v__1,v_flag_1,v_flag_1,v_n) [0 >= v__1] (?,1) 12. eval_start_bb3_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb2_in(v__0,-1 + v__1,v_flag_0,1,v_n) True (?,1) 13. eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_stop(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 14. eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> exitus616(v__0,v__1,v_flag_0,v_flag_1,v_n) 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_bb0_in,5) ;(eval_start_bb1_in,5) ;(eval_start_bb2_in,5) ;(eval_start_bb3_in,5) ;(eval_start_bb4_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},7->{8,9},8->{10,11},9->{13,14},10->{12},11->{8,9} ,12->{10,11},13->{},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(7,9)] * Step 5: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. eval_start_start(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb0_in(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_0(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 2. eval_start_0(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_1(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 3. eval_start_1(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_2(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 4. eval_start_2(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_3(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 5. eval_start_3(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_4(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 6. eval_start_4(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_5(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 7. eval_start_5(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb1_in(v_n,v__1,1,v_flag_1,v_n) True (?,1) 8. eval_start_bb1_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb2_in(v__0,v__0,v_flag_0,0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) [0 >= v_flag_0] (?,1) 10. eval_start_bb2_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb3_in(v__0,v__1,v_flag_0,v_flag_1,v_n) [-1 + v__1 >= 0] (?,1) 11. eval_start_bb2_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb1_in(v__1,v__1,v_flag_1,v_flag_1,v_n) [0 >= v__1] (?,1) 12. eval_start_bb3_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb2_in(v__0,-1 + v__1,v_flag_0,1,v_n) True (?,1) 13. eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_stop(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 14. eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> exitus616(v__0,v__1,v_flag_0,v_flag_1,v_n) 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_bb0_in,5) ;(eval_start_bb1_in,5) ;(eval_start_bb2_in,5) ;(eval_start_bb3_in,5) ;(eval_start_bb4_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},7->{8},8->{10,11},9->{13,14},10->{12},11->{8,9},12->{10 ,11},13->{},14->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14] | `- p:[8,11,12,10] c: [10] | `- p:[8,11] c: [8] * Step 6: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. eval_start_start(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb0_in(v__0,v__1,v_flag_0,v_flag_1,v_n) True (1,1) 1. eval_start_bb0_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_0(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 2. eval_start_0(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_1(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 3. eval_start_1(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_2(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 4. eval_start_2(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_3(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 5. eval_start_3(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_4(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 6. eval_start_4(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_5(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 7. eval_start_5(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb1_in(v_n,v__1,1,v_flag_1,v_n) True (?,1) 8. eval_start_bb1_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb2_in(v__0,v__0,v_flag_0,0,v_n) [-1 + v_flag_0 >= 0] (?,1) 9. eval_start_bb1_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) [0 >= v_flag_0] (?,1) 10. eval_start_bb2_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb3_in(v__0,v__1,v_flag_0,v_flag_1,v_n) [-1 + v__1 >= 0] (?,1) 11. eval_start_bb2_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb1_in(v__1,v__1,v_flag_1,v_flag_1,v_n) [0 >= v__1] (?,1) 12. eval_start_bb3_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_bb2_in(v__0,-1 + v__1,v_flag_0,1,v_n) True (?,1) 13. eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> eval_start_stop(v__0,v__1,v_flag_0,v_flag_1,v_n) True (?,1) 14. eval_start_bb4_in(v__0,v__1,v_flag_0,v_flag_1,v_n) -> exitus616(v__0,v__1,v_flag_0,v_flag_1,v_n) 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_bb0_in,5) ;(eval_start_bb1_in,5) ;(eval_start_bb2_in,5) ;(eval_start_bb3_in,5) ;(eval_start_bb4_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},7->{8},8->{10,11},9->{13,14},10->{12},11->{8,9},12->{10 ,11},13->{},14->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14] | `- p:[8,11,12,10] c: [10] | `- p:[8,11] c: [8]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [v__0,v__1,v_flag_0,v_flag_1,v_n,0.0,0.0.0] eval_start_start ~> eval_start_bb0_in [v__0 <= v__0, v__1 <= v__1, v_flag_0 <= v_flag_0, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_bb0_in ~> eval_start_0 [v__0 <= v__0, v__1 <= v__1, v_flag_0 <= v_flag_0, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_0 ~> eval_start_1 [v__0 <= v__0, v__1 <= v__1, v_flag_0 <= v_flag_0, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_1 ~> eval_start_2 [v__0 <= v__0, v__1 <= v__1, v_flag_0 <= v_flag_0, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_2 ~> eval_start_3 [v__0 <= v__0, v__1 <= v__1, v_flag_0 <= v_flag_0, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_3 ~> eval_start_4 [v__0 <= v__0, v__1 <= v__1, v_flag_0 <= v_flag_0, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_4 ~> eval_start_5 [v__0 <= v__0, v__1 <= v__1, v_flag_0 <= v_flag_0, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_5 ~> eval_start_bb1_in [v__0 <= v_n, v__1 <= v__1, v_flag_0 <= K, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_bb1_in ~> eval_start_bb2_in [v__0 <= v__0, v__1 <= v__0, v_flag_0 <= v_flag_0, v_flag_1 <= 0*K, v_n <= v_n] eval_start_bb1_in ~> eval_start_bb4_in [v__0 <= v__0, v__1 <= v__1, v_flag_0 <= v_flag_0, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_bb2_in ~> eval_start_bb3_in [v__0 <= v__0, v__1 <= v__1, v_flag_0 <= v_flag_0, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_bb2_in ~> eval_start_bb1_in [v__0 <= v__1, v__1 <= v__1, v_flag_0 <= v_flag_1, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_bb3_in ~> eval_start_bb2_in [v__0 <= v__0, v__1 <= K + v__1, v_flag_0 <= v_flag_0, v_flag_1 <= K, v_n <= v_n] eval_start_bb4_in ~> eval_start_stop [v__0 <= v__0, v__1 <= v__1, v_flag_0 <= v_flag_0, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_bb4_in ~> exitus616 [v__0 <= v__0, v__1 <= v__1, v_flag_0 <= v_flag_0, v_flag_1 <= v_flag_1, v_n <= v_n] + Loop: [0.0 <= 2*K + v__0 + v__1] eval_start_bb1_in ~> eval_start_bb2_in [v__0 <= v__0, v__1 <= v__0, v_flag_0 <= v_flag_0, v_flag_1 <= 0*K, v_n <= v_n] eval_start_bb2_in ~> eval_start_bb1_in [v__0 <= v__1, v__1 <= v__1, v_flag_0 <= v_flag_1, v_flag_1 <= v_flag_1, v_n <= v_n] eval_start_bb3_in ~> eval_start_bb2_in [v__0 <= v__0, v__1 <= K + v__1, v_flag_0 <= v_flag_0, v_flag_1 <= K, v_n <= v_n] eval_start_bb2_in ~> eval_start_bb3_in [v__0 <= v__0, v__1 <= v__1, v_flag_0 <= v_flag_0, v_flag_1 <= v_flag_1, v_n <= v_n] + Loop: [0.0.0 <= K + v_flag_0 + v_flag_1] eval_start_bb1_in ~> eval_start_bb2_in [v__0 <= v__0, v__1 <= v__0, v_flag_0 <= v_flag_0, v_flag_1 <= 0*K, v_n <= v_n] eval_start_bb2_in ~> eval_start_bb1_in [v__0 <= v__1, v__1 <= v__1, v_flag_0 <= v_flag_1, v_flag_1 <= v_flag_1, v_n <= v_n] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,v__0,v__1,v_flag_0,v_flag_1,v_n,0.0,0.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_5 [] eval_start_5 ~> eval_start_bb1_in [v_n ~=> v__0,K ~=> v_flag_0] eval_start_bb1_in ~> eval_start_bb2_in [v__0 ~=> v__1,K ~=> v_flag_1] eval_start_bb1_in ~> eval_start_bb4_in [] eval_start_bb2_in ~> eval_start_bb3_in [] eval_start_bb2_in ~> eval_start_bb1_in [v__1 ~=> v__0,v_flag_1 ~=> v_flag_0] eval_start_bb3_in ~> eval_start_bb2_in [K ~=> v_flag_1,v__1 ~+> v__1,K ~+> v__1] eval_start_bb4_in ~> eval_start_stop [] eval_start_bb4_in ~> exitus616 [] + Loop: [v__0 ~+> 0.0,v__1 ~+> 0.0,K ~*> 0.0] eval_start_bb1_in ~> eval_start_bb2_in [v__0 ~=> v__1,K ~=> v_flag_1] eval_start_bb2_in ~> eval_start_bb1_in [v__1 ~=> v__0,v_flag_1 ~=> v_flag_0] eval_start_bb3_in ~> eval_start_bb2_in [K ~=> v_flag_1,v__1 ~+> v__1,K ~+> v__1] eval_start_bb2_in ~> eval_start_bb3_in [] + Loop: [v_flag_0 ~+> 0.0.0,v_flag_1 ~+> 0.0.0,K ~+> 0.0.0] eval_start_bb1_in ~> eval_start_bb2_in [v__0 ~=> v__1,K ~=> v_flag_1] eval_start_bb2_in ~> eval_start_bb1_in [v__1 ~=> v__0,v_flag_1 ~=> v_flag_0] + Applied Processor: LareProcessor + Details: eval_start_start ~> exitus616 [v__1 ~=> v__0 ,v_flag_1 ~=> v_flag_0 ,v_n ~=> v__0 ,v_n ~=> v__1 ,K ~=> v_flag_0 ,K ~=> v_flag_1 ,v__1 ~+> v__0 ,v__1 ~+> v__1 ,v__1 ~+> 0.0 ,v__1 ~+> tick ,v_flag_1 ~+> 0.0.0 ,v_flag_1 ~+> tick ,v_n ~+> v__0 ,v_n ~+> v__1 ,v_n ~+> 0.0 ,v_n ~+> tick ,tick ~+> tick ,K ~+> v__0 ,K ~+> v__1 ,K ~+> 0.0.0 ,K ~+> tick ,v__1 ~*> v__0 ,v__1 ~*> v__1 ,v__1 ~*> tick ,v_flag_1 ~*> 0.0.0 ,v_flag_1 ~*> tick ,v_n ~*> v__0 ,v_n ~*> v__1 ,v_n ~*> tick ,K ~*> v__0 ,K ~*> v__1 ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] eval_start_start ~> eval_start_stop [v__1 ~=> v__0 ,v_flag_1 ~=> v_flag_0 ,v_n ~=> v__0 ,v_n ~=> v__1 ,K ~=> v_flag_0 ,K ~=> v_flag_1 ,v__1 ~+> v__0 ,v__1 ~+> v__1 ,v__1 ~+> 0.0 ,v__1 ~+> tick ,v_flag_1 ~+> 0.0.0 ,v_flag_1 ~+> tick ,v_n ~+> v__0 ,v_n ~+> v__1 ,v_n ~+> 0.0 ,v_n ~+> tick ,tick ~+> tick ,K ~+> v__0 ,K ~+> v__1 ,K ~+> 0.0.0 ,K ~+> tick ,v__1 ~*> v__0 ,v__1 ~*> v__1 ,v__1 ~*> tick ,v_flag_1 ~*> 0.0.0 ,v_flag_1 ~*> tick ,v_n ~*> v__0 ,v_n ~*> v__1 ,v_n ~*> tick ,K ~*> v__0 ,K ~*> v__1 ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] + eval_start_bb1_in> [v__0 ~=> v__1 ,v__1 ~=> v__0 ,v_flag_1 ~=> v_flag_0 ,K ~=> v_flag_0 ,K ~=> v_flag_1 ,v__0 ~+> v__0 ,v__0 ~+> v__1 ,v__0 ~+> 0.0 ,v__0 ~+> tick ,v__1 ~+> v__0 ,v__1 ~+> v__1 ,v__1 ~+> 0.0 ,v__1 ~+> tick ,v_flag_0 ~+> 0.0.0 ,v_flag_0 ~+> tick ,v_flag_1 ~+> 0.0.0 ,v_flag_1 ~+> tick ,tick ~+> tick ,K ~+> v__0 ,K ~+> v__1 ,K ~+> 0.0.0 ,K ~+> tick ,v__0 ~*> v__0 ,v__0 ~*> v__1 ,v__0 ~*> tick ,v__1 ~*> v__0 ,v__1 ~*> v__1 ,v__1 ~*> tick ,v_flag_0 ~*> tick ,v_flag_1 ~*> 0.0.0 ,v_flag_1 ~*> tick ,K ~*> v__0 ,K ~*> v__1 ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] + eval_start_bb2_in> [v__1 ~=> v__0 ,v_flag_1 ~=> v_flag_0 ,K ~=> v_flag_0 ,K ~=> v_flag_1 ,v_flag_0 ~+> 0.0.0 ,v_flag_0 ~+> tick ,v_flag_1 ~+> 0.0.0 ,v_flag_1 ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] eval_start_bb1_in> [v__1 ~=> v__0 ,v_flag_1 ~=> v_flag_0 ,K ~=> v_flag_0 ,K ~=> v_flag_1 ,v_flag_0 ~+> 0.0.0 ,v_flag_0 ~+> tick ,v_flag_1 ~+> 0.0.0 ,v_flag_1 ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] eval_start_bb2_in> [v__0 ~=> v__1 ,K ~=> v_flag_0 ,K ~=> v_flag_1 ,v_flag_0 ~+> 0.0.0 ,v_flag_0 ~+> tick ,v_flag_1 ~+> 0.0.0 ,v_flag_1 ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] eval_start_bb1_in> [v__0 ~=> v__1 ,K ~=> v_flag_0 ,K ~=> v_flag_1 ,v_flag_0 ~+> 0.0.0 ,v_flag_0 ~+> tick ,v_flag_1 ~+> 0.0.0 ,v_flag_1 ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] YES(?,POLY)