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

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

Applied AI with 'oct' on problem 3 to obtain the following invariants:
  For symbol l2: -X_1 >= 0


This yielded the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    l2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_4, Ar_4 - 1)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 ]
		(Comp: 1, Cost: 1)    l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 >= Ar_0 ]
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3, Ar_4)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)    l0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4))
	start location:	koat_start
	leaf cost:	0

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

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

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

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

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

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

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

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

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

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

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

By chaining the transition l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 9*Ar_4 - 36, Ar_4 - 9)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 ] with all transitions in problem 15, the following new transition is obtained:
	l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 10*Ar_4 - 45, Ar_4 - 10)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 ]
We thus obtain the following problem:
16:	T:
		(Comp: 1, Cost: 11)    l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 10*Ar_4 - 45, Ar_4 - 10)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 ]
		(Comp: ?, Cost: 1)     l2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_4, Ar_4 - 1)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 ]
		(Comp: ?, Cost: 1)     l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3, Ar_4)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 10*Ar_4 - 45, Ar_4 - 10)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 ] with all transitions in problem 16, the following new transition is obtained:
	l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 11*Ar_4 - 55, Ar_4 - 11)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 /\ Ar_3 + 10*Ar_4 - 45 >= 1 ]
We thus obtain the following problem:
17:	T:
		(Comp: 1, Cost: 12)    l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 11*Ar_4 - 55, Ar_4 - 11)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 /\ Ar_3 + 10*Ar_4 - 45 >= 1 ]
		(Comp: ?, Cost: 1)     l2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_4, Ar_4 - 1)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 ]
		(Comp: ?, Cost: 1)     l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3, Ar_4)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 11*Ar_4 - 55, Ar_4 - 11)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 /\ Ar_3 + 10*Ar_4 - 45 >= 1 ] with all transitions in problem 17, the following new transition is obtained:
	l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 12*Ar_4 - 66, Ar_4 - 12)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 /\ Ar_3 + 10*Ar_4 - 45 >= 1 /\ Ar_3 + 11*Ar_4 - 55 >= 1 ]
We thus obtain the following problem:
18:	T:
		(Comp: 1, Cost: 13)    l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 12*Ar_4 - 66, Ar_4 - 12)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 /\ Ar_3 + 10*Ar_4 - 45 >= 1 /\ Ar_3 + 11*Ar_4 - 55 >= 1 ]
		(Comp: ?, Cost: 1)     l2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_4, Ar_4 - 1)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 ]
		(Comp: ?, Cost: 1)     l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3, Ar_4)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 12*Ar_4 - 66, Ar_4 - 12)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 /\ Ar_3 + 10*Ar_4 - 45 >= 1 /\ Ar_3 + 11*Ar_4 - 55 >= 1 ] with all transitions in problem 18, the following new transition is obtained:
	l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 13*Ar_4 - 78, Ar_4 - 13)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 /\ Ar_3 + 10*Ar_4 - 45 >= 1 /\ Ar_3 + 11*Ar_4 - 55 >= 1 /\ Ar_3 + 12*Ar_4 - 66 >= 1 ]
We thus obtain the following problem:
19:	T:
		(Comp: 1, Cost: 14)    l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 13*Ar_4 - 78, Ar_4 - 13)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 /\ Ar_3 + 10*Ar_4 - 45 >= 1 /\ Ar_3 + 11*Ar_4 - 55 >= 1 /\ Ar_3 + 12*Ar_4 - 66 >= 1 ]
		(Comp: ?, Cost: 1)     l2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_4, Ar_4 - 1)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 ]
		(Comp: ?, Cost: 1)     l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3, Ar_4)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 13*Ar_4 - 78, Ar_4 - 13)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 /\ Ar_3 + 10*Ar_4 - 45 >= 1 /\ Ar_3 + 11*Ar_4 - 55 >= 1 /\ Ar_3 + 12*Ar_4 - 66 >= 1 ] with all transitions in problem 19, the following new transition is obtained:
	l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 14*Ar_4 - 91, Ar_4 - 14)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 /\ Ar_3 + 10*Ar_4 - 45 >= 1 /\ Ar_3 + 11*Ar_4 - 55 >= 1 /\ Ar_3 + 12*Ar_4 - 66 >= 1 /\ Ar_3 + 13*Ar_4 - 78 >= 1 ]
We thus obtain the following problem:
20:	T:
		(Comp: 1, Cost: 15)    l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + 14*Ar_4 - 91, Ar_4 - 14)) [ 0 >= Ar_0 /\ -Ar_0 >= 0 /\ Ar_3 >= 1 /\ Ar_3 + Ar_4 >= 1 /\ Ar_3 + 2*Ar_4 - 1 >= 1 /\ Ar_3 + 3*Ar_4 - 3 >= 1 /\ Ar_3 + 4*Ar_4 - 6 >= 1 /\ Ar_3 + 5*Ar_4 - 10 >= 1 /\ Ar_3 + 6*Ar_4 - 15 >= 1 /\ Ar_3 + 7*Ar_4 - 21 >= 1 /\ Ar_3 + 8*Ar_4 - 28 >= 1 /\ Ar_3 + 9*Ar_4 - 36 >= 1 /\ Ar_3 + 10*Ar_4 - 45 >= 1 /\ Ar_3 + 11*Ar_4 - 55 >= 1 /\ Ar_3 + 12*Ar_4 - 66 >= 1 /\ Ar_3 + 13*Ar_4 - 78 >= 1 ]
		(Comp: ?, Cost: 1)     l2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3 + Ar_4, Ar_4 - 1)) [ -Ar_0 >= 0 /\ Ar_3 >= 1 ]
		(Comp: ?, Cost: 1)     l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l1(Ar_0 + Ar_1, Ar_1 + Ar_2, Ar_2 - 1, Ar_3, Ar_4)) [ Ar_0 >= 1 ]
		(Comp: 1, Cost: 1)     koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4) -> Com_1(l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.722 sec (SMT: 0.613 sec)
