
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1))
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ Ar_1 + 889 >= 0 /\ 1999 >= Ar_0 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(f0(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 1:
	f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0, Ar_1 + 1000)) [ Ar_1 + 889 >= 0 /\ 1999 >= Ar_0 ]
We thus obtain the following problem:
2:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(f0(Ar_0, Ar_1)) [ 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)    f0(Ar_0, Ar_1) -> Com_1(f1(3000, Ar_1))
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(f0(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound 1

Time: 0.004 sec (SMT: 0.004 sec)
