/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


MAYBE
proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, INF).

(0) CpxIntTrs
(1) Loat Proof [FINISHED, 21.6 s]
(2) BOUNDS(1, INF)


----------------------------------------

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f0(A, B, C, D, E, F, G, H, I, J) -> Com_1(f15(1, 4, K, 0, L, 0, 0, 0, 0, 0)) :|: K >= 0 && L >= 0
f15(A, B, C, D, E, F, G, H, I, J) -> Com_1(f36(A, B, C, D + 1, E, 0, 0, 0, 0, 0)) :|: 0 >= D && 0 >= C && B >= 1 && I >= 0 && I <= 0
f15(A, B, C, D, E, F, G, H, I, J) -> Com_1(f36(A, B - 1, C, 0, E, K, 0, 0, 0, 0)) :|: D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K && I >= 0 && I <= 0
f15(A, B, C, D, E, F, G, H, I, J) -> Com_1(f36(A + 1, A + 4, K, 0, E, L, 0, 0, 0, 0)) :|: 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0 && I >= 0 && I <= 0
f15(A, B, C, D, E, F, G, H, I, J) -> Com_1(f36(A, B, C - 1, D, E, K, 0, 0, 0, 0)) :|: C >= 1 && 1 >= K && K >= 0 && I >= 0 && I <= 0
f36(A, B, C, D, E, F, G, H, I, J) -> Com_1(f78(A, B, C, D, E, F, G, H, I, J)) :|: 0 >= H && J >= 1 + E
f36(A, B, C, D, E, F, G, H, I, J) -> Com_1(f78(A, B, C, D, E, F, G, H, I, J)) :|: H >= 1
f36(A, B, C, D, E, F, G, H, I, J) -> Com_1(f48(A, B, C, D + 1, E, F, 0, H, I, J)) :|: E >= J && 0 >= H && 0 >= D && 0 >= C && B >= 1
f36(A, B, C, D, E, F, G, H, I, J) -> Com_1(f48(A, B - 1, C, 0, E, F, K, H, I, J)) :|: E >= J && 0 >= H && D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K
f36(A, B, C, D, E, F, G, H, I, J) -> Com_1(f48(A + 1, A + 4, K, 0, E, F, L, H, I, J)) :|: E >= J && 0 >= H && 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0
f36(A, B, C, D, E, F, G, H, I, J) -> Com_1(f48(A, B, C - 1, D, E, F, K, H, I, J)) :|: E >= J && 0 >= H && C >= 1 && 1 >= K && K >= 0
f48(A, B, C, D, E, F, G, H, I, J) -> Com_1(f36(A, B, C, D, E, F, G, H, I, J + 1)) :|: E + 1 >= A && 0 >= G
f48(A, B, C, D, E, F, G, H, I, J) -> Com_1(f36(A, B, C, D, E, F, G, H, I, J + 1)) :|: G >= 1 && E + 1 >= A && F >= 1
f48(A, B, C, D, E, F, G, H, I, J) -> Com_1(f36(A, B, C, D + 1, E, F, G, 0, I, J + 1)) :|: G >= 1 && 0 >= F && E + 1 >= A && 0 >= D && 0 >= C && B >= 1
f48(A, B, C, D, E, F, G, H, I, J) -> Com_1(f36(A, B - 1, C, 0, E, F, G, K, I, J + 1)) :|: G >= 1 && 0 >= F && E + 1 >= A && D >= 1 && 0 >= C && K >= 0 && B >= 1 && 1 >= K
f48(A, B, C, D, E, F, G, H, I, J) -> Com_1(f36(A + 1, A + 4, K, 0, E, F, G, L, I, J + 1)) :|: G >= 1 && 0 >= F && E >= A && 0 >= C && L >= 0 && 1 >= L && 0 >= B && K >= 0
f48(A, B, C, D, E, F, G, H, I, J) -> Com_1(f36(A, B, C - 1, D, E, F, G, K, I, J + 1)) :|: G >= 1 && 0 >= F && E + 1 >= A && C >= 1 && 1 >= K && K >= 0
f78(A, B, C, D, E, F, G, H, I, J) -> Com_1(f15(A, B, C, D, E, F, G, H, I, J)) :|: E + 1 >= A && H >= 1
f78(A, B, C, D, E, F, G, H, I, J) -> Com_1(f15(A, B, C, D, E, F, G, H, 1, J)) :|: E + 1 >= A && 0 >= H
f15(A, B, C, D, E, F, G, H, I, J) -> Com_1(f83(A, B, C, D, E, F, G, H, I, J)) :|: 0 >= I + 1
f15(A, B, C, D, E, F, G, H, I, J) -> Com_1(f83(A, B, C, D, E, F, G, H, I, J)) :|: I >= 1

The start-symbols are:[f0_10]


----------------------------------------

(1) Loat Proof (FINISHED)


### Pre-processing the ITS problem ###



Initial linear ITS problem

   Start location: f0

      0: f0 -> f15 : A'=1, B'=4, C'=free_1, D'=0, E'=free, F'=0, G'=0, H'=0, Q'=0, J'=0, [ free_1>=0 && free>=0 ], cost: 1

      1: f15 -> f36 : D'=1+D, F'=0, G'=0, H'=0, Q'=0, J'=0, [ 0>=D && 0>=C && B>=1 && Q==0 ], cost: 1

      2: f15 -> f36 : B'=-1+B, D'=0, F'=free_2, G'=0, H'=0, Q'=0, J'=0, [ D>=1 && 0>=C && free_2>=0 && B>=1 && 1>=free_2 && Q==0 ], cost: 1

      3: f15 -> f36 : A'=1+A, B'=4+A, C'=free_4, D'=0, F'=free_3, G'=0, H'=0, Q'=0, J'=0, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && free_4>=0 && Q==0 ], cost: 1

      4: f15 -> f36 : C'=-1+C, F'=free_5, G'=0, H'=0, Q'=0, J'=0, [ C>=1 && 1>=free_5 && free_5>=0 && Q==0 ], cost: 1

     19: f15 -> f83 : [ 0>=1+Q ], cost: 1

     20: f15 -> f83 : [ Q>=1 ], cost: 1

      5: f36 -> f78 : [ 0>=H && J>=1+E ], cost: 1

      6: f36 -> f78 : [ H>=1 ], cost: 1

      7: f36 -> f48 : D'=1+D, G'=0, [ E>=J && 0>=H && 0>=D && 0>=C && B>=1 ], cost: 1

      8: f36 -> f48 : B'=-1+B, D'=0, G'=free_6, [ E>=J && 0>=H && D>=1 && 0>=C && free_6>=0 && B>=1 && 1>=free_6 ], cost: 1

      9: f36 -> f48 : A'=1+A, B'=4+A, C'=free_8, D'=0, G'=free_7, [ E>=J && 0>=H && 0>=C && free_7>=0 && 1>=free_7 && 0>=B && free_8>=0 ], cost: 1

     10: f36 -> f48 : C'=-1+C, G'=free_9, [ E>=J && 0>=H && C>=1 && 1>=free_9 && free_9>=0 ], cost: 1

     11: f48 -> f36 : J'=1+J, [ 1+E>=A && 0>=G ], cost: 1

     12: f48 -> f36 : J'=1+J, [ G>=1 && 1+E>=A && F>=1 ], cost: 1

     13: f48 -> f36 : D'=1+D, H'=0, J'=1+J, [ G>=1 && 0>=F && 1+E>=A && 0>=D && 0>=C && B>=1 ], cost: 1

     14: f48 -> f36 : B'=-1+B, D'=0, H'=free_10, J'=1+J, [ G>=1 && 0>=F && 1+E>=A && D>=1 && 0>=C && free_10>=0 && B>=1 && 1>=free_10 ], cost: 1

     15: f48 -> f36 : A'=1+A, B'=4+A, C'=free_12, D'=0, H'=free_11, J'=1+J, [ G>=1 && 0>=F && E>=A && 0>=C && free_11>=0 && 1>=free_11 && 0>=B && free_12>=0 ], cost: 1

     16: f48 -> f36 : C'=-1+C, H'=free_13, J'=1+J, [ G>=1 && 0>=F && 1+E>=A && C>=1 && 1>=free_13 && free_13>=0 ], cost: 1

     17: f78 -> f15 : [ 1+E>=A && H>=1 ], cost: 1

     18: f78 -> f15 : Q'=1, [ 1+E>=A && 0>=H ], cost: 1



