MAYBE

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    eval_speedFails1_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    eval_speedFails1_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_0(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    eval_speedFails1_0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_1(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    eval_speedFails1_1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_2(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    eval_speedFails1_2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_3(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    eval_speedFails1_3(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_4(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    eval_speedFails1_4(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb1_in(Ar_1, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    eval_speedFails1_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 <= Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails1_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 > Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails1_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb1_in(Ar_0 + Ar_2, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    eval_speedFails1_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 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_speedFails1_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_0(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_1(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_2(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_3(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_3(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_4(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_4(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb1_in(Ar_1, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    eval_speedFails1_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 <= Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails1_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 > Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails1_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb1_in(Ar_0 + Ar_2, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    eval_speedFails1_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_speedFails1_start) = 2
	Pol(eval_speedFails1_bb0_in) = 2
	Pol(eval_speedFails1_0) = 2
	Pol(eval_speedFails1_1) = 2
	Pol(eval_speedFails1_2) = 2
	Pol(eval_speedFails1_3) = 2
	Pol(eval_speedFails1_4) = 2
	Pol(eval_speedFails1_bb1_in) = 2
	Pol(eval_speedFails1_bb2_in) = 2
	Pol(eval_speedFails1_bb3_in) = 1
	Pol(eval_speedFails1_stop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	eval_speedFails1_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_stop(Ar_0, Ar_1, Ar_2, Ar_3))
	eval_speedFails1_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 > Ar_3 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    eval_speedFails1_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_0(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_1(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_2(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_3(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_3(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_4(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_4(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb1_in(Ar_1, Ar_1, Ar_2, Ar_3))
		(Comp: ?, Cost: 1)    eval_speedFails1_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 <= Ar_3 ]
		(Comp: 2, Cost: 1)    eval_speedFails1_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 > Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails1_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb1_in(Ar_0 + Ar_2, Ar_1, Ar_2, Ar_3))
		(Comp: 2, Cost: 1)    eval_speedFails1_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_stop(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 3 to obtain the following invariants:
  For symbol eval_speedFails1_bb2_in: -X_1 + X_4 >= 0
  For symbol eval_speedFails1_bb3_in: X_1 - X_4 - 1 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_start(Ar_0, Ar_1, Ar_2, Ar_3)) [ 0 <= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails1_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_stop(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 - Ar_3 - 1 >= 0 ]
		(Comp: ?, Cost: 1)    eval_speedFails1_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb1_in(Ar_0 + Ar_2, Ar_1, Ar_2, Ar_3)) [ -Ar_0 + Ar_3 >= 0 ]
		(Comp: 2, Cost: 1)    eval_speedFails1_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 > Ar_3 ]
		(Comp: ?, Cost: 1)    eval_speedFails1_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3)) [ Ar_0 <= Ar_3 ]
		(Comp: 1, Cost: 1)    eval_speedFails1_4(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb1_in(Ar_1, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_3(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_4(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_2(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_3(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_1(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_2(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_0(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_1(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_0(Ar_0, Ar_1, Ar_2, Ar_3))
		(Comp: 1, Cost: 1)    eval_speedFails1_start(Ar_0, Ar_1, Ar_2, Ar_3) -> Com_1(eval_speedFails1_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3))
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 2.381 sec (SMT: 2.304 sec)