
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    l0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(l1(Fresh_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(l1(Ar_0 + 1, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 1 <= Ar_0 /\ Ar_0 <= 3 /\ V = 0 ]
		(Comp: ?, Cost: 1)    l2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(l1(Ar_0, Ar_1 - 1, Ar_2, Ar_3, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(l2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ Ar_1 > 0 /\ V = 1 ]
		(Comp: ?, Cost: 1)    l2(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, Ar_2, Ar_3, 2*Ar_4, 3*Ar_5)) [ Ar_5 < Ar_4 /\ Ar_5 > 0 ]
		(Comp: ?, Cost: 1)    l3(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4 - 1, Ar_5)) [ Ar_4 > 0 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5) -> Com_1(l0(Ar_0, Ar_1, Ar_2, Ar_3, Ar_4, Ar_5)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Slicing away variables that do not contribute to conditions from problem 1 leaves variables [Ar_0, Ar_1, Ar_4, Ar_5].
We thus obtain the following problem:
2:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l0(Ar_0, Ar_1, Ar_4, Ar_5)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    l4(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4 - 1, Ar_5)) [ Ar_4 > 0 ]
		(Comp: ?, Cost: 1)    l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, 2*Ar_4, 3*Ar_5)) [ Ar_5 < Ar_4 /\ Ar_5 > 0 ]
		(Comp: ?, Cost: 1)    l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l2(Ar_0, Ar_1, Ar_4, Ar_5)) [ Ar_1 > 0 /\ V = 1 ]
		(Comp: ?, Cost: 1)    l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Ar_0, Ar_1 - 1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Ar_0 + 1, Ar_1, Ar_4, Ar_5)) [ 1 <= Ar_0 /\ Ar_0 <= 3 /\ V = 0 ]
		(Comp: ?, Cost: 1)    l0(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Fresh_0, Ar_1, Ar_4, Ar_5))
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 2 produces the following problem:
3:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l0(Ar_0, Ar_1, Ar_4, Ar_5)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    l4(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4 - 1, Ar_5)) [ Ar_4 > 0 ]
		(Comp: ?, Cost: 1)    l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, 2*Ar_4, 3*Ar_5)) [ Ar_5 < Ar_4 /\ Ar_5 > 0 ]
		(Comp: ?, Cost: 1)    l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l2(Ar_0, Ar_1, Ar_4, Ar_5)) [ Ar_1 > 0 /\ V = 1 ]
		(Comp: ?, Cost: 1)    l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Ar_0, Ar_1 - 1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Ar_0 + 1, Ar_1, Ar_4, Ar_5)) [ 1 <= Ar_0 /\ Ar_0 <= 3 /\ V = 0 ]
		(Comp: 1, Cost: 1)    l0(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Fresh_0, Ar_1, Ar_4, Ar_5))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = 2
	Pol(l0) = 2
	Pol(l4) = 0
	Pol(l3) = 1
	Pol(l2) = 2
	Pol(l1) = 2
orients all transitions weakly and the transitions
	l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4, Ar_5))
	l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, Ar_4, Ar_5))
strictly and produces the following problem:
4:	T:
		(Comp: 1, Cost: 0)    koat_start(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l0(Ar_0, Ar_1, Ar_4, Ar_5)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)    l4(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4 - 1, Ar_5)) [ Ar_4 > 0 ]
		(Comp: 2, Cost: 1)    l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, 2*Ar_4, 3*Ar_5)) [ Ar_5 < Ar_4 /\ Ar_5 > 0 ]
		(Comp: 2, Cost: 1)    l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l2(Ar_0, Ar_1, Ar_4, Ar_5)) [ Ar_1 > 0 /\ V = 1 ]
		(Comp: ?, Cost: 1)    l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Ar_0, Ar_1 - 1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)    l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Ar_0 + 1, Ar_1, Ar_4, Ar_5)) [ 1 <= Ar_0 /\ Ar_0 <= 3 /\ V = 0 ]
		(Comp: 1, Cost: 1)    l0(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Fresh_0, Ar_1, Ar_4, Ar_5))
	start location:	koat_start
	leaf cost:	0

A polynomial rank function with
	Pol(koat_start) = V_2 + 1
	Pol(l0) = V_2 + 1
	Pol(l4) = V_2
	Pol(l3) = V_2
	Pol(l2) = V_2
	Pol(l1) = V_2 + 1
orients all transitions weakly and the transition
	l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l2(Ar_0, Ar_1, Ar_4, Ar_5)) [ Ar_1 > 0 /\ V = 1 ]
