WORST_CASE(?, O(1))

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f5(Ar_0, 0, Ar_2)) [ Ar_0 >= 128 ]
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f7(Ar_0, 0, Fresh_0)) [ 127 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f7(Ar_0, Ar_1, Ar_2) -> Com_1(f7(Ar_0, Ar_1 + 1, Ar_2 + 1)) [ 35 >= Ar_1 ]
		(Comp: ?, Cost: 1)    f7(Ar_0, Ar_1, Ar_2) -> Com_1(f5(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= 36 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 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)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f5(Ar_0, 0, Ar_2)) [ Ar_0 >= 128 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f7(Ar_0, 0, Fresh_0)) [ 127 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f7(Ar_0, Ar_1, Ar_2) -> Com_1(f7(Ar_0, Ar_1 + 1, Ar_2 + 1)) [ 35 >= Ar_1 ]
		(Comp: ?, Cost: 1)    f7(Ar_0, Ar_1, Ar_2) -> Com_1(f5(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= 36 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(f0) = 1
	Pol(f5) = 0
	Pol(f7) = 1
	Pol(koat_start) = 1
orients all transitions weakly and the transition
	f7(Ar_0, Ar_1, Ar_2) -> Com_1(f5(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= 36 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f5(Ar_0, 0, Ar_2)) [ Ar_0 >= 128 ]
		(Comp: 1, Cost: 1)    f0(Ar_0, Ar_1, Ar_2) -> Com_1(f7(Ar_0, 0, Fresh_0)) [ 127 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f7(Ar_0, Ar_1, Ar_2) -> Com_1(f7(Ar_0, Ar_1 + 1, Ar_2 + 1)) [ 35 >= Ar_1 ]
		(Comp: 1, Cost: 1)    f7(Ar_0, Ar_1, Ar_2) -> Com_1(f5(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= 36 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(f0) = 36
	Pol(f5) = -V_2
	Pol(f7) = -V_2 + 36
	Pol(koat_start) = 36
orients all transitions weakly and the transition
	f7(Ar_0, Ar_1, Ar_2) -> Com_1(f7(Ar_0, Ar_1 + 1, Ar_2 + 1)) [ 35 >= Ar_1 ]
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 1)     f0(Ar_0, Ar_1, Ar_2) -> Com_1(f5(Ar_0, 0, Ar_2)) [ Ar_0 >= 128 ]
		(Comp: 1, Cost: 1)     f0(Ar_0, Ar_1, Ar_2) -> Com_1(f7(Ar_0, 0, Fresh_0)) [ 127 >= Ar_0 ]
		(Comp: 36, Cost: 1)    f7(Ar_0, Ar_1, Ar_2) -> Com_1(f7(Ar_0, Ar_1 + 1, Ar_2 + 1)) [ 35 >= Ar_1 ]
		(Comp: 1, Cost: 1)     f7(Ar_0, Ar_1, Ar_2) -> Com_1(f5(Ar_0, Ar_1, Ar_2)) [ Ar_1 >= 36 ]
		(Comp: 1, Cost: 0)     koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(f0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 39

Time: 0.495 sec (SMT: 0.482 sec)