
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    eval_speedFails4_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 <= Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 > Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 1 produces the following problem:
2:	T:
		(Comp: 1, Cost: 1)    eval_speedFails4_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 2, Cost: 1)    eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 2, Cost: 1)    eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 <= Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 > Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_speedFails4_start) = 2
	Pol(eval_speedFails4_bb0_in) = 2
	Pol(eval_speedFails4_1) = 2
	Pol(eval_speedFails4_2) = 2
	Pol(eval_speedFails4_3) = 2
	Pol(eval_speedFails4_4) = 2
	Pol(eval_speedFails4_5) = 2
	Pol(eval_speedFails4_6) = 2
	Pol(eval_speedFails4_7) = 2
	Pol(eval_speedFails4_bb1_in) = 2
	Pol(eval_speedFails4_bb2_in) = 2
	Pol(eval_speedFails4_bb3_in) = 1
	Pol(eval_speedFails4_stop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
	eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 > Ar_3 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    eval_speedFails4_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 2, Cost: 1)    eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 2, Cost: 1)    eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 <= Ar_3 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 > Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 3 to obtain the following invariants:
  For symbol eval_speedFails4_5: -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol eval_speedFails4_6: -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol eval_speedFails4_7: -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol eval_speedFails4_bb1_in: -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol eval_speedFails4_bb2_in: -X_2 + X_4 >= 0 /\ -X_1 + 1 >= 0 /\ X_1 + 1 >= 0
  For symbol eval_speedFails4_bb3_in: X_2 - X_4 - 1 >= 0 /\ -X_1 + 1 >= 0 /\ X_1 + 1 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 - Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] with all transitions in problem 4, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
We thus obtain the following problem:
5:	T:
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 - Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 5:
	eval_speedFails4_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
6:	T:
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 - Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 ] with all transitions in problem 6, the following new transition is obtained:
	eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
We thus obtain the following problem:
7:	T:
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 - Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 7:
	eval_speedFails4_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_1 - Ar_3 - 1 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
We thus obtain the following problem:
8:	T:
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ] with all transitions in problem 8, the following new transition is obtained:
	eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
We thus obtain the following problem:
9:	T:
		(Comp: 2, Cost: 2)    eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 9:
	eval_speedFails4_7(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
We thus obtain the following problem:
10:	T:
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ] with all transitions in problem 10, the following new transition is obtained:
	eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
We thus obtain the following problem:
11:	T:
		(Comp: 2, Cost: 3)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 11:
	eval_speedFails4_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
We thus obtain the following problem:
12:	T:
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 2, Cost: 3)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 ] with all transitions in problem 12, the following new transition is obtained:
	eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
We thus obtain the following problem:
13:	T:
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 2, Cost: 3)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_5(-1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 ] with all transitions in problem 13, the following new transition is obtained:
	eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
We thus obtain the following problem:
14:	T:
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 2, Cost: 3)    eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 14:
	eval_speedFails4_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_4, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 ]
We thus obtain the following problem:
15:	T:
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) with all transitions in problem 15, the following new transition is obtained:
	eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
16:	T:
		(Comp: 1, Cost: 2)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 1)    eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 16:
	eval_speedFails4_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
17:	T:
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 2)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) with all transitions in problem 17, the following new transition is obtained:
	eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
18:	T:
		(Comp: 1, Cost: 3)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 2)    eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 18:
	eval_speedFails4_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
19:	T:
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 3)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_1(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4)) with all transitions in problem 19, the following new transition is obtained:
	eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
We thus obtain the following problem:
20:	T:
		(Comp: 1, Cost: 4)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 3)    eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 20:
	eval_speedFails4_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
We thus obtain the following problem:
21:	T:
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ] with all transitions in problem 21, the following new transition is obtained:
	koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4)) [ 0 <= 0 ]
We thus obtain the following problem:
22:	T:
		(Comp: 1, Cost: 5)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 22:
	eval_speedFails4_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
