WORST_CASE(?, O(1))

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    eval_nd_loop_start(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb0_in(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_nd_loop_bb0_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_0(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_nd_loop_0(Ar_0, Ar_1) -> Com_1(eval_nd_loop_1(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_nd_loop_1(Ar_0, Ar_1) -> Com_1(eval_nd_loop_2(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_nd_loop_2(Ar_0, Ar_1) -> Com_1(eval_nd_loop_3(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_nd_loop_3(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb1_in(Ar_0, 0))
		(Comp: ?, Cost: 1)    eval_nd_loop_bb1_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_4(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_nd_loop_4(Ar_0, Ar_1) -> Com_1(eval_nd_loop_5(Fresh_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb1_in(Ar_0, Ar_0)) [ Ar_0 - Ar_1 <= 2 /\ Ar_0 - Ar_1 >= 1 /\ Ar_0 < 10 ]
		(Comp: ?, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 - Ar_1 > 2 ]
		(Comp: ?, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 - Ar_1 < 1 ]
		(Comp: ?, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 >= 10 ]
		(Comp: ?, Cost: 1)    eval_nd_loop_bb2_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_stop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(eval_nd_loop_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_nd_loop_start(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb0_in(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_nd_loop_bb0_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_0(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_nd_loop_0(Ar_0, Ar_1) -> Com_1(eval_nd_loop_1(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_nd_loop_1(Ar_0, Ar_1) -> Com_1(eval_nd_loop_2(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_nd_loop_2(Ar_0, Ar_1) -> Com_1(eval_nd_loop_3(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_nd_loop_3(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb1_in(Ar_0, 0))
		(Comp: ?, Cost: 1)    eval_nd_loop_bb1_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_4(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_nd_loop_4(Ar_0, Ar_1) -> Com_1(eval_nd_loop_5(Fresh_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb1_in(Ar_0, Ar_0)) [ Ar_0 - Ar_1 <= 2 /\ Ar_0 - Ar_1 >= 1 /\ Ar_0 < 10 ]
		(Comp: ?, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 - Ar_1 > 2 ]
		(Comp: ?, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 - Ar_1 < 1 ]
		(Comp: ?, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 >= 10 ]
		(Comp: ?, Cost: 1)    eval_nd_loop_bb2_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_stop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(eval_nd_loop_start(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_nd_loop_start) = 2
	Pol(eval_nd_loop_bb0_in) = 2
	Pol(eval_nd_loop_0) = 2
	Pol(eval_nd_loop_1) = 2
	Pol(eval_nd_loop_2) = 2
	Pol(eval_nd_loop_3) = 2
	Pol(eval_nd_loop_bb1_in) = 2
	Pol(eval_nd_loop_4) = 2
	Pol(eval_nd_loop_5) = 2
	Pol(eval_nd_loop_bb2_in) = 1
	Pol(eval_nd_loop_stop) = 0
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	eval_nd_loop_bb2_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_stop(Ar_0, Ar_1))
	eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 - Ar_1 < 1 ]
	eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 - Ar_1 > 2 ]
	eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 >= 10 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    eval_nd_loop_start(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb0_in(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_nd_loop_bb0_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_0(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_nd_loop_0(Ar_0, Ar_1) -> Com_1(eval_nd_loop_1(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_nd_loop_1(Ar_0, Ar_1) -> Com_1(eval_nd_loop_2(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_nd_loop_2(Ar_0, Ar_1) -> Com_1(eval_nd_loop_3(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)    eval_nd_loop_3(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb1_in(Ar_0, 0))
		(Comp: ?, Cost: 1)    eval_nd_loop_bb1_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_4(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_nd_loop_4(Ar_0, Ar_1) -> Com_1(eval_nd_loop_5(Fresh_0, Ar_1))
		(Comp: ?, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb1_in(Ar_0, Ar_0)) [ Ar_0 - Ar_1 <= 2 /\ Ar_0 - Ar_1 >= 1 /\ Ar_0 < 10 ]
		(Comp: 2, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 - Ar_1 > 2 ]
		(Comp: 2, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 - Ar_1 < 1 ]
		(Comp: 2, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 >= 10 ]
		(Comp: 2, Cost: 1)    eval_nd_loop_bb2_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_stop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(eval_nd_loop_start(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(eval_nd_loop_start) = 27
	Pol(eval_nd_loop_bb0_in) = 27
	Pol(eval_nd_loop_0) = 27
	Pol(eval_nd_loop_1) = 27
	Pol(eval_nd_loop_2) = 27
	Pol(eval_nd_loop_3) = 27
	Pol(eval_nd_loop_bb1_in) = -3*V_2 + 27
	Pol(eval_nd_loop_4) = -3*V_2 + 26
	Pol(eval_nd_loop_5) = -3*V_2 + 25
	Pol(eval_nd_loop_bb2_in) = -3*V_2 + 25
	Pol(eval_nd_loop_stop) = -3*V_2 + 25
	Pol(koat_start) = 27
orients all transitions weakly and the transition
	eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb1_in(Ar_0, Ar_0)) [ Ar_0 - Ar_1 <= 2 /\ Ar_0 - Ar_1 >= 1 /\ Ar_0 < 10 ]
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 1)     eval_nd_loop_start(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb0_in(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)     eval_nd_loop_bb0_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_0(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)     eval_nd_loop_0(Ar_0, Ar_1) -> Com_1(eval_nd_loop_1(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)     eval_nd_loop_1(Ar_0, Ar_1) -> Com_1(eval_nd_loop_2(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)     eval_nd_loop_2(Ar_0, Ar_1) -> Com_1(eval_nd_loop_3(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)     eval_nd_loop_3(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb1_in(Ar_0, 0))
		(Comp: ?, Cost: 1)     eval_nd_loop_bb1_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_4(Ar_0, Ar_1))
		(Comp: ?, Cost: 1)     eval_nd_loop_4(Ar_0, Ar_1) -> Com_1(eval_nd_loop_5(Fresh_0, Ar_1))
		(Comp: 27, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb1_in(Ar_0, Ar_0)) [ Ar_0 - Ar_1 <= 2 /\ Ar_0 - Ar_1 >= 1 /\ Ar_0 < 10 ]
		(Comp: 2, Cost: 1)     eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 - Ar_1 > 2 ]
		(Comp: 2, Cost: 1)     eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 - Ar_1 < 1 ]
		(Comp: 2, Cost: 1)     eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 >= 10 ]
		(Comp: 2, Cost: 1)     eval_nd_loop_bb2_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_stop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)     koat_start(Ar_0, Ar_1) -> Com_1(eval_nd_loop_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_nd_loop_start(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb0_in(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)     eval_nd_loop_bb0_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_0(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)     eval_nd_loop_0(Ar_0, Ar_1) -> Com_1(eval_nd_loop_1(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)     eval_nd_loop_1(Ar_0, Ar_1) -> Com_1(eval_nd_loop_2(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)     eval_nd_loop_2(Ar_0, Ar_1) -> Com_1(eval_nd_loop_3(Ar_0, Ar_1))
		(Comp: 1, Cost: 1)     eval_nd_loop_3(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb1_in(Ar_0, 0))
		(Comp: 28, Cost: 1)    eval_nd_loop_bb1_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_4(Ar_0, Ar_1))
		(Comp: 28, Cost: 1)    eval_nd_loop_4(Ar_0, Ar_1) -> Com_1(eval_nd_loop_5(Fresh_0, Ar_1))
		(Comp: 27, Cost: 1)    eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb1_in(Ar_0, Ar_0)) [ Ar_0 - Ar_1 <= 2 /\ Ar_0 - Ar_1 >= 1 /\ Ar_0 < 10 ]
		(Comp: 2, Cost: 1)     eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 - Ar_1 > 2 ]
		(Comp: 2, Cost: 1)     eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 - Ar_1 < 1 ]
		(Comp: 2, Cost: 1)     eval_nd_loop_5(Ar_0, Ar_1) -> Com_1(eval_nd_loop_bb2_in(Ar_0, Ar_1)) [ Ar_0 >= 10 ]
		(Comp: 2, Cost: 1)     eval_nd_loop_bb2_in(Ar_0, Ar_1) -> Com_1(eval_nd_loop_stop(Ar_0, Ar_1))
		(Comp: 1, Cost: 0)     koat_start(Ar_0, Ar_1) -> Com_1(eval_nd_loop_start(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 97

Time: 0.611 sec (SMT: 0.575 sec)