Removed unreachable and leaf rules:

   Start location: f0

      0: f0 -> f15 : A'=1, B'=4, C'=free_1, D'=0, E'=free, F'=0, G'=0, H'=0, Q'=0, J'=0, [ free_1>=0 && free>=0 ], cost: 1

      1: f15 -> f36 : D'=1+D, F'=0, G'=0, H'=0, Q'=0, J'=0, [ 0>=D && 0>=C && B>=1 && Q==0 ], cost: 1

      2: f15 -> f36 : B'=-1+B, D'=0, F'=free_2, G'=0, H'=0, Q'=0, J'=0, [ D>=1 && 0>=C && free_2>=0 && B>=1 && 1>=free_2 && Q==0 ], cost: 1

      3: f15 -> f36 : A'=1+A, B'=4+A, C'=free_4, D'=0, F'=free_3, G'=0, H'=0, Q'=0, J'=0, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && free_4>=0 && Q==0 ], cost: 1

      4: f15 -> f36 : C'=-1+C, F'=free_5, G'=0, H'=0, Q'=0, J'=0, [ C>=1 && 1>=free_5 && free_5>=0 && Q==0 ], cost: 1

      5: f36 -> f78 : [ 0>=H && J>=1+E ], cost: 1

      6: f36 -> f78 : [ H>=1 ], cost: 1

      7: f36 -> f48 : D'=1+D, G'=0, [ E>=J && 0>=H && 0>=D && 0>=C && B>=1 ], cost: 1

      8: f36 -> f48 : B'=-1+B, D'=0, G'=free_6, [ E>=J && 0>=H && D>=1 && 0>=C && free_6>=0 && B>=1 && 1>=free_6 ], cost: 1

      9: f36 -> f48 : A'=1+A, B'=4+A, C'=free_8, D'=0, G'=free_7, [ E>=J && 0>=H && 0>=C && free_7>=0 && 1>=free_7 && 0>=B && free_8>=0 ], cost: 1

     10: f36 -> f48 : C'=-1+C, G'=free_9, [ E>=J && 0>=H && C>=1 && 1>=free_9 && free_9>=0 ], cost: 1

     11: f48 -> f36 : J'=1+J, [ 1+E>=A && 0>=G ], cost: 1

     12: f48 -> f36 : J'=1+J, [ G>=1 && 1+E>=A && F>=1 ], cost: 1

     13: f48 -> f36 : D'=1+D, H'=0, J'=1+J, [ G>=1 && 0>=F && 1+E>=A && 0>=D && 0>=C && B>=1 ], cost: 1

     14: f48 -> f36 : B'=-1+B, D'=0, H'=free_10, J'=1+J, [ G>=1 && 0>=F && 1+E>=A && D>=1 && 0>=C && free_10>=0 && B>=1 && 1>=free_10 ], cost: 1

     15: f48 -> f36 : A'=1+A, B'=4+A, C'=free_12, D'=0, H'=free_11, J'=1+J, [ G>=1 && 0>=F && E>=A && 0>=C && free_11>=0 && 1>=free_11 && 0>=B && free_12>=0 ], cost: 1

     16: f48 -> f36 : C'=-1+C, H'=free_13, J'=1+J, [ G>=1 && 0>=F && 1+E>=A && C>=1 && 1>=free_13 && free_13>=0 ], cost: 1

     17: f78 -> f15 : [ 1+E>=A && H>=1 ], cost: 1

     18: f78 -> f15 : Q'=1, [ 1+E>=A && 0>=H ], cost: 1



### Simplification by acceleration and chaining ###



Eliminated locations (on tree-shaped paths):

   Start location: f0

      0: f0 -> f15 : A'=1, B'=4, C'=free_1, D'=0, E'=free, F'=0, G'=0, H'=0, Q'=0, J'=0, [ free_1>=0 && free>=0 ], cost: 1

      1: f15 -> f36 : D'=1+D, F'=0, G'=0, H'=0, Q'=0, J'=0, [ 0>=D && 0>=C && B>=1 && Q==0 ], cost: 1

      2: f15 -> f36 : B'=-1+B, D'=0, F'=free_2, G'=0, H'=0, Q'=0, J'=0, [ D>=1 && 0>=C && free_2>=0 && B>=1 && 1>=free_2 && Q==0 ], cost: 1

      3: f15 -> f36 : A'=1+A, B'=4+A, C'=free_4, D'=0, F'=free_3, G'=0, H'=0, Q'=0, J'=0, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && free_4>=0 && Q==0 ], cost: 1

      4: f15 -> f36 : C'=-1+C, F'=free_5, G'=0, H'=0, Q'=0, J'=0, [ C>=1 && 1>=free_5 && free_5>=0 && Q==0 ], cost: 1

     21: f36 -> f36 : D'=1+D, G'=0, J'=1+J, [ E>=J && 0>=H && 0>=D && 0>=C && B>=1 && 1+E>=A ], cost: 2

     22: f36 -> f36 : B'=-1+B, D'=0, G'=free_6, J'=1+J, [ E>=J && 0>=H && D>=1 && 0>=C && free_6>=0 && B>=1 && 1+E>=A && 0>=free_6 ], cost: 2

     23: f36 -> f36 : B'=-1+B, D'=0, G'=free_6, J'=1+J, [ E>=J && 0>=H && D>=1 && 0>=C && B>=1 && 1>=free_6 && free_6>=1 && 1+E>=A && F>=1 ], cost: 2

     24: f36 -> f36 : B'=-1+B, D'=1, G'=free_6, H'=0, J'=1+J, [ E>=J && 0>=H && D>=1 && 0>=C && 1>=free_6 && free_6>=1 && 0>=F && 1+E>=A && -1+B>=1 ], cost: 2

     25: f36 -> f36 : A'=1+A, B'=4+A, C'=free_12, D'=0, G'=free_6, H'=free_11, J'=1+J, [ E>=J && 0>=H && D>=1 && 0>=C && B>=1 && 1>=free_6 && free_6>=1 && 0>=F && E>=A && free_11>=0 && 1>=free_11 && 0>=-1+B && free_12>=0 ], cost: 2

     26: f36 -> f36 : A'=1+A, B'=4+A, C'=free_8, D'=0, G'=free_7, J'=1+J, [ E>=J && 0>=H && 0>=C && free_7>=0 && 0>=B && free_8>=0 && 1+E>=1+A && 0>=free_7 ], cost: 2

     27: f36 -> f36 : A'=1+A, B'=4+A, C'=free_8, D'=0, G'=free_7, J'=1+J, [ E>=J && 0>=H && 0>=C && 1>=free_7 && 0>=B && free_8>=0 && free_7>=1 && 1+E>=1+A && F>=1 ], cost: 2

     28: f36 -> f36 : A'=1+A, B'=4+A, C'=free_8, D'=1, G'=free_7, H'=0, J'=1+J, [ E>=J && 0>=H && 0>=C && 1>=free_7 && 0>=B && free_8>=0 && free_7>=1 && 0>=F && 1+E>=1+A && 0>=free_8 && 4+A>=1 ], cost: 2

     29: f36 -> f36 : A'=2+A, B'=5+A, C'=free_12, D'=0, G'=free_7, H'=free_11, J'=1+J, [ E>=J && 0>=H && 0>=C && 1>=free_7 && 0>=B && free_8>=0 && free_7>=1 && 0>=F && E>=1+A && 0>=free_8 && free_11>=0 && 1>=free_11 && 0>=4+A && free_12>=0 ], cost: 2

     30: f36 -> f36 : A'=1+A, B'=4+A, C'=-1+free_8, D'=0, G'=free_7, H'=free_13, J'=1+J, [ E>=J && 0>=H && 0>=C && 1>=free_7 && 0>=B && free_7>=1 && 0>=F && 1+E>=1+A && free_8>=1 && 1>=free_13 && free_13>=0 ], cost: 2

     31: f36 -> f36 : C'=-1+C, G'=free_9, J'=1+J, [ E>=J && 0>=H && C>=1 && free_9>=0 && 1+E>=A && 0>=free_9 ], cost: 2

     32: f36 -> f36 : C'=-1+C, G'=free_9, J'=1+J, [ E>=J && 0>=H && C>=1 && 1>=free_9 && free_9>=1 && 1+E>=A && F>=1 ], cost: 2

     33: f36 -> f36 : C'=-1+C, D'=1+D, G'=free_9, H'=0, J'=1+J, [ E>=J && 0>=H && C>=1 && 1>=free_9 && free_9>=1 && 0>=F && 1+E>=A && 0>=D && 0>=-1+C && B>=1 ], cost: 2

     34: f36 -> f36 : B'=-1+B, C'=-1+C, D'=0, G'=free_9, H'=free_10, J'=1+J, [ E>=J && 0>=H && C>=1 && 1>=free_9 && free_9>=1 && 0>=F && 1+E>=A && D>=1 && 0>=-1+C && free_10>=0 && B>=1 && 1>=free_10 ], cost: 2

     35: f36 -> f36 : A'=1+A, B'=4+A, C'=free_12, D'=0, G'=free_9, H'=free_11, J'=1+J, [ E>=J && 0>=H && C>=1 && 1>=free_9 && free_9>=1 && 0>=F && E>=A && 0>=-1+C && free_11>=0 && 1>=free_11 && 0>=B && free_12>=0 ], cost: 2

     36: f36 -> f36 : C'=-2+C, G'=free_9, H'=free_13, J'=1+J, [ E>=J && 0>=H && 1>=free_9 && free_9>=1 && 0>=F && 1+E>=A && -1+C>=1 && 1>=free_13 && free_13>=0 ], cost: 2

     37: f36 -> f15 : Q'=1, [ 0>=H && J>=1+E && 1+E>=A ], cost: 2

     38: f36 -> f15 : [ H>=1 && 1+E>=A ], cost: 2