We thus obtain the following problem:
23:	T:
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 5)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 ] with all transitions in problem 23, the following new transitions are obtained:
	eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 > Ar_3 /\ Ar_1 + Ar_0 - Ar_3 - 1 >= 0 ]
	eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 <= Ar_3 ]
We thus obtain the following problem:
24:	T:
		(Comp: ?, Cost: 3)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 > Ar_3 /\ Ar_1 + Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 <= Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 5)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_speedFails4_bb2_in) = 1
	Pol(eval_speedFails4_stop) = 0
	Pol(eval_speedFails4_bb1_in) = 1
	Pol(eval_speedFails4_4) = 1
	Pol(koat_start) = 1
orients all transitions weakly and the transition
	eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 > Ar_3 /\ Ar_1 + Ar_0 - Ar_3 - 1 >= 0 ]
strictly and produces the following problem:
25:	T:
		(Comp: 1, Cost: 3)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 > Ar_3 /\ Ar_1 + Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 <= Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 5)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 ] with all transitions in problem 25, the following new transitions are obtained:
	eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 > Ar_3 /\ Ar_1 - Ar_0 - Ar_3 - 1 >= 0 ]
	eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 <= Ar_3 ]
We thus obtain the following problem:
26:	T:
		(Comp: ?, Cost: 3)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 > Ar_3 /\ Ar_1 - Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 <= Ar_3 ]
		(Comp: 1, Cost: 3)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 > Ar_3 /\ Ar_1 + Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 <= Ar_3 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 5)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 26 produces the following problem:
27:	T:
		(Comp: ?, Cost: 3)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 > Ar_3 /\ Ar_1 - Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 <= Ar_3 ]
		(Comp: 1, Cost: 3)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 > Ar_3 /\ Ar_1 + Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 <= Ar_3 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 5)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_speedFails4_bb2_in) = 1
	Pol(eval_speedFails4_stop) = 0
	Pol(eval_speedFails4_bb1_in) = 1
	Pol(eval_speedFails4_4) = 1
	Pol(koat_start) = 1
orients all transitions weakly and the transition
	eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 > Ar_3 /\ Ar_1 - Ar_0 - Ar_3 - 1 >= 0 ]
strictly and produces the following problem:
28:	T:
		(Comp: 1, Cost: 3)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 > Ar_3 /\ Ar_1 - Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 <= Ar_3 ]
		(Comp: 1, Cost: 3)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 > Ar_3 /\ Ar_1 + Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 <= Ar_3 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 5)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 ] with all transitions in problem 28, the following new transitions are obtained:
	eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 > Ar_3 /\ Ar_4 - Ar_3 - 1 >= 0 ]
	eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 ]
We thus obtain the following problem:
29:	T:
		(Comp: 1, Cost: 6)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 > Ar_3 /\ Ar_4 - Ar_3 - 1 >= 0 ]
		(Comp: 1, Cost: 5)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 ]
		(Comp: 1, Cost: 3)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 > Ar_3 /\ Ar_1 - Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 <= Ar_3 ]
		(Comp: 1, Cost: 3)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 > Ar_3 /\ Ar_1 + Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 <= Ar_3 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 5)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 ] with all transitions in problem 29, the following new transitions are obtained:
	eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(-1, Ar_4 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 /\ -Ar_4 + Ar_3 >= 0 /\ Ar_4 + 1 <= Ar_3 ]
	eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(-1, Ar_4 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 /\ -Ar_4 + Ar_3 >= 0 /\ Ar_4 + 1 > Ar_3 /\ Ar_4 - Ar_3 >= 0 ]
