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

A polynomial rank function with
	Pol(f20) = 1
	Pol(f1) = 1
	Pol(f30) = 0
	Pol(koat_start) = 1
orients all transitions weakly and the transition
	f1(Ar_0, Ar_1) -> Com_1(f30(Ar_0, Ar_1)) [ Ar_0 >= Ar_1 + 1 ]
strictly and produces the following problem:
3:	T:
		(Comp: 1, Cost: 1)    f20(Ar_0, Ar_1) -> Com_1(f1(0, 0))
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1))
		(Comp: 1, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f30(Ar_0, Ar_1)) [ Ar_0 >= Ar_1 + 1 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(f20(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 3 to obtain the following invariants:
  For symbol f1: X_1 - X_2 >= 0 /\ X_2 >= 0 /\ X_1 + X_2 >= 0 /\ -X_1 + X_2 >= 0 /\ X_1 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(f20(Ar_0, Ar_1)) [ 0 <= 0 ]
		(Comp: 1, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f30(Ar_0, Ar_1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_0 >= Ar_1 + 1 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    f20(Ar_0, Ar_1) -> Com_1(f1(0, 0))
	start location:	koat_start
	leaf cost:	0

Testing for unsatisfiable constraints removes the following transition from problem 4:
	f1(Ar_0, Ar_1) -> Com_1(f30(Ar_0, Ar_1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 /\ Ar_0 >= Ar_1 + 1 ]
We thus obtain the following problem:
5:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1) -> Com_1(f20(Ar_0, Ar_1)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    f20(Ar_0, Ar_1) -> Com_1(f1(0, 0))
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f20(Ar_0, Ar_1)) [ 0 <= 0 ] with all transitions in problem 5, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(0, 0)) [ 0 <= 0 ]
We thus obtain the following problem:
6:	T:
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(f1(0, 0)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    f20(Ar_0, Ar_1) -> Com_1(f1(0, 0))
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 6:
	f20(Ar_0, Ar_1) -> Com_1(f1(0, 0))
We thus obtain the following problem:
7:	T:
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
		(Comp: 1, Cost: 1)    koat_start(Ar_0, Ar_1) -> Com_1(f1(0, 0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(0, 0)) [ 0 <= 0 ] with all transitions in problem 7, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(1, 1)) [ 0 <= 0 /\ 0 >= 0 ]
We thus obtain the following problem:
8:	T:
		(Comp: 1, Cost: 2)    koat_start(Ar_0, Ar_1) -> Com_1(f1(1, 1)) [ 0 <= 0 /\ 0 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(1, 1)) [ 0 <= 0 /\ 0 >= 0 ] with all transitions in problem 8, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(2, 2)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 ]
We thus obtain the following problem:
9:	T:
		(Comp: 1, Cost: 3)    koat_start(Ar_0, Ar_1) -> Com_1(f1(2, 2)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(2, 2)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 ] with all transitions in problem 9, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(3, 3)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 ]
We thus obtain the following problem:
10:	T:
		(Comp: 1, Cost: 4)    koat_start(Ar_0, Ar_1) -> Com_1(f1(3, 3)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(3, 3)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 ] with all transitions in problem 10, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(4, 4)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 ]
We thus obtain the following problem:
11:	T:
		(Comp: 1, Cost: 5)    koat_start(Ar_0, Ar_1) -> Com_1(f1(4, 4)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(4, 4)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 ] with all transitions in problem 11, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(5, 5)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 ]
We thus obtain the following problem:
12:	T:
		(Comp: 1, Cost: 6)    koat_start(Ar_0, Ar_1) -> Com_1(f1(5, 5)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(5, 5)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 ] with all transitions in problem 12, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(6, 6)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 ]
We thus obtain the following problem:
13:	T:
		(Comp: 1, Cost: 7)    koat_start(Ar_0, Ar_1) -> Com_1(f1(6, 6)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(6, 6)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 ] with all transitions in problem 13, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(7, 7)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 ]
We thus obtain the following problem:
14:	T:
		(Comp: 1, Cost: 8)    koat_start(Ar_0, Ar_1) -> Com_1(f1(7, 7)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(7, 7)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 ] with all transitions in problem 14, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(8, 8)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 ]