Accelerating simple loops of location 2.

   Simplified some of the simple loops (and removed duplicate rules).

   Accelerating the following rules:

     21: f36 -> f36 : D'=1+D, G'=0, J'=1+J, [ E>=J && 0>=H && 0>=D && 0>=C && B>=1 && 1+E>=A ], cost: 2

     22: f36 -> f36 : B'=-1+B, D'=0, G'=0, J'=1+J, [ E>=J && 0>=H && D>=1 && 0>=C && B>=1 && 1+E>=A ], cost: 2

     23: f36 -> f36 : B'=-1+B, D'=0, G'=1, J'=1+J, [ E>=J && 0>=H && D>=1 && 0>=C && B>=1 && 1+E>=A && F>=1 ], cost: 2

     24: f36 -> f36 : B'=-1+B, D'=1, G'=1, H'=0, J'=1+J, [ E>=J && 0>=H && D>=1 && 0>=C && 0>=F && 1+E>=A && -1+B>=1 ], cost: 2

     25: f36 -> f36 : A'=1+A, B'=4+A, C'=free_12, D'=0, G'=1, H'=free_11, J'=1+J, [ E>=J && 0>=H && D>=1 && 0>=C && 1-B==0 && 0>=F && E>=A && free_11>=0 && 1>=free_11 && free_12>=0 ], cost: 2

     26: f36 -> f36 : A'=1+A, B'=4+A, C'=free_8, D'=0, G'=0, J'=1+J, [ E>=J && 0>=H && 0>=C && 0>=B && free_8>=0 && 1+E>=1+A ], cost: 2

     27: f36 -> f36 : A'=1+A, B'=4+A, C'=free_8, D'=0, G'=1, J'=1+J, [ E>=J && 0>=H && 0>=C && 0>=B && free_8>=0 && 1+E>=1+A && F>=1 ], cost: 2

     28: f36 -> f36 : A'=1+A, B'=4+A, C'=0, D'=1, G'=1, H'=0, J'=1+J, [ E>=J && 0>=H && 0>=C && 0>=B && 0>=F && 1+E>=1+A && 4+A>=1 ], cost: 2

     29: f36 -> f36 : A'=2+A, B'=5+A, C'=free_12, D'=0, G'=1, H'=free_11, J'=1+J, [ E>=J && 0>=H && 0>=C && 0>=B && 0>=F && E>=1+A && free_11>=0 && 1>=free_11 && 0>=4+A && free_12>=0 ], cost: 2

     30: f36 -> f36 : A'=1+A, B'=4+A, C'=-1+free_8, D'=0, G'=1, H'=free_13, J'=1+J, [ E>=J && 0>=H && 0>=C && 0>=B && 0>=F && 1+E>=1+A && free_8>=1 && 1>=free_13 && free_13>=0 ], cost: 2

     31: f36 -> f36 : C'=-1+C, G'=0, J'=1+J, [ E>=J && 0>=H && C>=1 && 1+E>=A ], cost: 2

     32: f36 -> f36 : C'=-1+C, G'=1, J'=1+J, [ E>=J && 0>=H && C>=1 && 1+E>=A && F>=1 ], cost: 2

     33: f36 -> f36 : C'=-1+C, D'=1+D, G'=1, H'=0, J'=1+J, [ E>=J && 0>=H && 1-C==0 && 0>=F && 1+E>=A && 0>=D && B>=1 ], cost: 2

     34: f36 -> f36 : B'=-1+B, C'=-1+C, D'=0, G'=1, H'=free_10, J'=1+J, [ E>=J && 0>=H && 1-C==0 && 0>=F && 1+E>=A && D>=1 && free_10>=0 && B>=1 && 1>=free_10 ], cost: 2

     35: f36 -> f36 : A'=1+A, B'=4+A, C'=free_12, D'=0, G'=1, H'=free_11, J'=1+J, [ E>=J && 0>=H && 1-C==0 && 0>=F && E>=A && free_11>=0 && 1>=free_11 && 0>=B && free_12>=0 ], cost: 2

     36: f36 -> f36 : C'=-2+C, G'=1, H'=free_13, J'=1+J, [ E>=J && 0>=H && 0>=F && 1+E>=A && -1+C>=1 && 1>=free_13 && free_13>=0 ], cost: 2



   Accelerated rule 21 with backward acceleration, yielding the new rule 39.

   Accelerated rule 21 with backward acceleration, yielding the new rule 40.

   Found no metering function for rule 22.

   Found no metering function for rule 23.

   Accelerated rule 24 with backward acceleration, yielding the new rule 41.

   Accelerated rule 24 with backward acceleration, yielding the new rule 42.

   Found no metering function for rule 25.

   Found no metering function for rule 26.

   Found no metering function for rule 27.

   Found no metering function for rule 28.

   Found no metering function for rule 29.

   Found no metering function for rule 30.

   Accelerated rule 31 with backward acceleration, yielding the new rule 43.

   Accelerated rule 31 with backward acceleration, yielding the new rule 44.

   Accelerated rule 32 with backward acceleration, yielding the new rule 45.

   Accelerated rule 32 with backward acceleration, yielding the new rule 46.

   Accelerated rule 33 with metering function -1+C, yielding the new rule 47.

   Accelerated rule 34 with metering function -1+C, yielding the new rule 48.

      During metering: Instantiating temporary variables by {free_12==0,free_11==0}

   Accelerated rule 35 with metering function -1+C, yielding the new rule 49.

   Found no metering function for rule 36.

      During metering: Instantiating temporary variables by {free_12==1}

      During metering: Instantiating temporary variables by {free_8==1}

      During metering: Instantiating temporary variables by {free_8==1}

      During metering: Instantiating temporary variables by {free_12==1}

      During metering: Instantiating temporary variables by {free_8==2}

      During metering: Instantiating temporary variables by {free_12==-J+E}

   Nested simple loops 35 (outer loop) and 44 (inner loop) with metering function -1+C, resulting in the new rules: 50.

      During metering: Instantiating temporary variables by {free_8==1}

      During metering: Instantiating temporary variables by {free_8==1}

   Removing the simple loops: 21 24 31 32 33 34 35.



