
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    l0(Ar_0, Ar_1, Ar_2) -> Com_1(l1(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1, Ar_2) -> Com_1(l1(Ar_0 + Ar_1 + Ar_2, -Ar_2 - 1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 + Ar_1 >= 0 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(l0(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)    l0(Ar_0, Ar_1, Ar_2) -> Com_1(l1(Ar_0, Ar_1, Ar_2))
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1, Ar_2) -> Com_1(l1(Ar_0 + Ar_1 + Ar_2, -Ar_2 - 1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 + Ar_1 >= 0 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(l0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(l0) = V_1 + V_2 + 1
	Pol(l1) = V_1 + V_2 + 1
	Pol(koat_start) = V_1 + V_2 + 1
orients all transitions weakly and the transition
	l1(Ar_0, Ar_1, Ar_2) -> Com_1(l1(Ar_0 + Ar_1 + Ar_2, -Ar_2 - 1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 + Ar_1 >= 0 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)                  l0(Ar_0, Ar_1, Ar_2) -> Com_1(l1(Ar_0, Ar_1, Ar_2))
		(Comp: Ar_0 + Ar_1 + 1, Cost: 1)    l1(Ar_0, Ar_1, Ar_2) -> Com_1(l1(Ar_0 + Ar_1 + Ar_2, -Ar_2 - 1, Ar_2)) [ Ar_0 >= 0 /\ Ar_0 + Ar_1 >= 0 ]
		(Comp: 1, Cost: 0)                  koat_start(Ar_0, Ar_1, Ar_2) -> Com_1(l0(Ar_0, Ar_1, Ar_2)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound Ar_0 + Ar_1 + 2

Time: 0.033 sec (SMT: 0.031 sec)
