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

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

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

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

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

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

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

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

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

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

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

By chaining the transition l0(Ar_0, Ar_1) -> Com_1(l1(1024*Ar_0, Ar_1 + 10)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 ] with all transitions in problem 12, the following new transition is obtained:
	l0(Ar_0, Ar_1) -> Com_1(l1(2048*Ar_0, Ar_1 + 11)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 ]
We thus obtain the following problem:
13:	T:
		(Comp: 1, Cost: 12)    l0(Ar_0, Ar_1) -> Com_1(l1(2048*Ar_0, Ar_1 + 11)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 ]
		(Comp: ?, Cost: 1)     l1(Ar_0, Ar_1) -> Com_1(l1(2*Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 ]
		(Comp: 1, Cost: 0)     koat_start(Ar_0, Ar_1) -> Com_1(l0(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l0(Ar_0, Ar_1) -> Com_1(l1(2048*Ar_0, Ar_1 + 11)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 ] with all transitions in problem 13, the following new transition is obtained:
	l0(Ar_0, Ar_1) -> Com_1(l1(4096*Ar_0, Ar_1 + 12)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 /\ 2048*Ar_0 >= 1 /\ 2048*Ar_0 <= Ar_1 + 12 ]
We thus obtain the following problem:
14:	T:
		(Comp: 1, Cost: 13)    l0(Ar_0, Ar_1) -> Com_1(l1(4096*Ar_0, Ar_1 + 12)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 /\ 2048*Ar_0 >= 1 /\ 2048*Ar_0 <= Ar_1 + 12 ]
		(Comp: ?, Cost: 1)     l1(Ar_0, Ar_1) -> Com_1(l1(2*Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 ]
		(Comp: 1, Cost: 0)     koat_start(Ar_0, Ar_1) -> Com_1(l0(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l0(Ar_0, Ar_1) -> Com_1(l1(4096*Ar_0, Ar_1 + 12)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 /\ 2048*Ar_0 >= 1 /\ 2048*Ar_0 <= Ar_1 + 12 ] with all transitions in problem 14, the following new transition is obtained:
	l0(Ar_0, Ar_1) -> Com_1(l1(8192*Ar_0, Ar_1 + 13)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 /\ 2048*Ar_0 >= 1 /\ 2048*Ar_0 <= Ar_1 + 12 /\ 4096*Ar_0 >= 1 /\ 4096*Ar_0 <= Ar_1 + 13 ]
We thus obtain the following problem:
15:	T:
		(Comp: 1, Cost: 14)    l0(Ar_0, Ar_1) -> Com_1(l1(8192*Ar_0, Ar_1 + 13)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 /\ 2048*Ar_0 >= 1 /\ 2048*Ar_0 <= Ar_1 + 12 /\ 4096*Ar_0 >= 1 /\ 4096*Ar_0 <= Ar_1 + 13 ]
		(Comp: ?, Cost: 1)     l1(Ar_0, Ar_1) -> Com_1(l1(2*Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 ]
		(Comp: 1, Cost: 0)     koat_start(Ar_0, Ar_1) -> Com_1(l0(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l0(Ar_0, Ar_1) -> Com_1(l1(8192*Ar_0, Ar_1 + 13)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 /\ 2048*Ar_0 >= 1 /\ 2048*Ar_0 <= Ar_1 + 12 /\ 4096*Ar_0 >= 1 /\ 4096*Ar_0 <= Ar_1 + 13 ] with all transitions in problem 15, the following new transition is obtained:
	l0(Ar_0, Ar_1) -> Com_1(l1(16384*Ar_0, Ar_1 + 14)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 /\ 2048*Ar_0 >= 1 /\ 2048*Ar_0 <= Ar_1 + 12 /\ 4096*Ar_0 >= 1 /\ 4096*Ar_0 <= Ar_1 + 13 /\ 8192*Ar_0 >= 1 /\ 8192*Ar_0 <= Ar_1 + 14 ]
We thus obtain the following problem:
16:	T:
		(Comp: 1, Cost: 15)    l0(Ar_0, Ar_1) -> Com_1(l1(16384*Ar_0, Ar_1 + 14)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 /\ 2048*Ar_0 >= 1 /\ 2048*Ar_0 <= Ar_1 + 12 /\ 4096*Ar_0 >= 1 /\ 4096*Ar_0 <= Ar_1 + 13 /\ 8192*Ar_0 >= 1 /\ 8192*Ar_0 <= Ar_1 + 14 ]
		(Comp: ?, Cost: 1)     l1(Ar_0, Ar_1) -> Com_1(l1(2*Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 ]
		(Comp: 1, Cost: 0)     koat_start(Ar_0, Ar_1) -> Com_1(l0(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition l0(Ar_0, Ar_1) -> Com_1(l1(16384*Ar_0, Ar_1 + 14)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 /\ 2048*Ar_0 >= 1 /\ 2048*Ar_0 <= Ar_1 + 12 /\ 4096*Ar_0 >= 1 /\ 4096*Ar_0 <= Ar_1 + 13 /\ 8192*Ar_0 >= 1 /\ 8192*Ar_0 <= Ar_1 + 14 ] with all transitions in problem 16, the following new transition is obtained:
	l0(Ar_0, Ar_1) -> Com_1(l1(32768*Ar_0, Ar_1 + 15)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 /\ 2048*Ar_0 >= 1 /\ 2048*Ar_0 <= Ar_1 + 12 /\ 4096*Ar_0 >= 1 /\ 4096*Ar_0 <= Ar_1 + 13 /\ 8192*Ar_0 >= 1 /\ 8192*Ar_0 <= Ar_1 + 14 /\ 16384*Ar_0 >= 1 /\ 16384*Ar_0 <= Ar_1 + 15 ]
We thus obtain the following problem:
17:	T:
		(Comp: 1, Cost: 16)    l0(Ar_0, Ar_1) -> Com_1(l1(32768*Ar_0, Ar_1 + 15)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 /\ 2*Ar_0 >= 1 /\ 2*Ar_0 <= Ar_1 + 2 /\ 4*Ar_0 >= 1 /\ 4*Ar_0 <= Ar_1 + 3 /\ 8*Ar_0 >= 1 /\ 8*Ar_0 <= Ar_1 + 4 /\ 16*Ar_0 >= 1 /\ 16*Ar_0 <= Ar_1 + 5 /\ 32*Ar_0 >= 1 /\ 32*Ar_0 <= Ar_1 + 6 /\ 64*Ar_0 >= 1 /\ 64*Ar_0 <= Ar_1 + 7 /\ 128*Ar_0 >= 1 /\ 128*Ar_0 <= Ar_1 + 8 /\ 256*Ar_0 >= 1 /\ 256*Ar_0 <= Ar_1 + 9 /\ 512*Ar_0 >= 1 /\ 512*Ar_0 <= Ar_1 + 10 /\ 1024*Ar_0 >= 1 /\ 1024*Ar_0 <= Ar_1 + 11 /\ 2048*Ar_0 >= 1 /\ 2048*Ar_0 <= Ar_1 + 12 /\ 4096*Ar_0 >= 1 /\ 4096*Ar_0 <= Ar_1 + 13 /\ 8192*Ar_0 >= 1 /\ 8192*Ar_0 <= Ar_1 + 14 /\ 16384*Ar_0 >= 1 /\ 16384*Ar_0 <= Ar_1 + 15 ]
		(Comp: ?, Cost: 1)     l1(Ar_0, Ar_1) -> Com_1(l1(2*Ar_0, Ar_1 + 1)) [ Ar_0 >= 1 /\ Ar_0 <= Ar_1 + 1 ]
		(Comp: 1, Cost: 0)     koat_start(Ar_0, Ar_1) -> Com_1(l0(Ar_0, Ar_1)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.431 sec (SMT: 0.380 sec)