We thus obtain the following problem:
30:	T:
		(Comp: 1, Cost: 7)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(-1, Ar_4 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 /\ -Ar_4 + Ar_3 >= 0 /\ Ar_4 + 1 <= Ar_3 ]
		(Comp: 1, Cost: 8)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(-1, Ar_4 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 /\ -Ar_4 + Ar_3 >= 0 /\ Ar_4 + 1 > Ar_3 /\ Ar_4 - Ar_3 >= 0 ]
		(Comp: 1, Cost: 6)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 > Ar_3 /\ Ar_4 - Ar_3 - 1 >= 0 ]
		(Comp: 1, Cost: 3)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 > Ar_3 /\ Ar_1 - Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 <= Ar_3 ]
		(Comp: 1, Cost: 3)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 > Ar_3 /\ Ar_1 + Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)    eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 <= Ar_3 ]
		(Comp: 2, Cost: 2)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 5)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(-1, Ar_4 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 /\ -Ar_4 + Ar_3 >= 0 /\ Ar_4 + 1 <= Ar_3 ] with all transitions in problem 30, the following new transitions are obtained:
	eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(-1, Ar_4 + 2, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 /\ -Ar_4 + Ar_3 >= 0 /\ Ar_4 + 1 <= Ar_3 /\ -Ar_4 + Ar_3 - 1 >= 0 /\ Ar_4 + 2 <= Ar_3 ]
	eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(-1, Ar_4 + 2, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 /\ -Ar_4 + Ar_3 >= 0 /\ Ar_4 + 1 <= Ar_3 /\ -Ar_4 + Ar_3 - 1 >= 0 /\ Ar_4 + 2 > Ar_3 /\ Ar_4 - Ar_3 + 1 >= 0 ]
We thus obtain the following problem:
31:	T:
		(Comp: 1, Cost: 9)     eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(-1, Ar_4 + 2, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 /\ -Ar_4 + Ar_3 >= 0 /\ Ar_4 + 1 <= Ar_3 /\ -Ar_4 + Ar_3 - 1 >= 0 /\ Ar_4 + 2 <= Ar_3 ]
		(Comp: 1, Cost: 10)    eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(-1, Ar_4 + 2, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 /\ -Ar_4 + Ar_3 >= 0 /\ Ar_4 + 1 <= Ar_3 /\ -Ar_4 + Ar_3 - 1 >= 0 /\ Ar_4 + 2 > Ar_3 /\ Ar_4 - Ar_3 + 1 >= 0 ]
		(Comp: 1, Cost: 8)     eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(-1, Ar_4 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 <= Ar_3 /\ -Ar_4 + Ar_3 >= 0 /\ Ar_4 + 1 > Ar_3 /\ Ar_4 - Ar_3 >= 0 ]
		(Comp: 1, Cost: 6)     eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(-1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 < 1 /\ 2 >= 0 /\ 0 >= 0 /\ Ar_4 > Ar_3 /\ Ar_4 - Ar_3 - 1 >= 0 ]
		(Comp: 1, Cost: 3)     eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 > Ar_3 /\ Ar_1 - Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)     eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 - Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 < 1 /\ Ar_1 - Ar_0 <= Ar_3 ]
		(Comp: 1, Cost: 3)     eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 > Ar_3 /\ Ar_1 + Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 2)     eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1 + Ar_0, Ar_2, Ar_3, Ar_4)) [ -Ar_1 + Ar_3 >= 0 /\ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_2 >= 1 /\ Ar_1 + Ar_0 <= Ar_3 ]
		(Comp: 2, Cost: 2)     eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 > Ar_3 /\ Ar_1 - Ar_3 - 1 >= 0 ]
		(Comp: 2, Cost: 1)     eval_speedFails4_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ -Ar_0 + 1 >= 0 /\ Ar_0 + 1 >= 0 /\ Ar_1 <= Ar_3 ]
		(Comp: 1, Cost: 4)     eval_speedFails4_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_bb1_in(1, Ar_4, Ar_2, Ar_3, Ar_4)) [ Ar_2 >= 1 /\ 0 >= 0 /\ 2 >= 0 ]
		(Comp: 1, Cost: 5)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_speedFails4_4(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.557 sec (SMT: 0.401 sec)