strictly and produces the following problem:
5:	T:
		(Comp: 1, Cost: 0)           koat_start(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l0(Ar_0, Ar_1, Ar_4, Ar_5)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)           l4(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4 - 1, Ar_5)) [ Ar_4 > 0 ]
		(Comp: 2, Cost: 1)           l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)           l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, 2*Ar_4, 3*Ar_5)) [ Ar_5 < Ar_4 /\ Ar_5 > 0 ]
		(Comp: 2, Cost: 1)           l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, Ar_4, Ar_5))
		(Comp: Ar_1 + 1, Cost: 1)    l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l2(Ar_0, Ar_1, Ar_4, Ar_5)) [ Ar_1 > 0 /\ V = 1 ]
		(Comp: ?, Cost: 1)           l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Ar_0, Ar_1 - 1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)           l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Ar_0 + 1, Ar_1, Ar_4, Ar_5)) [ 1 <= Ar_0 /\ Ar_0 <= 3 /\ V = 0 ]
		(Comp: 1, Cost: 1)           l0(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Fresh_0, Ar_1, Ar_4, Ar_5))
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 5 produces the following problem:
6:	T:
		(Comp: 1, Cost: 0)           koat_start(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l0(Ar_0, Ar_1, Ar_4, Ar_5)) [ 0 <= 0 ]
		(Comp: ?, Cost: 1)           l4(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4 - 1, Ar_5)) [ Ar_4 > 0 ]
		(Comp: 2, Cost: 1)           l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)           l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, 2*Ar_4, 3*Ar_5)) [ Ar_5 < Ar_4 /\ Ar_5 > 0 ]
		(Comp: 2, Cost: 1)           l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, Ar_4, Ar_5))
		(Comp: Ar_1 + 1, Cost: 1)    l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l2(Ar_0, Ar_1, Ar_4, Ar_5)) [ Ar_1 > 0 /\ V = 1 ]
		(Comp: Ar_1 + 1, Cost: 1)    l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Ar_0, Ar_1 - 1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)           l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Ar_0 + 1, Ar_1, Ar_4, Ar_5)) [ 1 <= Ar_0 /\ Ar_0 <= 3 /\ V = 0 ]
		(Comp: 1, Cost: 1)           l0(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Fresh_0, Ar_1, Ar_4, Ar_5))
	start location:	koat_start
	leaf cost:	0

Applied AI with 'oct' on problem 6 to obtain the following invariants:
  For symbol l2: X_2 - 1 >= 0
  For symbol l3: X_2 - 1 >= 0
  For symbol l4: X_2 - 1 >= 0


This yielded the following problem:
7:	T:
		(Comp: 1, Cost: 1)           l0(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Fresh_0, Ar_1, Ar_4, Ar_5))
		(Comp: ?, Cost: 1)           l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Ar_0 + 1, Ar_1, Ar_4, Ar_5)) [ 1 <= Ar_0 /\ Ar_0 <= 3 /\ V = 0 ]
		(Comp: Ar_1 + 1, Cost: 1)    l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l1(Ar_0, Ar_1 - 1, Ar_4, Ar_5)) [ Ar_1 - 1 >= 0 ]
		(Comp: Ar_1 + 1, Cost: 1)    l1(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l2(Ar_0, Ar_1, Ar_4, Ar_5)) [ Ar_1 > 0 /\ V = 1 ]
		(Comp: 2, Cost: 1)           l2(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, Ar_4, Ar_5)) [ Ar_1 - 1 >= 0 ]
		(Comp: ?, Cost: 1)           l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l3(Ar_0, Ar_1, 2*Ar_4, 3*Ar_5)) [ Ar_1 - 1 >= 0 /\ Ar_5 < Ar_4 /\ Ar_5 > 0 ]
		(Comp: 2, Cost: 1)           l3(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4, Ar_5)) [ Ar_1 - 1 >= 0 ]
		(Comp: ?, Cost: 1)           l4(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l4(Ar_0, Ar_1, Ar_4 - 1, Ar_5)) [ Ar_1 - 1 >= 0 /\ Ar_4 > 0 ]
		(Comp: 1, Cost: 0)           koat_start(Ar_0, Ar_1, Ar_4, Ar_5) -> Com_1(l0(Ar_0, Ar_1, Ar_4, Ar_5)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Complexity upper bound ?

Time: 0.628 sec (SMT: 0.481 sec)