Accelerated all simple loops using metering functions (where possible):

   Start location: f0

      0: f0 -> f15 : A'=1, B'=4, C'=free_1, D'=0, E'=free, F'=0, G'=0, H'=0, Q'=0, J'=0, [ free_1>=0 && free>=0 ], cost: 1

      1: f15 -> f36 : D'=1+D, F'=0, G'=0, H'=0, Q'=0, J'=0, [ 0>=D && 0>=C && B>=1 && Q==0 ], cost: 1

      2: f15 -> f36 : B'=-1+B, D'=0, F'=free_2, G'=0, H'=0, Q'=0, J'=0, [ D>=1 && 0>=C && free_2>=0 && B>=1 && 1>=free_2 && Q==0 ], cost: 1

      3: f15 -> f36 : A'=1+A, B'=4+A, C'=free_4, D'=0, F'=free_3, G'=0, H'=0, Q'=0, J'=0, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && free_4>=0 && Q==0 ], cost: 1

      4: f15 -> f36 : C'=-1+C, F'=free_5, G'=0, H'=0, Q'=0, J'=0, [ C>=1 && 1>=free_5 && free_5>=0 && Q==0 ], cost: 1

     22: f36 -> f36 : B'=-1+B, D'=0, G'=0, J'=1+J, [ E>=J && 0>=H && D>=1 && 0>=C && B>=1 && 1+E>=A ], cost: 2

     23: f36 -> f36 : B'=-1+B, D'=0, G'=1, J'=1+J, [ E>=J && 0>=H && D>=1 && 0>=C && B>=1 && 1+E>=A && F>=1 ], cost: 2

     25: f36 -> f36 : A'=1+A, B'=4+A, C'=free_12, D'=0, G'=1, H'=free_11, J'=1+J, [ E>=J && 0>=H && D>=1 && 0>=C && 1-B==0 && 0>=F && E>=A && free_11>=0 && 1>=free_11 && free_12>=0 ], cost: 2

     26: f36 -> f36 : A'=1+A, B'=4+A, C'=free_8, D'=0, G'=0, J'=1+J, [ E>=J && 0>=H && 0>=C && 0>=B && free_8>=0 && 1+E>=1+A ], cost: 2

     27: f36 -> f36 : A'=1+A, B'=4+A, C'=free_8, D'=0, G'=1, J'=1+J, [ E>=J && 0>=H && 0>=C && 0>=B && free_8>=0 && 1+E>=1+A && F>=1 ], cost: 2

     28: f36 -> f36 : A'=1+A, B'=4+A, C'=0, D'=1, G'=1, H'=0, J'=1+J, [ E>=J && 0>=H && 0>=C && 0>=B && 0>=F && 1+E>=1+A && 4+A>=1 ], cost: 2

     29: f36 -> f36 : A'=2+A, B'=5+A, C'=free_12, D'=0, G'=1, H'=free_11, J'=1+J, [ E>=J && 0>=H && 0>=C && 0>=B && 0>=F && E>=1+A && free_11>=0 && 1>=free_11 && 0>=4+A && free_12>=0 ], cost: 2

     30: f36 -> f36 : A'=1+A, B'=4+A, C'=-1+free_8, D'=0, G'=1, H'=free_13, J'=1+J, [ E>=J && 0>=H && 0>=C && 0>=B && 0>=F && 1+E>=1+A && free_8>=1 && 1>=free_13 && free_13>=0 ], cost: 2

     36: f36 -> f36 : C'=-2+C, G'=1, H'=free_13, J'=1+J, [ E>=J && 0>=H && 0>=F && 1+E>=A && -1+C>=1 && 1>=free_13 && free_13>=0 ], cost: 2

     37: f36 -> f15 : Q'=1, [ 0>=H && J>=1+E && 1+E>=A ], cost: 2

     38: f36 -> f15 : [ H>=1 && 1+E>=A ], cost: 2

     39: f36 -> f36 : D'=1-J+D+E, G'=0, J'=1+E, [ E>=J && 0>=H && 0>=D && 0>=C && B>=1 && 1+E>=A && 0>=-J+D+E ], cost: 2-2*J+2*E

     40: f36 -> f36 : D'=1, G'=0, J'=1+J-D, [ E>=J && 0>=H && 0>=D && 0>=C && B>=1 && 1+E>=A && E>=J-D ], cost: 2-2*D

     41: f36 -> f36 : B'=-1+J-E+B, D'=1, G'=1, H'=0, J'=1+E, [ E>=J && 0>=H && D>=1 && 0>=C && 0>=F && 1+E>=A && -1+B>=1 && -1+J-E+B>=1 ], cost: 2-2*J+2*E

     42: f36 -> f36 : B'=1, D'=1, G'=1, H'=0, J'=-1+J+B, [ E>=J && 0>=H && D>=1 && 0>=C && 0>=F && 1+E>=A && -1+B>=1 && E>=-2+J+B ], cost: -2+2*B

     43: f36 -> f36 : C'=-1+C+J-E, G'=0, J'=1+E, [ E>=J && 0>=H && C>=1 && 1+E>=A && C+J-E>=1 ], cost: 2-2*J+2*E

     44: f36 -> f36 : C'=0, G'=0, J'=C+J, [ E>=J && 0>=H && C>=1 && 1+E>=A && E>=-1+C+J ], cost: 2*C

     45: f36 -> f36 : C'=-1+C+J-E, G'=1, J'=1+E, [ E>=J && 0>=H && C>=1 && 1+E>=A && F>=1 && C+J-E>=1 ], cost: 2-2*J+2*E

     46: f36 -> f36 : C'=0, G'=1, J'=C+J, [ E>=J && 0>=H && C>=1 && 1+E>=A && F>=1 && E>=-1+C+J ], cost: 2*C

     47: f36 -> f36 : C'=1, D'=-1+C+D, G'=1, H'=0, J'=-1+C+J, [ E>=J && 0>=H && 1-C==0 && 0>=F && 1+E>=A && 0>=D && B>=1 && -1+C>=1 ], cost: -2+2*C

     48: f36 -> f36 : B'=1-C+B, C'=1, D'=0, G'=1, H'=free_10, J'=-1+C+J, [ E>=J && 0>=H && 1-C==0 && 0>=F && 1+E>=A && D>=1 && free_10>=0 && B>=1 && 1>=free_10 && -1+C>=1 ], cost: -2+2*C

     49: f36 -> f36 : A'=-1+C+A, B'=2+C+A, C'=0, D'=0, G'=1, H'=0, J'=-1+C+J, [ E>=J && 0>=H && 1-C==0 && 0>=F && E>=A && 0>=B && -1+C>=1 ], cost: -2+2*C

     50: f36 -> f36 : A'=-1+C+A, B'=2+C+A, C'=0, D'=0, G'=0, H'=0, J'=-1+free_12*(-1+C)+C+J, [ 0>=H && 1-C==0 && 0>=F && E>=A && 0>=B && E>=1+J && free_12>=1 && E>=free_12+J && -1+C>=1 ], cost: -2+2*free_12*(-1+C)+2*C



