
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_3, Ar_4, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_1 ]
		(Comp: ?, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 > 0 ]
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0 - 1, Ar_1 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 > 0 /\ Ar_2 <= 0 ]
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 <= 0 /\ Ar_2 > 0 ]
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0 - 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 <= 0 ]
		(Comp: ?, Cost: 1)    eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_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_start_start(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 transitions from problem 1:
	eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0 - 1, Ar_1 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 > 0 /\ Ar_2 <= 0 ]
	eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 <= 0 /\ Ar_2 > 0 ]
We thus obtain the following problem:
2:	T:
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0 - 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 <= 0 ]
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 > 0 ]
		(Comp: ?, Cost: 1)    eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_1 ]
		(Comp: ?, Cost: 1)    eval_start_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_3, Ar_4, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(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_start_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 2 produces the following problem:
3:	T:
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0 - 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 <= 0 ]
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 > 0 ]
		(Comp: ?, Cost: 1)    eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_1 ]
		(Comp: 1, Cost: 1)    eval_start_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_3, Ar_4, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(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_start_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_start_6) = 2
	Pol(eval_start_bb1_in) = 2
	Pol(eval_start_5) = 2
	Pol(eval_start_bb3_in) = 1
	Pol(eval_start_stop) = 0
	Pol(eval_start_bb2_in) = 2
	Pol(eval_start_4) = 2
	Pol(eval_start_3) = 2
	Pol(eval_start_2) = 2
	Pol(eval_start_1) = 2
	Pol(eval_start_0) = 2
	Pol(eval_start_bb0_in) = 2
	Pol(eval_start_start) = 2
	Pol(koat_start) = 2
orients all transitions weakly and the transitions
	eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
	eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= Ar_1 ]
strictly and produces the following problem:
4:	T:
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0 - 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 <= 0 ]
		(Comp: ?, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 > 0 ]
		(Comp: ?, Cost: 1)    eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 2, Cost: 1)    eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 2, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= Ar_1 ]
		(Comp: ?, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_1 ]
		(Comp: 1, Cost: 1)    eval_start_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_3, Ar_4, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)    eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(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_start_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_start_6) = V_1 - V_2 - 1
	Pol(eval_start_bb1_in) = V_1 - V_2
	Pol(eval_start_5) = V_1 - V_2 - 1
	Pol(eval_start_bb3_in) = V_1 - V_2
	Pol(eval_start_stop) = V_1 - V_2
	Pol(eval_start_bb2_in) = V_1 - V_2 - 1
	Pol(eval_start_4) = V_4 - V_5
	Pol(eval_start_3) = V_4 - V_5
	Pol(eval_start_2) = V_4 - V_5
	Pol(eval_start_1) = V_4 - V_5
	Pol(eval_start_0) = V_4 - V_5
	Pol(eval_start_bb0_in) = V_4 - V_5
	Pol(eval_start_start) = V_4 - V_5
	Pol(koat_start) = V_4 - V_5
orients all transitions weakly and the transition
	eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_1 ]
strictly and produces the following problem:
5:	T:
		(Comp: ?, Cost: 1)              eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0 - 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 <= 0 ]
		(Comp: ?, Cost: 1)              eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 > 0 ]
		(Comp: ?, Cost: 1)              eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 2, Cost: 1)              eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: ?, Cost: 1)              eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 2, Cost: 1)              eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= Ar_1 ]
		(Comp: Ar_3 + Ar_4, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_1 ]
		(Comp: 1, Cost: 1)              eval_start_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_3, Ar_4, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)              eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)              eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)              eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)              eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)              eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)              eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(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_start_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 5 produces the following problem:
6:	T:
		(Comp: Ar_3 + Ar_4, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0 - 1, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_2 <= 0 ]
		(Comp: Ar_3 + Ar_4, Cost: 1)    eval_start_6(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_0, Ar_1 + 1, Ar_2, Ar_3, Ar_4)) [ Ar_2 > 0 ]
		(Comp: Ar_3 + Ar_4, Cost: 1)    eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_6(Ar_0, Ar_1, Fresh_0, Ar_3, Ar_4))
		(Comp: 2, Cost: 1)              eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_stop(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: Ar_3 + Ar_4, Cost: 1)    eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_5(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 2, Cost: 1)              eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb3_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 <= Ar_1 ]
		(Comp: Ar_3 + Ar_4, Cost: 1)    eval_start_bb1_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb2_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ Ar_0 > Ar_1 ]
		(Comp: 1, Cost: 1)              eval_start_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb1_in(Ar_3, Ar_4, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)              eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)              eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)              eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)              eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)              eval_start_bb0_in(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
		(Comp: 1, Cost: 1)              eval_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(eval_start_bb0_in(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_start_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 5*Ar_3 + 5*Ar_4 + 11

Time: 0.056 sec (SMT: 0.043 sec)