We thus obtain the following problem:
15:	T:
		(Comp: 1, Cost: 9)    koat_start(Ar_0, Ar_1) -> Com_1(f1(8, 8)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 ]
		(Comp: ?, Cost: 1)    f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(8, 8)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 ] with all transitions in problem 15, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(9, 9)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 ]
We thus obtain the following problem:
16:	T:
		(Comp: 1, Cost: 10)    koat_start(Ar_0, Ar_1) -> Com_1(f1(9, 9)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 ]
		(Comp: ?, Cost: 1)     f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(9, 9)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 ] with all transitions in problem 16, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(10, 10)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 ]
We thus obtain the following problem:
17:	T:
		(Comp: 1, Cost: 11)    koat_start(Ar_0, Ar_1) -> Com_1(f1(10, 10)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 ]
		(Comp: ?, Cost: 1)     f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(10, 10)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 ] with all transitions in problem 17, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(11, 11)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 /\ 20 >= 0 ]
We thus obtain the following problem:
18:	T:
		(Comp: 1, Cost: 12)    koat_start(Ar_0, Ar_1) -> Com_1(f1(11, 11)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 /\ 20 >= 0 ]
		(Comp: ?, Cost: 1)     f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(11, 11)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 /\ 20 >= 0 ] with all transitions in problem 18, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(12, 12)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 /\ 20 >= 0 /\ 11 >= 0 /\ 22 >= 0 ]
We thus obtain the following problem:
19:	T:
		(Comp: 1, Cost: 13)    koat_start(Ar_0, Ar_1) -> Com_1(f1(12, 12)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 /\ 20 >= 0 /\ 11 >= 0 /\ 22 >= 0 ]
		(Comp: ?, Cost: 1)     f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(12, 12)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 /\ 20 >= 0 /\ 11 >= 0 /\ 22 >= 0 ] with all transitions in problem 19, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(13, 13)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 /\ 20 >= 0 /\ 11 >= 0 /\ 22 >= 0 /\ 24 >= 0 ]
We thus obtain the following problem:
20:	T:
		(Comp: 1, Cost: 14)    koat_start(Ar_0, Ar_1) -> Com_1(f1(13, 13)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 /\ 20 >= 0 /\ 11 >= 0 /\ 22 >= 0 /\ 24 >= 0 ]
		(Comp: ?, Cost: 1)     f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0, Ar_1) -> Com_1(f1(13, 13)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 /\ 20 >= 0 /\ 11 >= 0 /\ 22 >= 0 /\ 24 >= 0 ] with all transitions in problem 20, the following new transition is obtained:
	koat_start(Ar_0, Ar_1) -> Com_1(f1(14, 14)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 /\ 20 >= 0 /\ 11 >= 0 /\ 22 >= 0 /\ 24 >= 0 /\ 13 >= 0 /\ 26 >= 0 ]
We thus obtain the following problem:
21:	T:
		(Comp: 1, Cost: 15)    koat_start(Ar_0, Ar_1) -> Com_1(f1(14, 14)) [ 0 <= 0 /\ 0 >= 0 /\ 1 >= 0 /\ 2 >= 0 /\ 4 >= 0 /\ 3 >= 0 /\ 6 >= 0 /\ 8 >= 0 /\ 5 >= 0 /\ 10 >= 0 /\ 12 >= 0 /\ 7 >= 0 /\ 14 >= 0 /\ 16 >= 0 /\ 9 >= 0 /\ 18 >= 0 /\ 20 >= 0 /\ 11 >= 0 /\ 22 >= 0 /\ 24 >= 0 /\ 13 >= 0 /\ 26 >= 0 ]
		(Comp: ?, Cost: 1)     f1(Ar_0, Ar_1) -> Com_1(f1(Ar_0 + 1, Ar_1 + 1)) [ Ar_0 - Ar_1 >= 0 /\ Ar_1 >= 0 /\ Ar_0 + Ar_1 >= 0 /\ -Ar_0 + Ar_1 >= 0 /\ Ar_0 >= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.081 sec (SMT: 0.067 sec)
