NO * Step 1: TrivialSCCs NO + Considered Problem: Rules: 0. eval_speedFails2_start(v_i_0,v_n,v_x) -> eval_speedFails2_bb0_in(v_i_0,v_n,v_x) True (1,1) 1. eval_speedFails2_bb0_in(v_i_0,v_n,v_x) -> eval_speedFails2_0(v_i_0,v_n,v_x) True (?,1) 2. eval_speedFails2_0(v_i_0,v_n,v_x) -> eval_speedFails2_1(v_i_0,v_n,v_x) True (?,1) 3. eval_speedFails2_1(v_i_0,v_n,v_x) -> eval_speedFails2_2(v_i_0,v_n,v_x) True (?,1) 4. eval_speedFails2_2(v_i_0,v_n,v_x) -> eval_speedFails2_3(v_i_0,v_n,v_x) True (?,1) 5. eval_speedFails2_3(v_i_0,v_n,v_x) -> eval_speedFails2_4(v_i_0,v_n,v_x) True (?,1) 6. eval_speedFails2_4(v_i_0,v_n,v_x) -> eval_speedFails2_bb1_in(v_x,v_n,v_x) True (?,1) 7. eval_speedFails2_bb1_in(v_i_0,v_n,v_x) -> eval_speedFails2_bb2_in(v_i_0,v_n,v_x) [v_i_0 + -1*v_x >= 0 && -1 + v_n >= v_i_0] (?,1) 8. eval_speedFails2_bb1_in(v_i_0,v_n,v_x) -> eval_speedFails2_bb2_in(v_i_0,v_n,v_x) [v_i_0 + -1*v_x >= 0 && -1 + v_i_0 >= v_n] (?,1) 9. eval_speedFails2_bb1_in(v_i_0,v_n,v_x) -> eval_speedFails2_bb3_in(v_i_0,v_n,v_x) [v_i_0 + -1*v_x >= 0 && v_i_0 = v_n] (?,1) 10. eval_speedFails2_bb2_in(v_i_0,v_n,v_x) -> eval_speedFails2_bb1_in(1 + v_i_0,v_n,v_x) [v_i_0 + -1*v_x >= 0] (?,1) 11. eval_speedFails2_bb3_in(v_i_0,v_n,v_x) -> eval_speedFails2_stop(v_i_0,v_n,v_x) [v_n + -1*v_x >= 0 && v_i_0 + -1*v_x >= 0 && v_i_0 + -1*v_n >= 0 && -1*v_i_0 + v_n >= 0] (?,1) Signature: {(eval_speedFails2_0,3) ;(eval_speedFails2_1,3) ;(eval_speedFails2_2,3) ;(eval_speedFails2_3,3) ;(eval_speedFails2_4,3) ;(eval_speedFails2_bb0_in,3) ;(eval_speedFails2_bb1_in,3) ;(eval_speedFails2_bb2_in,3) ;(eval_speedFails2_bb3_in,3) ;(eval_speedFails2_start,3) ;(eval_speedFails2_stop,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7,8,9},7->{10},8->{10},9->{11},10->{7,8,9},11->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: Looptree NO + Considered Problem: Rules: 0. eval_speedFails2_start(v_i_0,v_n,v_x) -> eval_speedFails2_bb0_in(v_i_0,v_n,v_x) True (1,1) 1. eval_speedFails2_bb0_in(v_i_0,v_n,v_x) -> eval_speedFails2_0(v_i_0,v_n,v_x) True (1,1) 2. eval_speedFails2_0(v_i_0,v_n,v_x) -> eval_speedFails2_1(v_i_0,v_n,v_x) True (1,1) 3. eval_speedFails2_1(v_i_0,v_n,v_x) -> eval_speedFails2_2(v_i_0,v_n,v_x) True (1,1) 4. eval_speedFails2_2(v_i_0,v_n,v_x) -> eval_speedFails2_3(v_i_0,v_n,v_x) True (1,1) 5. eval_speedFails2_3(v_i_0,v_n,v_x) -> eval_speedFails2_4(v_i_0,v_n,v_x) True (1,1) 6. eval_speedFails2_4(v_i_0,v_n,v_x) -> eval_speedFails2_bb1_in(v_x,v_n,v_x) True (1,1) 7. eval_speedFails2_bb1_in(v_i_0,v_n,v_x) -> eval_speedFails2_bb2_in(v_i_0,v_n,v_x) [v_i_0 + -1*v_x >= 0 && -1 + v_n >= v_i_0] (?,1) 8. eval_speedFails2_bb1_in(v_i_0,v_n,v_x) -> eval_speedFails2_bb2_in(v_i_0,v_n,v_x) [v_i_0 + -1*v_x >= 0 && -1 + v_i_0 >= v_n] (?,1) 9. eval_speedFails2_bb1_in(v_i_0,v_n,v_x) -> eval_speedFails2_bb3_in(v_i_0,v_n,v_x) [v_i_0 + -1*v_x >= 0 && v_i_0 = v_n] (1,1) 10. eval_speedFails2_bb2_in(v_i_0,v_n,v_x) -> eval_speedFails2_bb1_in(1 + v_i_0,v_n,v_x) [v_i_0 + -1*v_x >= 0] (?,1) 11. eval_speedFails2_bb3_in(v_i_0,v_n,v_x) -> eval_speedFails2_stop(v_i_0,v_n,v_x) [v_n + -1*v_x >= 0 && v_i_0 + -1*v_x >= 0 && v_i_0 + -1*v_n >= 0 && -1*v_i_0 + v_n >= 0] (1,1) Signature: {(eval_speedFails2_0,3) ;(eval_speedFails2_1,3) ;(eval_speedFails2_2,3) ;(eval_speedFails2_3,3) ;(eval_speedFails2_4,3) ;(eval_speedFails2_bb0_in,3) ;(eval_speedFails2_bb1_in,3) ;(eval_speedFails2_bb2_in,3) ;(eval_speedFails2_bb3_in,3) ;(eval_speedFails2_start,3) ;(eval_speedFails2_stop,3)} Flow Graph: [0->{1},1->{2},2->{3},3->{4},4->{5},5->{6},6->{7,8,9},7->{10},8->{10},9->{11},10->{7,8,9},11->{}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11] | `- p:[7,10,8] c: [7] | `- p:[8,10] c: [] NO