Chained accelerated rules (with incoming rules):

   Start location: f0

      0: f0 -> f15 : A'=1, B'=4, C'=free_1, D'=0, E'=free, F'=0, G'=0, H'=0, Q'=0, J'=0, [ free_1>=0 && free>=0 ], cost: 1

      1: f15 -> f36 : D'=1+D, F'=0, G'=0, H'=0, Q'=0, J'=0, [ 0>=D && 0>=C && B>=1 && Q==0 ], cost: 1

      2: f15 -> f36 : B'=-1+B, D'=0, F'=free_2, G'=0, H'=0, Q'=0, J'=0, [ D>=1 && 0>=C && free_2>=0 && B>=1 && 1>=free_2 && Q==0 ], cost: 1

      3: f15 -> f36 : A'=1+A, B'=4+A, C'=free_4, D'=0, F'=free_3, G'=0, H'=0, Q'=0, J'=0, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && free_4>=0 && Q==0 ], cost: 1

      4: f15 -> f36 : C'=-1+C, F'=free_5, G'=0, H'=0, Q'=0, J'=0, [ C>=1 && 1>=free_5 && free_5>=0 && Q==0 ], cost: 1

     51: f15 -> f36 : B'=-1+B, D'=0, F'=0, G'=0, H'=0, Q'=0, J'=1, [ D==0 && 0>=C && B>=1 && Q==0 && E>=0 && 1+E>=A ], cost: 3

     52: f15 -> f36 : B'=-1+B, C'=-1+C, D'=0, F'=free_5, G'=0, H'=0, Q'=0, J'=1, [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && D>=1 && B>=1 && 1+E>=A ], cost: 3

     53: f15 -> f36 : B'=-1+B, C'=-1+C, D'=0, F'=1, G'=1, H'=0, Q'=0, J'=1, [ 1-C==0 && Q==0 && E>=0 && D>=1 && B>=1 && 1+E>=A ], cost: 3

     54: f15 -> f36 : A'=1+A, B'=4+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=0, J'=1, [ D==0 && 0>=C && Q==0 && E>=0 && 1-B==0 && E>=A && free_11>=0 && 1>=free_11 && free_12>=0 ], cost: 3

     55: f15 -> f36 : A'=1+A, B'=4+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=0, J'=1, [ 1-C==0 && Q==0 && E>=0 && D>=1 && 1-B==0 && E>=A && free_11>=0 && 1>=free_11 && free_12>=0 ], cost: 3

     56: f15 -> f36 : A'=1+A, B'=4+A, C'=free_8, D'=0, F'=free_2, G'=0, H'=0, Q'=0, J'=1, [ D>=1 && 0>=C && free_2>=0 && 1-B==0 && 1>=free_2 && Q==0 && E>=0 && free_8>=0 && 1+E>=1+A ], cost: 3

     57: f15 -> f36 : A'=2+A, B'=5+A, C'=free_8, D'=0, F'=free_3, G'=0, H'=0, Q'=0, J'=1, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && 0>=4+A && free_8>=0 && 1+E>=2+A ], cost: 3

     58: f15 -> f36 : A'=1+A, B'=4+A, C'=free_8, D'=0, F'=free_5, G'=0, H'=0, Q'=0, J'=1, [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=B && free_8>=0 && 1+E>=1+A ], cost: 3

     59: f15 -> f36 : A'=1+A, B'=4+A, C'=free_8, D'=0, F'=1, G'=1, H'=0, Q'=0, J'=1, [ D>=1 && 0>=C && 1-B==0 && Q==0 && E>=0 && free_8>=0 && 1+E>=1+A ], cost: 3

     60: f15 -> f36 : A'=2+A, B'=5+A, C'=free_8, D'=0, F'=1, G'=1, H'=0, Q'=0, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && 0>=4+A && free_8>=0 && 1+E>=2+A ], cost: 3

     61: f15 -> f36 : A'=1+A, B'=4+A, C'=free_8, D'=0, F'=1, G'=1, H'=0, Q'=0, J'=1, [ 1-C==0 && Q==0 && E>=0 && 0>=B && free_8>=0 && 1+E>=1+A ], cost: 3

     62: f15 -> f36 : A'=1+A, B'=4+A, C'=0, D'=1, F'=0, G'=1, H'=0, Q'=0, J'=1, [ D>=1 && 0>=C && 1-B==0 && Q==0 && E>=0 && 1+E>=1+A && 4+A>=1 ], cost: 3

     63: f15 -> f36 : A'=2+A, B'=5+A, C'=0, D'=1, F'=0, G'=1, H'=0, Q'=0, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && 4+A==0 && 1+E>=2+A ], cost: 3

     64: f15 -> f36 : A'=1+A, B'=4+A, C'=0, D'=1, F'=0, G'=1, H'=0, Q'=0, J'=1, [ 1-C==0 && Q==0 && E>=0 && 0>=B && 1+E>=1+A && 4+A>=1 ], cost: 3

     65: f15 -> f36 : A'=2+A, B'=5+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=0, J'=1, [ D>=1 && 0>=C && 1-B==0 && Q==0 && E>=0 && E>=1+A && free_11>=0 && 1>=free_11 && 0>=4+A && free_12>=0 ], cost: 3

     66: f15 -> f36 : A'=3+A, B'=6+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=0, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && E>=2+A && free_11>=0 && 1>=free_11 && 0>=5+A && free_12>=0 ], cost: 3

     67: f15 -> f36 : A'=2+A, B'=5+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=0, J'=1, [ 1-C==0 && Q==0 && E>=0 && 0>=B && E>=1+A && free_11>=0 && 1>=free_11 && 0>=4+A && free_12>=0 ], cost: 3

     68: f15 -> f36 : A'=1+A, B'=4+A, C'=-1+free_8, D'=0, F'=0, G'=1, H'=free_13, Q'=0, J'=1, [ D>=1 && 0>=C && 1-B==0 && Q==0 && E>=0 && 1+E>=1+A && free_8>=1 && 1>=free_13 && free_13>=0 ], cost: 3

     69: f15 -> f36 : A'=2+A, B'=5+A, C'=-1+free_8, D'=0, F'=0, G'=1, H'=free_13, Q'=0, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && 0>=4+A && 1+E>=2+A && free_8>=1 && 1>=free_13 && free_13>=0 ], cost: 3

     70: f15 -> f36 : A'=1+A, B'=4+A, C'=-1+free_8, D'=0, F'=0, G'=1, H'=free_13, Q'=0, J'=1, [ 1-C==0 && Q==0 && E>=0 && 0>=B && 1+E>=1+A && free_8>=1 && 1>=free_13 && free_13>=0 ], cost: 3

     71: f15 -> f36 : A'=1+A, B'=4+A, C'=-2+free_4, D'=0, F'=0, G'=1, H'=free_13, Q'=0, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && 1+E>=1+A && -1+free_4>=1 && 1>=free_13 && free_13>=0 ], cost: 3

     72: f15 -> f36 : C'=-3+C, F'=0, G'=1, H'=free_13, Q'=0, J'=1, [ Q==0 && E>=0 && 1+E>=A && -2+C>=1 && 1>=free_13 && free_13>=0 ], cost: 3

     73: f15 -> f36 : D'=2+D+E, F'=0, G'=0, H'=0, Q'=0, J'=1+E, [ 0>=C && B>=1 && Q==0 && E>=0 && 0>=1+D && 1+E>=A && 0>=1+D+E ], cost: 3+2*E

     74: f15 -> f36 : B'=-1+B, D'=1+E, F'=free_2, G'=0, H'=0, Q'=0, J'=1+E, [ D>=1 && 0>=C && free_2>=0 && 1>=free_2 && Q==0 && -E==0 && -1+B>=1 && 1+E>=A ], cost: 3+2*E

     75: f15 -> f36 : A'=1+A, B'=4+A, C'=0, D'=1+E, F'=free_3, G'=0, H'=0, Q'=0, J'=1+E, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && -E==0 && 4+A>=1 && 1+E>=1+A ], cost: 3+2*E

     76: f15 -> f36 : C'=-1+C, D'=1+D+E, F'=free_5, G'=0, H'=0, Q'=0, J'=1+E, [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=D && B>=1 && 1+E>=A && 0>=D+E ], cost: 3+2*E

     77: f15 -> f36 : D'=1, F'=0, G'=0, H'=0, Q'=0, J'=-D, [ 0>=C && B>=1 && Q==0 && E>=0 && 0>=1+D && 1+E>=A && E>=-1-D ], cost: 1-2*D

     78: f15 -> f36 : B'=-1+B, D'=1, F'=free_2, G'=0, H'=0, Q'=0, J'=1, [ D>=1 && 0>=C && free_2>=0 && 1>=free_2 && Q==0 && E>=0 && -1+B>=1 && 1+E>=A ], cost: 3

     79: f15 -> f36 : A'=1+A, B'=4+A, C'=0, D'=1, F'=free_3, G'=0, H'=0, Q'=0, J'=1, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && 4+A>=1 && 1+E>=1+A ], cost: 3

     80: f15 -> f36 : C'=-1+C, D'=1, F'=free_5, G'=0, H'=0, Q'=0, J'=1-D, [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=D && B>=1 && 1+E>=A && E>=-D ], cost: 3-2*D

     81: f15 -> f36 : B'=-1-E+B, D'=1, F'=0, G'=1, H'=0, Q'=0, J'=1+E, [ D==0 && 0>=C && Q==0 && E>=0 && 1+E>=A && -1+B>=1 && -1-E+B>=1 ], cost: 3+2*E

     82: f15 -> f36 : B'=-1-E+B, C'=-1+C, D'=1, F'=0, G'=1, H'=0, Q'=0, J'=1+E, [ 1-C==0 && Q==0 && E>=0 && D>=1 && 1+E>=A && -1+B>=1 && -1-E+B>=1 ], cost: 3+2*E

     83: f15 -> f36 : B'=1, D'=1, F'=0, G'=1, H'=0, Q'=0, J'=-1+B, [ D==0 && 0>=C && Q==0 && E>=0 && 1+E>=A && -1+B>=1 && E>=-2+B ], cost: -1+2*B

     84: f15 -> f36 : B'=1, C'=-1+C, D'=1, F'=0, G'=1, H'=0, Q'=0, J'=-1+B, [ 1-C==0 && Q==0 && E>=0 && D>=1 && 1+E>=A && -1+B>=1 && E>=-2+B ], cost: -1+2*B

     85: f15 -> f36 : A'=1+A, B'=4+A, C'=-1+free_4-E, D'=0, F'=free_3, G'=0, H'=0, Q'=0, J'=1+E, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && free_4-E>=1 ], cost: 3+2*E

     86: f15 -> f36 : C'=-2+C-E, F'=free_5, G'=0, H'=0, Q'=0, J'=1+E, [ 1>=free_5 && free_5>=0 && Q==0 && E>=0 && -1+C>=1 && 1+E>=A && -1+C-E>=1 ], cost: 3+2*E

     87: f15 -> f36 : A'=1+A, B'=4+A, C'=0, D'=0, F'=free_3, G'=0, H'=0, Q'=0, J'=free_4, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && E>=-1+free_4 ], cost: 1+2*free_4

     88: f15 -> f36 : C'=0, F'=free_5, G'=0, H'=0, Q'=0, J'=-1+C, [ 1>=free_5 && free_5>=0 && Q==0 && E>=0 && -1+C>=1 && 1+E>=A && E>=-2+C ], cost: -1+2*C

     89: f15 -> f36 : A'=1+A, B'=4+A, C'=-1+free_4-E, D'=0, F'=1, G'=1, H'=0, Q'=0, J'=1+E, [ 0>=C && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && free_4-E>=1 ], cost: 3+2*E

     90: f15 -> f36 : C'=-2+C-E, F'=1, G'=1, H'=0, Q'=0, J'=1+E, [ Q==0 && E>=0 && -1+C>=1 && 1+E>=A && -1+C-E>=1 ], cost: 3+2*E

     91: f15 -> f36 : A'=1+A, B'=4+A, C'=0, D'=0, F'=1, G'=1, H'=0, Q'=0, J'=free_4, [ 0>=C && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && E>=-1+free_4 ], cost: 1+2*free_4

     92: f15 -> f36 : C'=0, F'=1, G'=1, H'=0, Q'=0, J'=-1+C, [ Q==0 && E>=0 && -1+C>=1 && 1+E>=A && E>=-2+C ], cost: -1+2*C

     37: f36 -> f15 : Q'=1, [ 0>=H && J>=1+E && 1+E>=A ], cost: 2

     38: f36 -> f15 : [ H>=1 && 1+E>=A ], cost: 2



