WORST_CASE(?, O(n^1))

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_start(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb0_in(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_bb0_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_0(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_0(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_1(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_1(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_2(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_2(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_3(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_3(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_4(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_4(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb1_in(Ar_0, 0))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_bb1_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb2_in(Ar_0, Ar_1)) [ Ar_1 < Ar_0 ]
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_bb1_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb3_in(Ar_0, Ar_1)) [ Ar_1 >= Ar_0 ]
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_bb2_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_5(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_5(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_6(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_6(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb1_in(Ar_0, Ar_1 + 1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_bb3_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_stop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_start(Ar_0, Ar_1)) [ 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_speedSingleSingle_start(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb0_in(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_bb0_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_0(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_0(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_1(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_1(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_2(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_2(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_3(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_3(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_4(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_4(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb1_in(Ar_0, 0))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_bb1_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb2_in(Ar_0, Ar_1)) [ Ar_1 < Ar_0 ]
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_bb1_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb3_in(Ar_0, Ar_1)) [ Ar_1 >= Ar_0 ]
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_bb2_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_5(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_5(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_6(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_6(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb1_in(Ar_0, Ar_1 + 1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_bb3_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_stop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_start(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_speedSingleSingle_start) = 2
	Pol(eval_speedSingleSingle_bb0_in) = 2
	Pol(eval_speedSingleSingle_0) = 2
	Pol(eval_speedSingleSingle_1) = 2
	Pol(eval_speedSingleSingle_2) = 2
	Pol(eval_speedSingleSingle_3) = 2
	Pol(eval_speedSingleSingle_4) = 2
	Pol(eval_speedSingleSingle_bb1_in) = 2
	Pol(eval_speedSingleSingle_bb2_in) = 2
	Pol(eval_speedSingleSingle_bb3_in) = 1
	Pol(eval_speedSingleSingle_5) = 2
	Pol(eval_speedSingleSingle_6) = 2
	Pol(eval_speedSingleSingle_stop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	eval_speedSingleSingle_bb3_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_stop(Ar_0, Ar_1))
	eval_speedSingleSingle_bb1_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb3_in(Ar_0, Ar_1)) [ Ar_1 >= Ar_0 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_start(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb0_in(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_bb0_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_0(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_0(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_1(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_1(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_2(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_2(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_3(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_3(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_4(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_speedSingleSingle_4(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb1_in(Ar_0, 0))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_bb1_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb2_in(Ar_0, Ar_1)) [ Ar_1 < Ar_0 ]
		(Comp: 2, Cost: 1)    eval_speedSingleSingle_bb1_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb3_in(Ar_0, Ar_1)) [ Ar_1 >= Ar_0 ]
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_bb2_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_5(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_5(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_6(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_speedSingleSingle_6(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb1_in(Ar_0, Ar_1 + 1))
		(Comp: 2, Cost: 1)    eval_speedSingleSingle_bb3_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_stop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_start(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_speedSingleSingle_start) = 4*V_1 + 1
	Pol(eval_speedSingleSingle_bb0_in) = 4*V_1 + 1
	Pol(eval_speedSingleSingle_0) = 4*V_1 + 1
	Pol(eval_speedSingleSingle_1) = 4*V_1 + 1
	Pol(eval_speedSingleSingle_2) = 4*V_1 + 1
	Pol(eval_speedSingleSingle_3) = 4*V_1 + 1
	Pol(eval_speedSingleSingle_4) = 4*V_1 + 1
	Pol(eval_speedSingleSingle_bb1_in) = 4*V_1 - 4*V_2 + 1
	Pol(eval_speedSingleSingle_bb2_in) = 4*V_1 - 4*V_2
	Pol(eval_speedSingleSingle_bb3_in) = 4*V_1 - 4*V_2 + 1
	Pol(eval_speedSingleSingle_5) = 4*V_1 - 4*V_2 - 1
	Pol(eval_speedSingleSingle_6) = 4*V_1 - 4*V_2 - 2
	Pol(eval_speedSingleSingle_stop) = 4*V_1 - 4*V_2 + 1
	Pol(koat_start) = 4*V_1 + 1
orients all transitions weakly and the transition
	eval_speedSingleSingle_bb1_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb2_in(Ar_0, Ar_1)) [ Ar_1 < Ar_0 ]
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_start(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb0_in(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_bb0_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_0(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_0(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_1(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_1(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_2(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_2(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_3(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_3(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_4(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_4(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb1_in(Ar_0, 0))
		(Comp: 4*Ar_0 + 1, Cost: 1)    eval_speedSingleSingle_bb1_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb2_in(Ar_0, Ar_1)) [ Ar_1 < Ar_0 ]
		(Comp: 2, Cost: 1)             eval_speedSingleSingle_bb1_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb3_in(Ar_0, Ar_1)) [ Ar_1 >= Ar_0 ]
		(Comp: ?, Cost: 1)             eval_speedSingleSingle_bb2_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_5(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)             eval_speedSingleSingle_5(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_6(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)             eval_speedSingleSingle_6(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb1_in(Ar_0, Ar_1 + 1))
		(Comp: 2, Cost: 1)             eval_speedSingleSingle_bb3_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_stop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)             koat_start(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_start(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 4 produces the following problem:
5:	T:
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_start(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb0_in(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_bb0_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_0(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_0(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_1(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_1(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_2(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_2(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_3(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_3(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_4(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)             eval_speedSingleSingle_4(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb1_in(Ar_0, 0))
		(Comp: 4*Ar_0 + 1, Cost: 1)    eval_speedSingleSingle_bb1_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb2_in(Ar_0, Ar_1)) [ Ar_1 < Ar_0 ]
		(Comp: 2, Cost: 1)             eval_speedSingleSingle_bb1_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb3_in(Ar_0, Ar_1)) [ Ar_1 >= Ar_0 ]
		(Comp: 4*Ar_0 + 1, Cost: 1)    eval_speedSingleSingle_bb2_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_5(Ar_0, Ar_1))
		(Comp: 4*Ar_0 + 1, Cost: 1)    eval_speedSingleSingle_5(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_6(Ar_0, Ar_1))
		(Comp: 4*Ar_0 + 1, Cost: 1)    eval_speedSingleSingle_6(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_bb1_in(Ar_0, Ar_1 + 1))
		(Comp: 2, Cost: 1)             eval_speedSingleSingle_bb3_in(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_stop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)             koat_start(Ar_0, Ar_1) -> Com_1(eval_speedSingleSingle_start(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 16*Ar_0 + 15

Time: 0.617 sec (SMT: 0.586 sec)