WORST_CASE(?, O(1))

Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 1 ]
		(Comp: ?, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 2 ]
		(Comp: ?, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 4 ]
		(Comp: ?, Cost: 1)    a(Ar_0) -> Com_1(a(Ar_0*Fresh_0)) [ 1 >= 2*Fresh_0 /\ 3*Fresh_0 >= 2 /\ Ar_0 >= 2 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(start(Ar_0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 1:
	a(Ar_0) -> Com_1(a(Ar_0*Fresh_0)) [ 1 >= 2*Fresh_0 /\ 3*Fresh_0 >= 2 /\ Ar_0 >= 2 ]
We thus obtain the following problem:
2:	T:
		(Comp: ?, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 4 ]
		(Comp: ?, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 2 ]
		(Comp: ?, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(start(Ar_0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 2 produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 4 ]
		(Comp: 1, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 2 ]
		(Comp: 1, Cost: 1)    start(Ar_0) -> Com_1(a(Ar_0)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(start(Ar_0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 3

Time: 0.132 sec (SMT: 0.130 sec)