Eliminated locations (on tree-shaped paths):

   Start location: f0

      0: f0 -> f15 : A'=1, B'=4, C'=free_1, D'=0, E'=free, F'=0, G'=0, H'=0, Q'=0, J'=0, [ free_1>=0 && free>=0 ], cost: 1

     93: f15 -> f15 : D'=1+D, F'=0, G'=0, H'=0, Q'=1, J'=0, [ 0>=D && 0>=C && B>=1 && Q==0 && 0>=1+E && 1+E>=A ], cost: 3

     94: f15 -> f15 : B'=-1+B, D'=0, F'=free_2, G'=0, H'=0, Q'=1, J'=0, [ D>=1 && 0>=C && free_2>=0 && B>=1 && 1>=free_2 && Q==0 && 0>=1+E && 1+E>=A ], cost: 3

     95: f15 -> f15 : A'=1+A, B'=4+A, C'=free_4, D'=0, F'=free_3, G'=0, H'=0, Q'=1, J'=0, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && free_4>=0 && Q==0 && 0>=1+E && 1+E>=1+A ], cost: 3

     96: f15 -> f15 : C'=-1+C, F'=free_5, G'=0, H'=0, Q'=1, J'=0, [ C>=1 && 1>=free_5 && free_5>=0 && Q==0 && 0>=1+E && 1+E>=A ], cost: 3

     97: f15 -> f15 : B'=-1+B, D'=0, F'=0, G'=0, H'=0, Q'=1, J'=1, [ D==0 && 0>=C && B>=1 && Q==0 && E>=0 && 1+E>=A && 1>=1+E ], cost: 5

     98: f15 -> f15 : B'=-1+B, C'=-1+C, D'=0, F'=free_5, G'=0, H'=0, Q'=1, J'=1, [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && D>=1 && B>=1 && 1+E>=A && 1>=1+E ], cost: 5

     99: f15 -> f15 : B'=-1+B, C'=-1+C, D'=0, F'=1, G'=1, H'=0, Q'=1, J'=1, [ 1-C==0 && Q==0 && E>=0 && D>=1 && B>=1 && 1+E>=A && 1>=1+E ], cost: 5

    100: f15 -> f15 : A'=1+A, B'=4+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=1, J'=1, [ D==0 && 0>=C && Q==0 && E>=0 && 1-B==0 && E>=A && free_11>=0 && free_12>=0 && 0>=free_11 && 1>=1+E ], cost: 5

    101: f15 -> f15 : A'=1+A, B'=4+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=0, J'=1, [ D==0 && 0>=C && Q==0 && E>=0 && 1-B==0 && E>=A && 1>=free_11 && free_12>=0 && free_11>=1 ], cost: 5

    102: f15 -> f15 : A'=1+A, B'=4+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=1, J'=1, [ 1-C==0 && Q==0 && E>=0 && D>=1 && 1-B==0 && E>=A && free_11>=0 && free_12>=0 && 0>=free_11 && 1>=1+E ], cost: 5

    103: f15 -> f15 : A'=1+A, B'=4+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=0, J'=1, [ 1-C==0 && Q==0 && E>=0 && D>=1 && 1-B==0 && E>=A && 1>=free_11 && free_12>=0 && free_11>=1 ], cost: 5

    104: f15 -> f15 : A'=1+A, B'=4+A, C'=free_8, D'=0, F'=free_2, G'=0, H'=0, Q'=1, J'=1, [ D>=1 && 0>=C && free_2>=0 && 1-B==0 && 1>=free_2 && Q==0 && E>=0 && free_8>=0 && 1+E>=1+A && 1>=1+E ], cost: 5

    105: f15 -> f15 : A'=2+A, B'=5+A, C'=free_8, D'=0, F'=free_3, G'=0, H'=0, Q'=1, J'=1, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && 0>=4+A && free_8>=0 && 1+E>=2+A && 1>=1+E ], cost: 5

    106: f15 -> f15 : A'=1+A, B'=4+A, C'=free_8, D'=0, F'=free_5, G'=0, H'=0, Q'=1, J'=1, [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=B && free_8>=0 && 1+E>=1+A && 1>=1+E ], cost: 5

    107: f15 -> f15 : A'=1+A, B'=4+A, C'=free_8, D'=0, F'=1, G'=1, H'=0, Q'=1, J'=1, [ D>=1 && 0>=C && 1-B==0 && Q==0 && E>=0 && free_8>=0 && 1+E>=1+A && 1>=1+E ], cost: 5

    108: f15 -> f15 : A'=2+A, B'=5+A, C'=free_8, D'=0, F'=1, G'=1, H'=0, Q'=1, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && 0>=4+A && free_8>=0 && 1+E>=2+A && 1>=1+E ], cost: 5

    109: f15 -> f15 : A'=1+A, B'=4+A, C'=free_8, D'=0, F'=1, G'=1, H'=0, Q'=1, J'=1, [ 1-C==0 && Q==0 && E>=0 && 0>=B && free_8>=0 && 1+E>=1+A && 1>=1+E ], cost: 5

    110: f15 -> f15 : A'=1+A, B'=4+A, C'=0, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=1, [ D>=1 && 0>=C && 1-B==0 && Q==0 && E>=0 && 1+E>=1+A && 4+A>=1 && 1>=1+E ], cost: 5

    111: f15 -> f15 : A'=2+A, B'=5+A, C'=0, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && 4+A==0 && 1+E>=2+A && 1>=1+E ], cost: 5

    112: f15 -> f15 : A'=1+A, B'=4+A, C'=0, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=1, [ 1-C==0 && Q==0 && E>=0 && 0>=B && 1+E>=1+A && 4+A>=1 && 1>=1+E ], cost: 5

    113: f15 -> f15 : A'=2+A, B'=5+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=1, J'=1, [ D>=1 && 0>=C && 1-B==0 && Q==0 && E>=0 && E>=1+A && free_11>=0 && 0>=4+A && free_12>=0 && 0>=free_11 && 1>=1+E ], cost: 5

    114: f15 -> f15 : A'=2+A, B'=5+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=0, J'=1, [ D>=1 && 0>=C && 1-B==0 && Q==0 && E>=0 && E>=1+A && 1>=free_11 && 0>=4+A && free_12>=0 && free_11>=1 ], cost: 5

    115: f15 -> f15 : A'=3+A, B'=6+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=1, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && E>=2+A && free_11>=0 && 0>=5+A && free_12>=0 && 0>=free_11 && 1>=1+E ], cost: 5

    116: f15 -> f15 : A'=3+A, B'=6+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=0, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && E>=2+A && 1>=free_11 && 0>=5+A && free_12>=0 && free_11>=1 ], cost: 5

    117: f15 -> f15 : A'=2+A, B'=5+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=1, J'=1, [ 1-C==0 && Q==0 && E>=0 && 0>=B && E>=1+A && free_11>=0 && 0>=4+A && free_12>=0 && 0>=free_11 && 1>=1+E ], cost: 5

    118: f15 -> f15 : A'=2+A, B'=5+A, C'=free_12, D'=0, F'=0, G'=1, H'=free_11, Q'=0, J'=1, [ 1-C==0 && Q==0 && E>=0 && 0>=B && E>=1+A && 1>=free_11 && 0>=4+A && free_12>=0 && free_11>=1 ], cost: 5

    119: f15 -> f15 : A'=1+A, B'=4+A, C'=-1+free_8, D'=0, F'=0, G'=1, H'=free_13, Q'=1, J'=1, [ D>=1 && 0>=C && 1-B==0 && Q==0 && E>=0 && 1+E>=1+A && free_8>=1 && free_13>=0 && 0>=free_13 && 1>=1+E ], cost: 5

    120: f15 -> f15 : A'=1+A, B'=4+A, C'=-1+free_8, D'=0, F'=0, G'=1, H'=free_13, Q'=0, J'=1, [ D>=1 && 0>=C && 1-B==0 && Q==0 && E>=0 && 1+E>=1+A && free_8>=1 && 1>=free_13 && free_13>=1 ], cost: 5

    121: f15 -> f15 : A'=2+A, B'=5+A, C'=-1+free_8, D'=0, F'=0, G'=1, H'=free_13, Q'=1, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && 0>=4+A && 1+E>=2+A && free_8>=1 && free_13>=0 && 0>=free_13 && 1>=1+E ], cost: 5

    122: f15 -> f15 : A'=2+A, B'=5+A, C'=-1+free_8, D'=0, F'=0, G'=1, H'=free_13, Q'=0, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && 0>=4+A && 1+E>=2+A && free_8>=1 && 1>=free_13 && free_13>=1 ], cost: 5

    123: f15 -> f15 : A'=1+A, B'=4+A, C'=-1+free_8, D'=0, F'=0, G'=1, H'=free_13, Q'=1, J'=1, [ 1-C==0 && Q==0 && E>=0 && 0>=B && 1+E>=1+A && free_8>=1 && free_13>=0 && 0>=free_13 && 1>=1+E ], cost: 5

    124: f15 -> f15 : A'=1+A, B'=4+A, C'=-1+free_8, D'=0, F'=0, G'=1, H'=free_13, Q'=0, J'=1, [ 1-C==0 && Q==0 && E>=0 && 0>=B && 1+E>=1+A && free_8>=1 && 1>=free_13 && free_13>=1 ], cost: 5

    125: f15 -> f15 : A'=1+A, B'=4+A, C'=-2+free_4, D'=0, F'=0, G'=1, H'=free_13, Q'=1, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && 1+E>=1+A && -1+free_4>=1 && free_13>=0 && 0>=free_13 && 1>=1+E ], cost: 5

    126: f15 -> f15 : A'=1+A, B'=4+A, C'=-2+free_4, D'=0, F'=0, G'=1, H'=free_13, Q'=0, J'=1, [ 0>=C && 0>=B && Q==0 && E>=0 && 1+E>=1+A && -1+free_4>=1 && 1>=free_13 && free_13>=1 ], cost: 5

    127: f15 -> f15 : C'=-3+C, F'=0, G'=1, H'=free_13, Q'=1, J'=1, [ Q==0 && E>=0 && 1+E>=A && -2+C>=1 && free_13>=0 && 0>=free_13 && 1>=1+E ], cost: 5

    128: f15 -> f15 : C'=-3+C, F'=0, G'=1, H'=free_13, Q'=0, J'=1, [ Q==0 && E>=0 && 1+E>=A && -2+C>=1 && 1>=free_13 && free_13>=1 ], cost: 5

    129: f15 -> f15 : D'=2+D+E, F'=0, G'=0, H'=0, Q'=1, J'=1+E, [ 0>=C && B>=1 && Q==0 && E>=0 && 0>=1+D && 1+E>=A && 0>=1+D+E ], cost: 5+2*E

    130: f15 -> f15 : B'=-1+B, D'=1+E, F'=free_2, G'=0, H'=0, Q'=1, J'=1+E, [ D>=1 && 0>=C && free_2>=0 && 1>=free_2 && Q==0 && -E==0 && -1+B>=1 && 1+E>=A ], cost: 5+2*E

    131: f15 -> f15 : A'=1+A, B'=4+A, C'=0, D'=1+E, F'=free_3, G'=0, H'=0, Q'=1, J'=1+E, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && -E==0 && 4+A>=1 && 1+E>=1+A ], cost: 5+2*E

    132: f15 -> f15 : C'=-1+C, D'=1+D+E, F'=free_5, G'=0, H'=0, Q'=1, J'=1+E, [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=D && B>=1 && 1+E>=A && 0>=D+E ], cost: 5+2*E

    133: f15 -> f15 : D'=1, F'=0, G'=0, H'=0, Q'=1, J'=-D, [ 0>=C && B>=1 && Q==0 && E>=0 && 0>=1+D && 1+E>=A && E>=-1-D && -D>=1+E ], cost: 3-2*D

    134: f15 -> f15 : B'=-1+B, D'=1, F'=free_2, G'=0, H'=0, Q'=1, J'=1, [ D>=1 && 0>=C && free_2>=0 && 1>=free_2 && Q==0 && E>=0 && -1+B>=1 && 1+E>=A && 1>=1+E ], cost: 5

    135: f15 -> f15 : A'=1+A, B'=4+A, C'=0, D'=1, F'=free_3, G'=0, H'=0, Q'=1, J'=1, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && 4+A>=1 && 1+E>=1+A && 1>=1+E ], cost: 5

    136: f15 -> f15 : C'=-1+C, D'=1, F'=free_5, G'=0, H'=0, Q'=1, J'=1-D, [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=D && B>=1 && 1+E>=A && E>=-D && 1-D>=1+E ], cost: 5-2*D

    137: f15 -> f15 : B'=-1-E+B, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=1+E, [ D==0 && 0>=C && Q==0 && E>=0 && 1+E>=A && -1+B>=1 && -1-E+B>=1 ], cost: 5+2*E

    138: f15 -> f15 : B'=-1-E+B, C'=-1+C, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=1+E, [ 1-C==0 && Q==0 && E>=0 && D>=1 && 1+E>=A && -1+B>=1 && -1-E+B>=1 ], cost: 5+2*E

    139: f15 -> f15 : B'=1, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=-1+B, [ D==0 && 0>=C && Q==0 && E>=0 && 1+E>=A && -1+B>=1 && E>=-2+B && -1+B>=1+E ], cost: 1+2*B

    140: f15 -> f15 : B'=1, C'=-1+C, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=-1+B, [ 1-C==0 && Q==0 && E>=0 && D>=1 && 1+E>=A && -1+B>=1 && E>=-2+B && -1+B>=1+E ], cost: 1+2*B

    141: f15 -> f15 : A'=1+A, B'=4+A, C'=-1+free_4-E, D'=0, F'=free_3, G'=0, H'=0, Q'=1, J'=1+E, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && free_4-E>=1 ], cost: 5+2*E

    142: f15 -> f15 : C'=-2+C-E, F'=free_5, G'=0, H'=0, Q'=1, J'=1+E, [ 1>=free_5 && free_5>=0 && Q==0 && E>=0 && -1+C>=1 && 1+E>=A && -1+C-E>=1 ], cost: 5+2*E

    143: f15 -> f15 : A'=1+A, B'=4+A, C'=0, D'=0, F'=free_3, G'=0, H'=0, Q'=1, J'=free_4, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && E>=-1+free_4 && free_4>=1+E ], cost: 3+2*free_4

    144: f15 -> f15 : C'=0, F'=free_5, G'=0, H'=0, Q'=1, J'=-1+C, [ 1>=free_5 && free_5>=0 && Q==0 && E>=0 && -1+C>=1 && 1+E>=A && E>=-2+C && -1+C>=1+E ], cost: 1+2*C

    145: f15 -> f15 : A'=1+A, B'=4+A, C'=-1+free_4-E, D'=0, F'=1, G'=1, H'=0, Q'=1, J'=1+E, [ 0>=C && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && free_4-E>=1 ], cost: 5+2*E

    146: f15 -> f15 : C'=-2+C-E, F'=1, G'=1, H'=0, Q'=1, J'=1+E, [ Q==0 && E>=0 && -1+C>=1 && 1+E>=A && -1+C-E>=1 ], cost: 5+2*E

    147: f15 -> f15 : A'=1+A, B'=4+A, C'=0, D'=0, F'=1, G'=1, H'=0, Q'=1, J'=free_4, [ 0>=C && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && E>=-1+free_4 && free_4>=1+E ], cost: 3+2*free_4

    148: f15 -> f15 : C'=0, F'=1, G'=1, H'=0, Q'=1, J'=-1+C, [ Q==0 && E>=0 && -1+C>=1 && 1+E>=A && E>=-2+C && -1+C>=1+E ], cost: 1+2*C

    149: f15 -> [7] : [ 0>=C && B>=1 && Q==0 && E>=0 && 0>=1+D && 1+E>=A && 0>=1+D+E ], cost: 3+2*E

    150: f15 -> [7] : [ D>=1 && 0>=C && free_2>=0 && 1>=free_2 && Q==0 && -E==0 && -1+B>=1 && 1+E>=A ], cost: 3+2*E

    151: f15 -> [7] : [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && -E==0 && 4+A>=1 && 1+E>=1+A ], cost: 3+2*E

    152: f15 -> [7] : [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=D && B>=1 && 1+E>=A && 0>=D+E ], cost: 3+2*E

    153: f15 -> [7] : [ 0>=C && B>=1 && Q==0 && E>=0 && 0>=1+D && 1+E>=A && E>=-1-D ], cost: 1-2*D

    154: f15 -> [7] : [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=D && B>=1 && 1+E>=A && E>=-D ], cost: 3-2*D

    155: f15 -> [7] : [ D==0 && 0>=C && Q==0 && E>=0 && 1+E>=A && -1+B>=1 && -1-E+B>=1 ], cost: 3+2*E

    156: f15 -> [7] : [ 1-C==0 && Q==0 && E>=0 && D>=1 && 1+E>=A && -1+B>=1 && -1-E+B>=1 ], cost: 3+2*E

    157: f15 -> [7] : [ D==0 && 0>=C && Q==0 && E>=0 && 1+E>=A && -1+B>=1 && E>=-2+B ], cost: -1+2*B

    158: f15 -> [7] : [ 1-C==0 && Q==0 && E>=0 && D>=1 && 1+E>=A && -1+B>=1 && E>=-2+B ], cost: -1+2*B

    159: f15 -> [7] : [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && free_4-E>=1 ], cost: 3+2*E

    160: f15 -> [7] : [ 1>=free_5 && free_5>=0 && Q==0 && E>=0 && -1+C>=1 && 1+E>=A && -1+C-E>=1 ], cost: 3+2*E

    161: f15 -> [7] : [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && E>=-1+free_4 ], cost: 1+2*free_4

    162: f15 -> [7] : [ 1>=free_5 && free_5>=0 && Q==0 && E>=0 && -1+C>=1 && 1+E>=A && E>=-2+C ], cost: -1+2*C

    163: f15 -> [7] : [ 0>=C && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && free_4-E>=1 ], cost: 3+2*E

    164: f15 -> [7] : [ Q==0 && E>=0 && -1+C>=1 && 1+E>=A && -1+C-E>=1 ], cost: 3+2*E

    165: f15 -> [7] : [ 0>=C && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && E>=-1+free_4 ], cost: 1+2*free_4

    166: f15 -> [7] : [ Q==0 && E>=0 && -1+C>=1 && 1+E>=A && E>=-2+C ], cost: -1+2*C



