
Initial complexity problem:
1:	T:
		(Comp: ?, Cost: 1)    f0(Ar_0) -> Com_1(f1(100))
		(Comp: ?, Cost: 1)    f1(Ar_0) -> Com_1(f1(Ar_0 - 1)) [ Ar_0 >= 302 ]
		(Comp: ?, Cost: 1)    f1(Ar_0) -> Com_1(f1(Ar_0 - 1)) [ 300 >= Ar_0 ]
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Testing for reachability in the complexity graph removes the following transition from problem 1:
	f1(Ar_0) -> Com_1(f1(Ar_0 - 1)) [ Ar_0 >= 302 ]
We thus obtain the following problem:
2:	T:
		(Comp: ?, Cost: 1)    f1(Ar_0) -> Com_1(f1(Ar_0 - 1)) [ 300 >= Ar_0 ]
		(Comp: ?, Cost: 1)    f0(Ar_0) -> Com_1(f1(100))
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 0 <= 0 ]
	start location:	koat_start
	leaf cost:	0

Repeatedly propagating knowledge in problem 2 produces the following problem:
3:	T:
		(Comp: ?, Cost: 1)    f1(Ar_0) -> Com_1(f1(Ar_0 - 1)) [ 300 >= Ar_0 ]
		(Comp: 1, Cost: 1)    f0(Ar_0) -> Com_1(f1(100))
		(Comp: 1, Cost: 0)    koat_start(Ar_0) -> Com_1(f0(Ar_0)) [ 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 + 100 >= 0


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

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

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

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

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

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

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

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

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

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

By chaining the transition koat_start(Ar_0) -> Com_1(f1(93)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 ] with all transitions in problem 13, the following new transition is obtained:
	koat_start(Ar_0) -> Com_1(f1(92)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 ]
We thus obtain the following problem:
14:	T:
		(Comp: 1, Cost: 9)    koat_start(Ar_0) -> Com_1(f1(92)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 ]
		(Comp: ?, Cost: 1)    f1(Ar_0) -> Com_1(f1(Ar_0 - 1)) [ -Ar_0 + 100 >= 0 /\ 300 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0) -> Com_1(f1(92)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 ] with all transitions in problem 14, the following new transition is obtained:
	koat_start(Ar_0) -> Com_1(f1(91)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 ]
We thus obtain the following problem:
15:	T:
		(Comp: 1, Cost: 10)    koat_start(Ar_0) -> Com_1(f1(91)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 ]
		(Comp: ?, Cost: 1)     f1(Ar_0) -> Com_1(f1(Ar_0 - 1)) [ -Ar_0 + 100 >= 0 /\ 300 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0) -> Com_1(f1(91)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 ] with all transitions in problem 15, the following new transition is obtained:
	koat_start(Ar_0) -> Com_1(f1(90)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 ]
We thus obtain the following problem:
16:	T:
		(Comp: 1, Cost: 11)    koat_start(Ar_0) -> Com_1(f1(90)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 ]
		(Comp: ?, Cost: 1)     f1(Ar_0) -> Com_1(f1(Ar_0 - 1)) [ -Ar_0 + 100 >= 0 /\ 300 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0) -> Com_1(f1(90)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 ] with all transitions in problem 16, the following new transition is obtained:
	koat_start(Ar_0) -> Com_1(f1(89)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 /\ 10 >= 0 /\ 300 >= 90 ]
We thus obtain the following problem:
17:	T:
		(Comp: 1, Cost: 12)    koat_start(Ar_0) -> Com_1(f1(89)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 /\ 10 >= 0 /\ 300 >= 90 ]
		(Comp: ?, Cost: 1)     f1(Ar_0) -> Com_1(f1(Ar_0 - 1)) [ -Ar_0 + 100 >= 0 /\ 300 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0) -> Com_1(f1(89)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 /\ 10 >= 0 /\ 300 >= 90 ] with all transitions in problem 17, the following new transition is obtained:
	koat_start(Ar_0) -> Com_1(f1(88)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 /\ 10 >= 0 /\ 300 >= 90 /\ 11 >= 0 /\ 300 >= 89 ]
We thus obtain the following problem:
18:	T:
		(Comp: 1, Cost: 13)    koat_start(Ar_0) -> Com_1(f1(88)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 /\ 10 >= 0 /\ 300 >= 90 /\ 11 >= 0 /\ 300 >= 89 ]
		(Comp: ?, Cost: 1)     f1(Ar_0) -> Com_1(f1(Ar_0 - 1)) [ -Ar_0 + 100 >= 0 /\ 300 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0) -> Com_1(f1(88)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 /\ 10 >= 0 /\ 300 >= 90 /\ 11 >= 0 /\ 300 >= 89 ] with all transitions in problem 18, the following new transition is obtained:
	koat_start(Ar_0) -> Com_1(f1(87)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 /\ 10 >= 0 /\ 300 >= 90 /\ 11 >= 0 /\ 300 >= 89 /\ 12 >= 0 /\ 300 >= 88 ]
We thus obtain the following problem:
19:	T:
		(Comp: 1, Cost: 14)    koat_start(Ar_0) -> Com_1(f1(87)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 /\ 10 >= 0 /\ 300 >= 90 /\ 11 >= 0 /\ 300 >= 89 /\ 12 >= 0 /\ 300 >= 88 ]
		(Comp: ?, Cost: 1)     f1(Ar_0) -> Com_1(f1(Ar_0 - 1)) [ -Ar_0 + 100 >= 0 /\ 300 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

By chaining the transition koat_start(Ar_0) -> Com_1(f1(87)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 /\ 10 >= 0 /\ 300 >= 90 /\ 11 >= 0 /\ 300 >= 89 /\ 12 >= 0 /\ 300 >= 88 ] with all transitions in problem 19, the following new transition is obtained:
	koat_start(Ar_0) -> Com_1(f1(86)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 /\ 10 >= 0 /\ 300 >= 90 /\ 11 >= 0 /\ 300 >= 89 /\ 12 >= 0 /\ 300 >= 88 /\ 13 >= 0 /\ 300 >= 87 ]
We thus obtain the following problem:
20:	T:
		(Comp: 1, Cost: 15)    koat_start(Ar_0) -> Com_1(f1(86)) [ 0 <= 0 /\ 0 >= 0 /\ 300 >= 100 /\ 1 >= 0 /\ 300 >= 99 /\ 2 >= 0 /\ 300 >= 98 /\ 3 >= 0 /\ 300 >= 97 /\ 4 >= 0 /\ 300 >= 96 /\ 5 >= 0 /\ 300 >= 95 /\ 6 >= 0 /\ 300 >= 94 /\ 7 >= 0 /\ 300 >= 93 /\ 8 >= 0 /\ 300 >= 92 /\ 9 >= 0 /\ 300 >= 91 /\ 10 >= 0 /\ 300 >= 90 /\ 11 >= 0 /\ 300 >= 89 /\ 12 >= 0 /\ 300 >= 88 /\ 13 >= 0 /\ 300 >= 87 ]
		(Comp: ?, Cost: 1)     f1(Ar_0) -> Com_1(f1(Ar_0 - 1)) [ -Ar_0 + 100 >= 0 /\ 300 >= Ar_0 ]
	start location:	koat_start
	leaf cost:	0

Complexity upper bound ?

Time: 0.081 sec (SMT: 0.066 sec)