Applied pruning (of leafs and parallel rules):

   Start location: f0

      0: f0 -> f15 : A'=1, B'=4, C'=free_1, D'=0, E'=free, F'=0, G'=0, H'=0, Q'=0, J'=0, [ free_1>=0 && free>=0 ], cost: 1

    133: f15 -> f15 : D'=1, F'=0, G'=0, H'=0, Q'=1, J'=-D, [ 0>=C && B>=1 && Q==0 && E>=0 && 0>=1+D && 1+E>=A && E>=-1-D && -D>=1+E ], cost: 3-2*D

    136: f15 -> f15 : C'=-1+C, D'=1, F'=free_5, G'=0, H'=0, Q'=1, J'=1-D, [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=D && B>=1 && 1+E>=A && E>=-D && 1-D>=1+E ], cost: 5-2*D

    137: f15 -> f15 : B'=-1-E+B, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=1+E, [ D==0 && 0>=C && Q==0 && E>=0 && 1+E>=A && -1+B>=1 && -1-E+B>=1 ], cost: 5+2*E

    139: f15 -> f15 : B'=1, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=-1+B, [ D==0 && 0>=C && Q==0 && E>=0 && 1+E>=A && -1+B>=1 && E>=-2+B && -1+B>=1+E ], cost: 1+2*B

    141: f15 -> f15 : A'=1+A, B'=4+A, C'=-1+free_4-E, D'=0, F'=free_3, G'=0, H'=0, Q'=1, J'=1+E, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && free_4-E>=1 ], cost: 5+2*E

    152: f15 -> [7] : [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=D && B>=1 && 1+E>=A && 0>=D+E ], cost: 3+2*E

    153: f15 -> [7] : [ 0>=C && B>=1 && Q==0 && E>=0 && 0>=1+D && 1+E>=A && E>=-1-D ], cost: 1-2*D

    156: f15 -> [7] : [ 1-C==0 && Q==0 && E>=0 && D>=1 && 1+E>=A && -1+B>=1 && -1-E+B>=1 ], cost: 3+2*E

    159: f15 -> [7] : [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && free_4-E>=1 ], cost: 3+2*E

    165: f15 -> [7] : [ 0>=C && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && E>=-1+free_4 ], cost: 1+2*free_4



Accelerating simple loops of location 1.

   Simplified some of the simple loops (and removed duplicate rules).

   Accelerating the following rules:

    133: f15 -> f15 : D'=1, F'=0, G'=0, H'=0, Q'=1, J'=-D, [ 0>=C && B>=1 && Q==0 && E>=0 && 0>=1+D && 1+E>=A && -1-D-E==0 ], cost: 3-2*D

    136: f15 -> f15 : C'=-1+C, D'=1, F'=free_5, G'=0, H'=0, Q'=1, J'=1-D, [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=D && B>=1 && 1+E>=A && -D-E==0 ], cost: 5-2*D

    137: f15 -> f15 : B'=-1-E+B, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=1+E, [ D==0 && 0>=C && Q==0 && E>=0 && 1+E>=A && -1+B>=1 && -1-E+B>=1 ], cost: 5+2*E

    139: f15 -> f15 : B'=1, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=-1+B, [ D==0 && 0>=C && Q==0 && E>=0 && 1+E>=A && -1+B>=1 && -2-E+B==0 ], cost: 1+2*B

    141: f15 -> f15 : A'=1+A, B'=4+A, C'=-1+free_4-E, D'=0, F'=free_3, G'=0, H'=0, Q'=1, J'=1+E, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && free_4-E>=1 ], cost: 5+2*E



   Accelerated rule 133 with metering function -Q, yielding the new rule 167.

   Accelerated rule 136 with metering function meter_23 (where 2*meter_23==-1-Q+C), yielding the new rule 168.

   Accelerated rule 137 with metering function meter_24 (where 2*meter_24==-Q-D), yielding the new rule 169.

   Accelerated rule 139 with metering function meter_25 (where 2*meter_25==-Q-D), yielding the new rule 170.

   Accelerated rule 141 with metering function -Q, yielding the new rule 171.

   Removing the simple loops: 133 136 137 139 141.



Accelerated all simple loops using metering functions (where possible):

   Start location: f0

      0: f0 -> f15 : A'=1, B'=4, C'=free_1, D'=0, E'=free, F'=0, G'=0, H'=0, Q'=0, J'=0, [ free_1>=0 && free>=0 ], cost: 1

    152: f15 -> [7] : [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=D && B>=1 && 1+E>=A && 0>=D+E ], cost: 3+2*E

    153: f15 -> [7] : [ 0>=C && B>=1 && Q==0 && E>=0 && 0>=1+D && 1+E>=A && E>=-1-D ], cost: 1-2*D

    156: f15 -> [7] : [ 1-C==0 && Q==0 && E>=0 && D>=1 && 1+E>=A && -1+B>=1 && -1-E+B>=1 ], cost: 3+2*E

    159: f15 -> [7] : [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && free_4-E>=1 ], cost: 3+2*E

    165: f15 -> [7] : [ 0>=C && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && E>=-1+free_4 ], cost: 1+2*free_4

    167: f15 -> f15 : D'=1, F'=0, G'=0, H'=0, Q'=1, J'=-1, [ 0>=C && B>=1 && Q==0 && E>=0 && 0>=1+D && 1+E>=A && -1-D-E==0 && -Q>=1 ], cost: -Q

    168: f15 -> f15 : C'=C-meter_23, D'=1, F'=free_5, G'=0, H'=0, Q'=1, J'=0, [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=D && B>=1 && 1+E>=A && -D-E==0 && 2*meter_23==-1-Q+C && meter_23>=1 ], cost: 3*meter_23

    169: f15 -> f15 : B'=-meter_24*E-meter_24+B, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=1+E, [ D==0 && 0>=C && Q==0 && E>=0 && 1+E>=A && -1+B>=1 && -1-E+B>=1 && 2*meter_24==-Q-D && meter_24>=1 ], cost: 2*meter_24*E+5*meter_24

    170: f15 -> f15 : B'=1, D'=1, F'=0, G'=1, H'=0, Q'=1, J'=0, [ D==0 && 0>=C && Q==0 && E>=0 && 1+E>=A && -1+B>=1 && -2-E+B==0 && 2*meter_25==-Q-D && meter_25>=1 ], cost: 3*meter_25

    171: f15 -> f15 : A'=-Q+A, B'=3-Q+A, C'=-1+free_4-E, D'=0, F'=free_3, G'=0, H'=0, Q'=1, J'=1+E, [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && free_4-E>=1 && -Q>=1 ], cost: -5*Q-2*Q*E



Chained accelerated rules (with incoming rules):

   Start location: f0

      0: f0 -> f15 : A'=1, B'=4, C'=free_1, D'=0, E'=free, F'=0, G'=0, H'=0, Q'=0, J'=0, [ free_1>=0 && free>=0 ], cost: 1

    152: f15 -> [7] : [ 1-C==0 && 1>=free_5 && free_5>=0 && Q==0 && E>=0 && 0>=D && B>=1 && 1+E>=A && 0>=D+E ], cost: 3+2*E

    153: f15 -> [7] : [ 0>=C && B>=1 && Q==0 && E>=0 && 0>=1+D && 1+E>=A && E>=-1-D ], cost: 1-2*D

    156: f15 -> [7] : [ 1-C==0 && Q==0 && E>=0 && D>=1 && 1+E>=A && -1+B>=1 && -1-E+B>=1 ], cost: 3+2*E

    159: f15 -> [7] : [ 0>=C && free_3>=0 && 1>=free_3 && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && free_4-E>=1 ], cost: 3+2*E

    165: f15 -> [7] : [ 0>=C && 0>=B && Q==0 && E>=0 && free_4>=1 && 1+E>=1+A && E>=-1+free_4 ], cost: 1+2*free_4



Eliminated locations (on tree-shaped paths):

   Start location: f0

    172: f0 -> [7] : A'=1, B'=4, C'=free_1, D'=0, E'=free, F'=0, G'=0, H'=0, Q'=0, J'=0, [ free>=0 && 1-free_1==0 && 1>=free_5 && free_5>=0 && 0>=free ], cost: 4+2*free



### Computing asymptotic complexity ###



Fully simplified ITS problem

   Start location: f0

    172: f0 -> [7] : A'=1, B'=4, C'=free_1, D'=0, E'=free, F'=0, G'=0, H'=0, Q'=0, J'=0, [ free>=0 && 1-free_1==0 && 1>=free_5 && free_5>=0 && 0>=free ], cost: 4+2*free



Computing asymptotic complexity for rule 172

   Could not solve the limit problem.

   Resulting cost 0 has complexity: Unknown



Obtained the following overall complexity (w.r.t. the length of the input n):

   Complexity:  Unknown

   Cpx degree:  ?

   Solved cost: 0

   Rule cost:   0

   Rule guard:  []



WORST_CASE(Omega(0),?)


----------------------------------------

(2)
BOUNDS(1, INF)