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


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


WORST_CASE(NON_POLY, ?)
proof of /export/starexec/sandbox2/benchmark/theBenchmark.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


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

(0) CpxIntTrs
(1) Loat Proof [FINISHED, 8379 ms]
(2) BOUNDS(INF, INF)


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f2(A, B + 1, B1, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: A >= B
f10(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f19(A, B, C, B1, C1, D1, E1, F1, 1, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: B >= 1
f19(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f23(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: G >= J && I >= J + 1
f23(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f26(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: J + F >= 2 + K
f26(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f26(A, B, C, D, E, F, G, H, I, J, K, L + G, I + L - J, B1, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: H >= L
f19(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f41(A, B, C, D, E, F, G, H, I, J, K, L, M, N, B1, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: G >= J && J >= I
f41(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f41(A, B, C, D, E, F, G, H, I - O, J, K, L, M, N, B1, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: O >= F && I >= 1 + O
f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f63(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, B1, C1, D1, E1, F1, 1, 0, X, Y, Z, A1)) :|: G >= P + 1
f63(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f66(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: P >= L
f66(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f69(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: L + F >= 2 + K
f69(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f69(A, B, C, D, E, F, G, H, I, J + Q, K, L, M, B1, O, P, Q, R, S, T, U, V, W, J, J + P, C1, A1)) :|: H >= J
f69(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f66(A, B, C, D, E, F, G, H, I, J, K + 2, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: J >= 1 + H
f66(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f63(A, B, C, D, E, F, G, H, I, J, K, L + F, M, N, O, P, Q, R, V, T, U, B1, C1, X, Y, Z, A1)) :|: K + 1 >= L + F
f63(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, Q, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: L >= 1 + P
f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f10(A, B - 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, B1)) :|: P >= G
f41(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f19(A, B, C, D, E, F, G, H, I + O, J + F, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: O >= F && O >= I
f41(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f19(A, B, C, D, E, F, G, H, I + O, J + F, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: F >= O + 1
f26(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f23(A, B, C, D, E, F, G, H, I, J, K + 2, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: L >= 1 + H
f23(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f41(A, B, C, D, E, F, G, H, I, J, K, L, M, N, B1, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: K + 1 >= J + F
f19(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, F, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: J >= 1 + G
f10(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f1(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: 0 >= B
f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f10(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, 1)) :|: B >= 1 + A
start(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1) -> Com_1(f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1)) :|: TRUE

The start-symbols are:[start_27]


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

(1) Loat Proof (FINISHED)


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



Initial linear ITS problem

   Start location: start

      0: f2 -> f2 : B'=1+B, C'=free, [ A>=B ], cost: 1

     21: f2 -> f10 : A1'=1, [ B>=1+A ], cost: 1

      1: f10 -> f19 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, [ B>=1 ], cost: 1

     20: f10 -> f1 : A1'=B, B'=C, B1'=D, C'=E, C1'=F, D'=G, D1'=H, E'=Q, E1'=J, F'=K, F1'=L, G'=M, H'=N, Q'=O, J'=P, K'=Q_1, L'=R, M'=S, N'=T, O'=U, P'=V, Q_1'=W, R'=X, S'=Y, T'=Z, U'=A1, [ 0>=B ], cost: 1

      2: f19 -> f23 : [ G>=J && Q>=1+J ], cost: 1

      5: f19 -> f41 : O'=free_7, [ G>=J && J>=Q ], cost: 1

     19: f19 -> f53 : P'=F, [ J>=1+G ], cost: 1

      3: f23 -> f26 : [ J+F>=2+K ], cost: 1

     18: f23 -> f41 : O'=free_19, [ 1+K>=J+F ], cost: 1

      4: f26 -> f26 : L'=G+L, M'=-J+L+Q, N'=free_6, [ H>=L ], cost: 1

     17: f26 -> f23 : K'=2+K, [ L>=1+H ], cost: 1

      6: f41 -> f41 : Q'=-O+Q, O'=free_8, [ O>=F && Q>=1+O ], cost: 1

     15: f41 -> f19 : Q'=O+Q, J'=J+F, [ O>=F && O>=Q ], cost: 1

     16: f41 -> f19 : Q'=O+Q, J'=J+F, [ F>=1+O ], cost: 1

      7: f53 -> f63 : Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P ], cost: 1

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

      8: f63 -> f66 : [ P>=L ], cost: 1

     13: f63 -> f53 : P'=Q_1, [ L>=1+P ], cost: 1

      9: f66 -> f69 : [ F+L>=2+K ], cost: 1

     12: f66 -> f63 : L'=F+L, S'=V, V'=free_17, W'=free_16, [ 1+K>=F+L ], cost: 1

     10: f69 -> f69 : J'=J+Q_1, N'=free_15, X'=J, Y'=J+P, Z'=free_14, [ H>=J ], cost: 1

     11: f69 -> f66 : K'=2+K, [ J>=1+H ], cost: 1

     22: start -> f2 : [], cost: 1



Checking for constant complexity:

   The following rule is satisfiable with cost >= 1, yielding constant complexity:

     22: start -> f2 : [], cost: 1



Removed unreachable and leaf rules:

   Start location: start

      0: f2 -> f2 : B'=1+B, C'=free, [ A>=B ], cost: 1

     21: f2 -> f10 : A1'=1, [ B>=1+A ], cost: 1

      1: f10 -> f19 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, [ B>=1 ], cost: 1

      2: f19 -> f23 : [ G>=J && Q>=1+J ], cost: 1

      5: f19 -> f41 : O'=free_7, [ G>=J && J>=Q ], cost: 1

     19: f19 -> f53 : P'=F, [ J>=1+G ], cost: 1

      3: f23 -> f26 : [ J+F>=2+K ], cost: 1

     18: f23 -> f41 : O'=free_19, [ 1+K>=J+F ], cost: 1

      4: f26 -> f26 : L'=G+L, M'=-J+L+Q, N'=free_6, [ H>=L ], cost: 1

     17: f26 -> f23 : K'=2+K, [ L>=1+H ], cost: 1

      6: f41 -> f41 : Q'=-O+Q, O'=free_8, [ O>=F && Q>=1+O ], cost: 1

     15: f41 -> f19 : Q'=O+Q, J'=J+F, [ O>=F && O>=Q ], cost: 1

     16: f41 -> f19 : Q'=O+Q, J'=J+F, [ F>=1+O ], cost: 1

      7: f53 -> f63 : Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P ], cost: 1

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

      8: f63 -> f66 : [ P>=L ], cost: 1

     13: f63 -> f53 : P'=Q_1, [ L>=1+P ], cost: 1

      9: f66 -> f69 : [ F+L>=2+K ], cost: 1

     12: f66 -> f63 : L'=F+L, S'=V, V'=free_17, W'=free_16, [ 1+K>=F+L ], cost: 1

     10: f69 -> f69 : J'=J+Q_1, N'=free_15, X'=J, Y'=J+P, Z'=free_14, [ H>=J ], cost: 1

     11: f69 -> f66 : K'=2+K, [ J>=1+H ], cost: 1

     22: start -> f2 : [], cost: 1



### Simplification by acceleration and chaining ###



Accelerating simple loops of location 0.

   Accelerating the following rules:

      0: f2 -> f2 : B'=1+B, C'=free, [ A>=B ], cost: 1



   Accelerated rule 0 with metering function 1-B+A, yielding the new rule 23.

   Removing the simple loops: 0.



Accelerating simple loops of location 4.

   Accelerating the following rules:

      4: f26 -> f26 : L'=G+L, M'=-J+L+Q, N'=free_6, [ H>=L ], cost: 1



   Found no metering function for rule 4.

   Removing the simple loops:.



Accelerating simple loops of location 5.

   Accelerating the following rules:

      6: f41 -> f41 : Q'=-O+Q, O'=free_8, [ O>=F && Q>=1+O ], cost: 1



   Found no metering function for rule 6.

   Removing the simple loops:.



Accelerating simple loops of location 9.

   Accelerating the following rules:

     10: f69 -> f69 : J'=J+Q_1, N'=free_15, X'=J, Y'=J+P, Z'=free_14, [ H>=J ], cost: 1



   Found no metering function for rule 10.

   Removing the simple loops:.



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

   Start location: start

     21: f2 -> f10 : A1'=1, [ B>=1+A ], cost: 1

     23: f2 -> f2 : B'=1+A, C'=free, [ A>=B ], cost: 1-B+A

      1: f10 -> f19 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, [ B>=1 ], cost: 1

      2: f19 -> f23 : [ G>=J && Q>=1+J ], cost: 1

      5: f19 -> f41 : O'=free_7, [ G>=J && J>=Q ], cost: 1

     19: f19 -> f53 : P'=F, [ J>=1+G ], cost: 1

      3: f23 -> f26 : [ J+F>=2+K ], cost: 1

     18: f23 -> f41 : O'=free_19, [ 1+K>=J+F ], cost: 1

      4: f26 -> f26 : L'=G+L, M'=-J+L+Q, N'=free_6, [ H>=L ], cost: 1

     17: f26 -> f23 : K'=2+K, [ L>=1+H ], cost: 1

      6: f41 -> f41 : Q'=-O+Q, O'=free_8, [ O>=F && Q>=1+O ], cost: 1

     15: f41 -> f19 : Q'=O+Q, J'=J+F, [ O>=F && O>=Q ], cost: 1

     16: f41 -> f19 : Q'=O+Q, J'=J+F, [ F>=1+O ], cost: 1

      7: f53 -> f63 : Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P ], cost: 1

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

      8: f63 -> f66 : [ P>=L ], cost: 1

     13: f63 -> f53 : P'=Q_1, [ L>=1+P ], cost: 1

      9: f66 -> f69 : [ F+L>=2+K ], cost: 1

     12: f66 -> f63 : L'=F+L, S'=V, V'=free_17, W'=free_16, [ 1+K>=F+L ], cost: 1

     10: f69 -> f69 : J'=J+Q_1, N'=free_15, X'=J, Y'=J+P, Z'=free_14, [ H>=J ], cost: 1

     11: f69 -> f66 : K'=2+K, [ J>=1+H ], cost: 1

     22: start -> f2 : [], cost: 1



Chained accelerated rules (with incoming rules):

   Start location: start

     21: f2 -> f10 : A1'=1, [ B>=1+A ], cost: 1

      1: f10 -> f19 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, [ B>=1 ], cost: 1

      2: f19 -> f23 : [ G>=J && Q>=1+J ], cost: 1

      5: f19 -> f41 : O'=free_7, [ G>=J && J>=Q ], cost: 1

     19: f19 -> f53 : P'=F, [ J>=1+G ], cost: 1

     26: f19 -> f41 : Q'=-free_7+Q, O'=free_8, [ G>=J && J>=Q && free_7>=F && Q>=1+free_7 ], cost: 2

      3: f23 -> f26 : [ J+F>=2+K ], cost: 1

     18: f23 -> f41 : O'=free_19, [ 1+K>=J+F ], cost: 1

     25: f23 -> f26 : L'=G+L, M'=-J+L+Q, N'=free_6, [ J+F>=2+K && H>=L ], cost: 2

     27: f23 -> f41 : Q'=-free_19+Q, O'=free_8, [ 1+K>=J+F && free_19>=F && Q>=1+free_19 ], cost: 2

     17: f26 -> f23 : K'=2+K, [ L>=1+H ], cost: 1

     15: f41 -> f19 : Q'=O+Q, J'=J+F, [ O>=F && O>=Q ], cost: 1

     16: f41 -> f19 : Q'=O+Q, J'=J+F, [ F>=1+O ], cost: 1

      7: f53 -> f63 : Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P ], cost: 1

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

      8: f63 -> f66 : [ P>=L ], cost: 1

     13: f63 -> f53 : P'=Q_1, [ L>=1+P ], cost: 1

      9: f66 -> f69 : [ F+L>=2+K ], cost: 1

     12: f66 -> f63 : L'=F+L, S'=V, V'=free_17, W'=free_16, [ 1+K>=F+L ], cost: 1

     28: f66 -> f69 : J'=J+Q_1, N'=free_15, X'=J, Y'=J+P, Z'=free_14, [ F+L>=2+K && H>=J ], cost: 2

     11: f69 -> f66 : K'=2+K, [ J>=1+H ], cost: 1

     22: start -> f2 : [], cost: 1

     24: start -> f2 : B'=1+A, C'=free, [ A>=B ], cost: 2-B+A



Eliminated locations (on tree-shaped paths):

   Start location: start

      1: f10 -> f19 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, [ B>=1 ], cost: 1

      2: f19 -> f23 : [ G>=J && Q>=1+J ], cost: 1

      5: f19 -> f41 : O'=free_7, [ G>=J && J>=Q ], cost: 1

     19: f19 -> f53 : P'=F, [ J>=1+G ], cost: 1

     26: f19 -> f41 : Q'=-free_7+Q, O'=free_8, [ G>=J && J>=Q && free_7>=F && Q>=1+free_7 ], cost: 2

     18: f23 -> f41 : O'=free_19, [ 1+K>=J+F ], cost: 1

     27: f23 -> f41 : Q'=-free_19+Q, O'=free_8, [ 1+K>=J+F && free_19>=F && Q>=1+free_19 ], cost: 2

     31: f23 -> f23 : K'=2+K, [ J+F>=2+K && L>=1+H ], cost: 2

     32: f23 -> f23 : K'=2+K, L'=G+L, M'=-J+L+Q, N'=free_6, [ J+F>=2+K && H>=L && G+L>=1+H ], cost: 3

     15: f41 -> f19 : Q'=O+Q, J'=J+F, [ O>=F && O>=Q ], cost: 1

     16: f41 -> f19 : Q'=O+Q, J'=J+F, [ F>=1+O ], cost: 1

      7: f53 -> f63 : Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P ], cost: 1

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

      8: f63 -> f66 : [ P>=L ], cost: 1

     13: f63 -> f53 : P'=Q_1, [ L>=1+P ], cost: 1

     12: f66 -> f63 : L'=F+L, S'=V, V'=free_17, W'=free_16, [ 1+K>=F+L ], cost: 1

     33: f66 -> f66 : K'=2+K, [ F+L>=2+K && J>=1+H ], cost: 2

     34: f66 -> f66 : J'=J+Q_1, K'=2+K, N'=free_15, X'=J, Y'=J+P, Z'=free_14, [ F+L>=2+K && H>=J && J+Q_1>=1+H ], cost: 3

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Accelerating simple loops of location 3.

   Accelerating the following rules:

     31: f23 -> f23 : K'=2+K, [ J+F>=2+K && L>=1+H ], cost: 2

     32: f23 -> f23 : K'=2+K, L'=G+L, M'=-J+L+Q, N'=free_6, [ J+F>=2+K && H>=L && G+L>=1+H ], cost: 3



   Accelerated rule 31 with metering function meter (where 2*meter==-1+J-K+F), yielding the new rule 35.

   Found no metering function for rule 32.

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

   Removing the simple loops: 31.



Accelerating simple loops of location 8.

   Accelerating the following rules:

     33: f66 -> f66 : K'=2+K, [ F+L>=2+K && J>=1+H ], cost: 2

     34: f66 -> f66 : J'=J+Q_1, K'=2+K, N'=free_15, X'=J, Y'=J+P, Z'=free_14, [ F+L>=2+K && H>=J && J+Q_1>=1+H ], cost: 3



   Accelerated rule 33 with metering function meter_2 (where 2*meter_2==-1-K+F+L), yielding the new rule 36.

   Found no metering function for rule 34.

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

   Removing the simple loops: 33.



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

   Start location: start

      1: f10 -> f19 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, [ B>=1 ], cost: 1

      2: f19 -> f23 : [ G>=J && Q>=1+J ], cost: 1

      5: f19 -> f41 : O'=free_7, [ G>=J && J>=Q ], cost: 1

     19: f19 -> f53 : P'=F, [ J>=1+G ], cost: 1

     26: f19 -> f41 : Q'=-free_7+Q, O'=free_8, [ G>=J && J>=Q && free_7>=F && Q>=1+free_7 ], cost: 2

     18: f23 -> f41 : O'=free_19, [ 1+K>=J+F ], cost: 1

     27: f23 -> f41 : Q'=-free_19+Q, O'=free_8, [ 1+K>=J+F && free_19>=F && Q>=1+free_19 ], cost: 2

     32: f23 -> f23 : K'=2+K, L'=G+L, M'=-J+L+Q, N'=free_6, [ J+F>=2+K && H>=L && G+L>=1+H ], cost: 3

     35: f23 -> f23 : K'=K+2*meter, [ J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 ], cost: 2*meter

     15: f41 -> f19 : Q'=O+Q, J'=J+F, [ O>=F && O>=Q ], cost: 1

     16: f41 -> f19 : Q'=O+Q, J'=J+F, [ F>=1+O ], cost: 1

      7: f53 -> f63 : Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P ], cost: 1

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

      8: f63 -> f66 : [ P>=L ], cost: 1

     13: f63 -> f53 : P'=Q_1, [ L>=1+P ], cost: 1

     12: f66 -> f63 : L'=F+L, S'=V, V'=free_17, W'=free_16, [ 1+K>=F+L ], cost: 1

     34: f66 -> f66 : J'=J+Q_1, K'=2+K, N'=free_15, X'=J, Y'=J+P, Z'=free_14, [ F+L>=2+K && H>=J && J+Q_1>=1+H ], cost: 3

     36: f66 -> f66 : K'=K+2*meter_2, [ F+L>=2+K && J>=1+H && 2*meter_2==-1-K+F+L && meter_2>=1 ], cost: 2*meter_2

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Chained accelerated rules (with incoming rules):

   Start location: start

      1: f10 -> f19 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, [ B>=1 ], cost: 1

      2: f19 -> f23 : [ G>=J && Q>=1+J ], cost: 1

      5: f19 -> f41 : O'=free_7, [ G>=J && J>=Q ], cost: 1

     19: f19 -> f53 : P'=F, [ J>=1+G ], cost: 1

     26: f19 -> f41 : Q'=-free_7+Q, O'=free_8, [ G>=J && J>=Q && free_7>=F && Q>=1+free_7 ], cost: 2

     37: f19 -> f23 : K'=2+K, L'=G+L, M'=-J+L+Q, N'=free_6, [ G>=J && Q>=1+J && J+F>=2+K && H>=L && G+L>=1+H ], cost: 4

     38: f19 -> f23 : K'=K+2*meter, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 ], cost: 1+2*meter

     18: f23 -> f41 : O'=free_19, [ 1+K>=J+F ], cost: 1

     27: f23 -> f41 : Q'=-free_19+Q, O'=free_8, [ 1+K>=J+F && free_19>=F && Q>=1+free_19 ], cost: 2

     15: f41 -> f19 : Q'=O+Q, J'=J+F, [ O>=F && O>=Q ], cost: 1

     16: f41 -> f19 : Q'=O+Q, J'=J+F, [ F>=1+O ], cost: 1

      7: f53 -> f63 : Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P ], cost: 1

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

      8: f63 -> f66 : [ P>=L ], cost: 1

     13: f63 -> f53 : P'=Q_1, [ L>=1+P ], cost: 1

     39: f63 -> f66 : J'=J+Q_1, K'=2+K, N'=free_15, X'=J, Y'=J+P, Z'=free_14, [ P>=L && F+L>=2+K && H>=J && J+Q_1>=1+H ], cost: 4

     40: f63 -> f66 : K'=K+2*meter_2, [ P>=L && F+L>=2+K && J>=1+H && 2*meter_2==-1-K+F+L && meter_2>=1 ], cost: 1+2*meter_2

     12: f66 -> f63 : L'=F+L, S'=V, V'=free_17, W'=free_16, [ 1+K>=F+L ], cost: 1

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Eliminated locations (on tree-shaped paths):

   Start location: start

      1: f10 -> f19 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, [ B>=1 ], cost: 1

     19: f19 -> f53 : P'=F, [ J>=1+G ], cost: 1

     47: f19 -> f19 : Q'=free_7+Q, J'=J+F, O'=free_7, [ G>=J && J>=Q && free_7>=F && free_7>=Q ], cost: 2

     48: f19 -> f19 : Q'=free_7+Q, J'=J+F, O'=free_7, [ G>=J && J>=Q && F>=1+free_7 ], cost: 2

     49: f19 -> f19 : Q'=-free_7+Q+free_8, J'=J+F, O'=free_8, [ G>=J && J>=Q && free_7>=F && Q>=1+free_7 && free_8>=F && free_8>=-free_7+Q ], cost: 3

     50: f19 -> f19 : Q'=-free_7+Q+free_8, J'=J+F, O'=free_8, [ G>=J && J>=Q && free_7>=F && Q>=1+free_7 && F>=1+free_8 ], cost: 3

     51: f19 -> f19 : Q'=free_19+Q, J'=J+F, O'=free_19, [ G>=J && Q>=1+J && 1+K>=J+F && free_19>=F && free_19>=Q ], cost: 3

     52: f19 -> f19 : Q'=free_19+Q, J'=J+F, O'=free_19, [ G>=J && Q>=1+J && 1+K>=J+F && F>=1+free_19 ], cost: 3

     53: f19 -> f19 : Q'=-free_19+Q+free_8, J'=J+F, O'=free_8, [ G>=J && Q>=1+J && 1+K>=J+F && free_19>=F && Q>=1+free_19 && free_8>=F && free_8>=-free_19+Q ], cost: 4

     54: f19 -> f19 : Q'=-free_19+Q+free_8, J'=J+F, O'=free_8, [ G>=J && Q>=1+J && 1+K>=J+F && free_19>=F && Q>=1+free_19 && F>=1+free_8 ], cost: 4

     55: f19 -> f19 : Q'=free_19+Q, J'=J+F, K'=2+K, L'=G+L, M'=-J+L+Q, N'=free_6, O'=free_19, [ G>=J && Q>=1+J && J+F>=2+K && H>=L && G+L>=1+H && 3+K>=J+F && free_19>=F && free_19>=Q ], cost: 6

     56: f19 -> f19 : Q'=free_19+Q, J'=J+F, K'=2+K, L'=G+L, M'=-J+L+Q, N'=free_6, O'=free_19, [ G>=J && Q>=1+J && J+F>=2+K && H>=L && G+L>=1+H && 3+K>=J+F && F>=1+free_19 ], cost: 6

     57: f19 -> f19 : Q'=-free_19+Q+free_8, J'=J+F, K'=2+K, L'=G+L, M'=-J+L+Q, N'=free_6, O'=free_8, [ G>=J && Q>=1+J && J+F>=2+K && H>=L && G+L>=1+H && 3+K>=J+F && free_19>=F && Q>=1+free_19 && free_8>=F && free_8>=-free_19+Q ], cost: 7

     58: f19 -> f19 : Q'=-free_19+Q+free_8, J'=J+F, K'=2+K, L'=G+L, M'=-J+L+Q, N'=free_6, O'=free_8, [ G>=J && Q>=1+J && J+F>=2+K && H>=L && G+L>=1+H && 3+K>=J+F && free_19>=F && Q>=1+free_19 && F>=1+free_8 ], cost: 7

     59: f19 -> f19 : Q'=free_19+Q, J'=J+F, K'=K+2*meter, O'=free_19, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && free_19>=F && free_19>=Q ], cost: 3+2*meter

     60: f19 -> f19 : Q'=free_19+Q, J'=J+F, K'=K+2*meter, O'=free_19, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && F>=1+free_19 ], cost: 3+2*meter

     61: f19 -> f19 : Q'=-free_19+Q+free_8, J'=J+F, K'=K+2*meter, O'=free_8, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && free_19>=F && Q>=1+free_19 && free_8>=F && free_8>=-free_19+Q ], cost: 4+2*meter

     62: f19 -> f19 : Q'=-free_19+Q+free_8, J'=J+F, K'=K+2*meter, O'=free_8, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && free_19>=F && Q>=1+free_19 && F>=1+free_8 ], cost: 4+2*meter

      7: f53 -> f63 : Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P ], cost: 1

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

     13: f63 -> f53 : P'=Q_1, [ L>=1+P ], cost: 1

     63: f63 -> f63 : L'=F+L, S'=V, V'=free_17, W'=free_16, [ P>=L && 1+K>=F+L ], cost: 2

     64: f63 -> f63 : J'=J+Q_1, K'=2+K, L'=F+L, N'=free_15, S'=V, V'=free_17, W'=free_16, X'=J, Y'=J+P, Z'=free_14, [ P>=L && F+L>=2+K && H>=J && J+Q_1>=1+H && 3+K>=F+L ], cost: 5

     65: f63 -> f63 : K'=K+2*meter_2, L'=F+L, S'=V, V'=free_17, W'=free_16, [ P>=L && F+L>=2+K && J>=1+H && 2*meter_2==-1-K+F+L && meter_2>=1 ], cost: 2+2*meter_2

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Applied pruning (of leafs and parallel rules):

   Start location: start

      1: f10 -> f19 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, [ B>=1 ], cost: 1

     19: f19 -> f53 : P'=F, [ J>=1+G ], cost: 1

     50: f19 -> f19 : Q'=-free_7+Q+free_8, J'=J+F, O'=free_8, [ G>=J && J>=Q && free_7>=F && Q>=1+free_7 && F>=1+free_8 ], cost: 3

     59: f19 -> f19 : Q'=free_19+Q, J'=J+F, K'=K+2*meter, O'=free_19, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && free_19>=F && free_19>=Q ], cost: 3+2*meter

     60: f19 -> f19 : Q'=free_19+Q, J'=J+F, K'=K+2*meter, O'=free_19, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && F>=1+free_19 ], cost: 3+2*meter

     61: f19 -> f19 : Q'=-free_19+Q+free_8, J'=J+F, K'=K+2*meter, O'=free_8, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && free_19>=F && Q>=1+free_19 && free_8>=F && free_8>=-free_19+Q ], cost: 4+2*meter

     62: f19 -> f19 : Q'=-free_19+Q+free_8, J'=J+F, K'=K+2*meter, O'=free_8, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && free_19>=F && Q>=1+free_19 && F>=1+free_8 ], cost: 4+2*meter

      7: f53 -> f63 : Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P ], cost: 1

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

     13: f63 -> f53 : P'=Q_1, [ L>=1+P ], cost: 1

     63: f63 -> f63 : L'=F+L, S'=V, V'=free_17, W'=free_16, [ P>=L && 1+K>=F+L ], cost: 2

     64: f63 -> f63 : J'=J+Q_1, K'=2+K, L'=F+L, N'=free_15, S'=V, V'=free_17, W'=free_16, X'=J, Y'=J+P, Z'=free_14, [ P>=L && F+L>=2+K && H>=J && J+Q_1>=1+H && 3+K>=F+L ], cost: 5

     65: f63 -> f63 : K'=K+2*meter_2, L'=F+L, S'=V, V'=free_17, W'=free_16, [ P>=L && F+L>=2+K && J>=1+H && 2*meter_2==-1-K+F+L && meter_2>=1 ], cost: 2+2*meter_2

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Accelerating simple loops of location 2.

   Accelerating the following rules:

     50: f19 -> f19 : Q'=-free_7+Q+free_8, J'=J+F, O'=free_8, [ G>=J && J>=Q && free_7>=F && Q>=1+free_7 && F>=1+free_8 ], cost: 3

     59: f19 -> f19 : Q'=free_19+Q, J'=J+F, K'=K+2*meter, O'=free_19, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && free_19>=F && free_19>=Q ], cost: 3+2*meter

     60: f19 -> f19 : Q'=free_19+Q, J'=J+F, K'=K+2*meter, O'=free_19, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && F>=1+free_19 ], cost: 3+2*meter

     61: f19 -> f19 : Q'=-free_19+Q+free_8, J'=J+F, K'=K+2*meter, O'=free_8, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && free_19>=F && Q>=1+free_19 && free_8>=F && free_8>=-free_19+Q ], cost: 4+2*meter

     62: f19 -> f19 : Q'=-free_19+Q+free_8, J'=J+F, K'=K+2*meter, O'=free_8, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && free_19>=F && Q>=1+free_19 && F>=1+free_8 ], cost: 4+2*meter



   Found no metering function for rule 50.

   Found no metering function for rule 59.

   Found no metering function for rule 60.

      During metering: Instantiating temporary variables by {free_19==Q-free_8,free_8==F,meter==1}

   Found no metering function for rule 61.

   Found no metering function for rule 62.

   Removing the simple loops:.



Accelerating simple loops of location 7.

   Accelerating the following rules:

     63: f63 -> f63 : L'=F+L, S'=V, V'=free_17, W'=free_16, [ P>=L && 1+K>=F+L ], cost: 2

     64: f63 -> f63 : J'=J+Q_1, K'=2+K, L'=F+L, N'=free_15, S'=V, V'=free_17, W'=free_16, X'=J, Y'=J+P, Z'=free_14, [ P>=L && F+L>=2+K && H>=J && J+Q_1>=1+H && 3+K>=F+L ], cost: 5

     65: f63 -> f63 : K'=K+2*meter_2, L'=F+L, S'=V, V'=free_17, W'=free_16, [ P>=L && F+L>=2+K && J>=1+H && 2*meter_2==-1-K+F+L && meter_2>=1 ], cost: 2+2*meter_2



   Found no metering function for rule 63.

   Found no metering function for rule 64.

   Found no metering function for rule 65.

   Removing the simple loops:.



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

   Start location: start

      1: f10 -> f19 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, [ B>=1 ], cost: 1

     19: f19 -> f53 : P'=F, [ J>=1+G ], cost: 1

     50: f19 -> f19 : Q'=-free_7+Q+free_8, J'=J+F, O'=free_8, [ G>=J && J>=Q && free_7>=F && Q>=1+free_7 && F>=1+free_8 ], cost: 3

     59: f19 -> f19 : Q'=free_19+Q, J'=J+F, K'=K+2*meter, O'=free_19, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && free_19>=F && free_19>=Q ], cost: 3+2*meter

     60: f19 -> f19 : Q'=free_19+Q, J'=J+F, K'=K+2*meter, O'=free_19, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && F>=1+free_19 ], cost: 3+2*meter

     61: f19 -> f19 : Q'=-free_19+Q+free_8, J'=J+F, K'=K+2*meter, O'=free_8, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && free_19>=F && Q>=1+free_19 && free_8>=F && free_8>=-free_19+Q ], cost: 4+2*meter

     62: f19 -> f19 : Q'=-free_19+Q+free_8, J'=J+F, K'=K+2*meter, O'=free_8, [ G>=J && Q>=1+J && J+F>=2+K && L>=1+H && 2*meter==-1+J-K+F && meter>=1 && free_19>=F && Q>=1+free_19 && F>=1+free_8 ], cost: 4+2*meter

      7: f53 -> f63 : Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P ], cost: 1

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

     13: f63 -> f53 : P'=Q_1, [ L>=1+P ], cost: 1

     63: f63 -> f63 : L'=F+L, S'=V, V'=free_17, W'=free_16, [ P>=L && 1+K>=F+L ], cost: 2

     64: f63 -> f63 : J'=J+Q_1, K'=2+K, L'=F+L, N'=free_15, S'=V, V'=free_17, W'=free_16, X'=J, Y'=J+P, Z'=free_14, [ P>=L && F+L>=2+K && H>=J && J+Q_1>=1+H && 3+K>=F+L ], cost: 5

     65: f63 -> f63 : K'=K+2*meter_2, L'=F+L, S'=V, V'=free_17, W'=free_16, [ P>=L && F+L>=2+K && J>=1+H && 2*meter_2==-1-K+F+L && meter_2>=1 ], cost: 2+2*meter_2

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Chained accelerated rules (with incoming rules):

   Start location: start

      1: f10 -> f19 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, [ B>=1 ], cost: 1

     66: f10 -> f19 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1-free_7+free_8, J'=J+free_4, O'=free_8, [ B>=1 && free_2>=J && J>=1 && free_7>=free_4 && 1>=1+free_7 && free_4>=1+free_8 ], cost: 4

     67: f10 -> f19 : D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && free_19>=1 ], cost: 4+2*meter

     68: f10 -> f19 : D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 ], cost: 4+2*meter

     69: f10 -> f19 : D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1-free_19+free_8, J'=1+K+2*meter, K'=K+2*meter, O'=free_8, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 5+2*meter

     70: f10 -> f19 : D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1-free_19+free_8, J'=1+K+2*meter, K'=K+2*meter, O'=free_8, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 5+2*meter

     19: f19 -> f53 : P'=F, [ J>=1+G ], cost: 1

      7: f53 -> f63 : Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P ], cost: 1

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

     71: f53 -> f63 : L'=F+L, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ G>=1+P && P>=L && 1+K>=F+L ], cost: 3

     72: f53 -> f63 : J'=J+free_11, K'=2+K, L'=F+L, N'=free_15, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, X'=J, Y'=J+P, Z'=free_14, [ G>=1+P && P>=L && F+L>=2+K && H>=J && J+free_11>=1+H && 3+K>=F+L ], cost: 6

     73: f53 -> f63 : K'=K+2*meter_2, L'=F+L, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ G>=1+P && P>=L && F+L>=2+K && J>=1+H && 2*meter_2==-1-K+F+L && meter_2>=1 ], cost: 3+2*meter_2

     13: f63 -> f53 : P'=Q_1, [ L>=1+P ], cost: 1

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Eliminated locations (on tree-shaped paths):

   Start location: start

     74: f10 -> f53 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ B>=1 && J>=1+free_2 ], cost: 2

     75: f10 -> f53 : D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && free_19>=1 && 1+K+2*meter>=1+free_2 ], cost: 5+2*meter

     76: f10 -> f53 : D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 ], cost: 5+2*meter

     77: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 5+2*meter

     78: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 5+2*meter

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

     79: f53 -> f53 : P'=free_11, Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P && L>=1+P ], cost: 2

     80: f53 -> f53 : L'=F+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ G>=1+P && P>=L && 1+K>=F+L && F+L>=1+P ], cost: 4

     81: f53 -> f53 : J'=J+free_11, K'=2+K, L'=F+L, N'=free_15, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, X'=J, Y'=J+P, Z'=free_14, [ G>=1+P && P>=L && F+L>=2+K && H>=J && J+free_11>=1+H && 3+K>=F+L && F+L>=1+P ], cost: 7

     82: f53 -> f53 : K'=K+2*meter_2, L'=F+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ G>=1+P && P>=L && F+L>=2+K && J>=1+H && 2*meter_2==-1-K+F+L && meter_2>=1 && F+L>=1+P ], cost: 4+2*meter_2

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Accelerating simple loops of location 6.

   Accelerating the following rules:

     79: f53 -> f53 : P'=free_11, Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P && L>=1+P ], cost: 2

     80: f53 -> f53 : L'=F+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ G>=1+P && P>=L && 1+K>=F+L && F+L>=1+P ], cost: 4

     81: f53 -> f53 : J'=J+free_11, K'=2+K, L'=F+L, N'=free_15, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, X'=J, Y'=J+P, Z'=free_14, [ G>=1+P && P>=L && F+L>=2+K && H>=J && J+free_11>=1+H && 3+K>=F+L && F+L>=1+P ], cost: 7

     82: f53 -> f53 : K'=K+2*meter_2, L'=F+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ G>=1+P && P>=L && F+L>=2+K && J>=1+H && 2*meter_2==-1-K+F+L && meter_2>=1 && F+L>=1+P ], cost: 4+2*meter_2



   Accelerated rule 79 with NONTERM (after strengthening guard), yielding the new rule 83.

   Found no metering function for rule 80.

   Found no metering function for rule 81.

   Found no metering function for rule 82.

   Removing the simple loops:.



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

   Start location: start

     74: f10 -> f53 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ B>=1 && J>=1+free_2 ], cost: 2

     75: f10 -> f53 : D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && free_19>=1 && 1+K+2*meter>=1+free_2 ], cost: 5+2*meter

     76: f10 -> f53 : D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 ], cost: 5+2*meter

     77: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 5+2*meter

     78: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 5+2*meter

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

     79: f53 -> f53 : P'=free_11, Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ G>=1+P && L>=1+P ], cost: 2

     80: f53 -> f53 : L'=F+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ G>=1+P && P>=L && 1+K>=F+L && F+L>=1+P ], cost: 4

     81: f53 -> f53 : J'=J+free_11, K'=2+K, L'=F+L, N'=free_15, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, X'=J, Y'=J+P, Z'=free_14, [ G>=1+P && P>=L && F+L>=2+K && H>=J && J+free_11>=1+H && 3+K>=F+L && F+L>=1+P ], cost: 7

     82: f53 -> f53 : K'=K+2*meter_2, L'=F+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ G>=1+P && P>=L && F+L>=2+K && J>=1+H && 2*meter_2==-1-K+F+L && meter_2>=1 && F+L>=1+P ], cost: 4+2*meter_2

     83: f53 -> [21] : [ G>=1+P && L>=1+P && G>=1+free_11 && L>=1+free_11 ], cost: NONTERM

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Chained accelerated rules (with incoming rules):

   Start location: start

     74: f10 -> f53 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ B>=1 && J>=1+free_2 ], cost: 2

     75: f10 -> f53 : D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && free_19>=1 && 1+K+2*meter>=1+free_2 ], cost: 5+2*meter

     76: f10 -> f53 : D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 ], cost: 5+2*meter

     77: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 5+2*meter

     78: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 5+2*meter

     84: f10 -> f53 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_11, Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ], cost: 4

     85: f10 -> f53 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 ], cost: 6

     86: f10 -> f53 : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, J'=J+free_11, K'=2+K, L'=free_4+L, N'=free_15, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, X'=J, Y'=J+free_4, Z'=free_14, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && free_4+L>=2+K && free_5>=J && J+free_11>=1+free_5 && 3+K>=free_4+L && free_4+L>=1+free_4 ], cost: 9

     87: f10 -> f53 : D'=free_3, E'=free_1, F'=1+K+2*meter_2-L, G'=free_2, H'=free_5, Q'=1, K'=K+2*meter_2, L'=1+K+2*meter_2, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L ], cost: 6+2*meter_2

     88: f10 -> [21] : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

     14: f53 -> f10 : A1'=free_18, B'=-1+B, [ P>=G ], cost: 1

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Eliminated locations (on tree-shaped paths):

   Start location: start

     77: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 5+2*meter

     78: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 5+2*meter

     88: f10 -> [21] : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

     89: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ B>=1 && J>=1+free_2 && free_4>=free_2 ], cost: 3

     90: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && free_19>=1 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 6+2*meter

     91: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 6+2*meter

     92: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_11, Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 && free_11>=free_2 ], cost: 5

     93: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 ], cost: 7

     94: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, J'=J+free_11, K'=2+K, L'=free_4+L, N'=free_15, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, X'=J, Y'=J+free_4, Z'=free_14, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && free_4+L>=2+K && free_5>=J && J+free_11>=1+free_5 && 3+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 ], cost: 10

     95: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1+K+2*meter_2-L, G'=free_2, H'=free_5, Q'=1, K'=K+2*meter_2, L'=1+K+2*meter_2, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 ], cost: 7+2*meter_2

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Applied pruning (of leafs and parallel rules):

   Start location: start

     77: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 5+2*meter

     78: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 5+2*meter

     88: f10 -> [21] : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

     90: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && free_19>=1 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 6+2*meter

     91: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 6+2*meter

     92: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_11, Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 && free_11>=free_2 ], cost: 5

     93: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 ], cost: 7

     95: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1+K+2*meter_2-L, G'=free_2, H'=free_5, Q'=1, K'=K+2*meter_2, L'=1+K+2*meter_2, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 ], cost: 7+2*meter_2

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Accelerating simple loops of location 1.

   Accelerating the following rules:

     90: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && free_19>=1 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 6+2*meter

     91: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 6+2*meter

     92: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_11, Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 && free_11>=free_2 ], cost: 5

     93: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 ], cost: 7

     95: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1+K+2*meter_2-L, G'=free_2, H'=free_5, Q'=1, K'=K+2*meter_2, L'=1+K+2*meter_2, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 ], cost: 7+2*meter_2



      During metering: Instantiating temporary variables by {free_2==J,free_19==1,meter==1}

   Accelerated rule 90 with metering function -2+J-K, yielding the new rule 96.

      During metering: Instantiating temporary variables by {free_2==K+2*meter,free_19==-J+K+2*meter,meter==1}

   Found no metering function for rule 91.

   Accelerated rule 92 with metering function B, yielding the new rule 97.

   Found no metering function for rule 93.

   Found no metering function for rule 95.

      During metering: Instantiating temporary variables by {free_2==J,free_19==1,free_4==-1+free_2,free_11==free_2,meter==1}

      During metering: Instantiating temporary variables by {free_2==K+2*meter,free_19==-J+K+2*meter,free_4==-1+free_2,free_11==free_2,meter==1}

      During metering: Instantiating temporary variables by {free_2==2+K+2*meter_2-L,meter_2==1,free_4==K+2*meter_2,free_11==free_2}

   Removing the simple loops: 90 92.



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

   Start location: start

     77: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 5+2*meter

     78: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 5+2*meter

     88: f10 -> [21] : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

     91: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 6+2*meter

     93: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 ], cost: 7

     95: f10 -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1+K+2*meter_2-L, G'=free_2, H'=free_5, Q'=1, K'=K+2*meter_2, L'=1+K+2*meter_2, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 ], cost: 7+2*meter_2

     96: f10 -> f10 : A1'=free_18, B'=2+B-J+K, D'=free_3, E'=free_1, F'=2, G'=-5+2*J-K, H'=free_5, Q'=2, J'=-3+2*J-K, K'=-4+2*J-K, O'=1, P'=2, [ B>=1 && 1>=1+J && L>=1+free_5 && 3+K>=1+J && 3-J+K>=J && -2+J-K>=1 ], cost: -16+8*J-8*K

     97: f10 -> f10 : A1'=free_18, B'=0, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_11, Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 && free_11>=free_2 ], cost: 5*B

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A



Chained accelerated rules (with incoming rules):

   Start location: start

     77: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 5+2*meter

     78: f10 -> [20] : [ B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 5+2*meter

     88: f10 -> [21] : D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

     29: start -> f10 : A1'=1, [ B>=1+A ], cost: 2

     30: start -> f10 : A1'=1, B'=1+A, C'=free, [ A>=B ], cost: 3-B+A

     98: start -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ B>=1+A && B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 8+2*meter

     99: start -> f10 : A1'=free_18, B'=A, C'=free, D'=free_3, E'=free_1, F'=1-J+K+2*meter, G'=free_2, H'=free_5, Q'=1+free_19, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=1-J+K+2*meter, [ A>=B && 1+A>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 9-B+A+2*meter

    100: start -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1+A && B>=1 && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 ], cost: 9

    101: start -> f10 : A1'=free_18, B'=A, C'=free, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 ], cost: 10-B+A

    102: start -> f10 : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=1+K+2*meter_2-L, G'=free_2, H'=free_5, Q'=1, K'=K+2*meter_2, L'=1+K+2*meter_2, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1+A && B>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 ], cost: 9+2*meter_2

    103: start -> f10 : A1'=free_18, B'=A, C'=free, D'=free_3, E'=free_1, F'=1+K+2*meter_2-L, G'=free_2, H'=free_5, Q'=1, K'=K+2*meter_2, L'=1+K+2*meter_2, P'=free_11, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 ], cost: 10-B+A+2*meter_2

    104: start -> f10 : A1'=free_18, B'=0, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_11, Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ B>=1+A && B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 && free_11>=free_2 ], cost: 2+5*B

    105: start -> f10 : A1'=free_18, B'=0, C'=free, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_11, Q_1'=free_11, R'=free_9, S'=free_12, T'=free_10, U'=free_13, V'=1, W'=0, [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 && free_11>=free_2 ], cost: 8-B+6*A



Eliminated locations (on tree-shaped paths):

   Start location: start

    106: start -> [20] : A1'=1, [ B>=1+A && B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 7+2*meter

    107: start -> [20] : A1'=1, [ B>=1+A && B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 7+2*meter

    108: start -> [21] : A1'=1, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ B>=1+A && B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

    109: start -> [20] : A1'=1, B'=1+A, C'=free, [ A>=B && 1+A>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 8-B+A+2*meter

    110: start -> [20] : A1'=1, B'=1+A, C'=free, [ A>=B && 1+A>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 8-B+A+2*meter

    111: start -> [21] : A1'=1, B'=1+A, C'=free, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

    112: start -> [21] : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=free_4, [ B>=1+A && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 && -1+B>=1 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

    113: start -> [21] : A1'=free_18, B'=A, C'=free, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=free_4, [ A>=B && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 && A>=1 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

    114: start -> [21] : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_4, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1+A && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 && -1+B>=1 ], cost: NONTERM

    115: start -> [21] : A1'=free_18, B'=A, C'=free, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_4, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ A>=B && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 && A>=1 ], cost: NONTERM

    116: start -> [21] : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, K'=K+2*meter_2, L'=1+K+2*meter_2, P'=free_4, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1+A && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 && -1+B>=1 && free_2>=1+free_4 && 1+K+2*meter_2>=1+free_4 ], cost: NONTERM

    117: start -> [21] : A1'=free_18, B'=A, C'=free, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, K'=K+2*meter_2, L'=1+K+2*meter_2, P'=free_4, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ A>=B && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 && A>=1 && free_2>=1+free_4 && 1+K+2*meter_2>=1+free_4 ], cost: NONTERM

    118: start -> [23] : [ B>=1+A && B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 8+2*meter

    119: start -> [23] : [ A>=B && 1+A>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 9-B+A+2*meter

    120: start -> [23] : [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 ], cost: 10-B+A

    121: start -> [23] : [ B>=1+A && B>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 ], cost: 9+2*meter_2

    122: start -> [23] : [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 ], cost: 10-B+A+2*meter_2

    123: start -> [23] : [ B>=1+A && B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 && free_11>=free_2 ], cost: 2+5*B

    124: start -> [23] : [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 && free_11>=free_2 ], cost: 8-B+6*A



Applied pruning (of leafs and parallel rules):

   Start location: start

    106: start -> [20] : A1'=1, [ B>=1+A && B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 7+2*meter

    107: start -> [20] : A1'=1, [ B>=1+A && B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 7+2*meter

    108: start -> [21] : A1'=1, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ B>=1+A && B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

    109: start -> [20] : A1'=1, B'=1+A, C'=free, [ A>=B && 1+A>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 8-B+A+2*meter

    110: start -> [20] : A1'=1, B'=1+A, C'=free, [ A>=B && 1+A>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 8-B+A+2*meter

    111: start -> [21] : A1'=1, B'=1+A, C'=free, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

    113: start -> [21] : A1'=free_18, B'=A, C'=free, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=free_4, [ A>=B && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 && A>=1 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

    114: start -> [21] : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_4, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1+A && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 && -1+B>=1 ], cost: NONTERM

    115: start -> [21] : A1'=free_18, B'=A, C'=free, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_4, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ A>=B && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 && A>=1 ], cost: NONTERM

    118: start -> [23] : [ B>=1+A && B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 8+2*meter

    119: start -> [23] : [ A>=B && 1+A>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 9-B+A+2*meter

    120: start -> [23] : [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 ], cost: 10-B+A

    121: start -> [23] : [ B>=1+A && B>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 ], cost: 9+2*meter_2

    122: start -> [23] : [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 ], cost: 10-B+A+2*meter_2



### Computing asymptotic complexity ###



Fully simplified ITS problem

   Start location: start

    106: start -> [20] : A1'=1, [ B>=1+A && B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 7+2*meter

    107: start -> [20] : A1'=1, [ B>=1+A && B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 7+2*meter

    108: start -> [21] : A1'=1, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ B>=1+A && B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

    109: start -> [20] : A1'=1, B'=1+A, C'=free, [ A>=B && 1+A>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && free_8>=1-J+K+2*meter && free_8>=1-free_19 ], cost: 8-B+A+2*meter

    110: start -> [20] : A1'=1, B'=1+A, C'=free, [ A>=B && 1+A>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && free_19>=1-J+K+2*meter && 1>=1+free_19 && 1-J+K+2*meter>=1+free_8 ], cost: 8-B+A+2*meter

    111: start -> [21] : A1'=1, B'=1+A, C'=free, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, P'=free_4, [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

    113: start -> [21] : A1'=free_18, B'=A, C'=free, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, J'=1+K+2*meter, K'=K+2*meter, O'=free_19, P'=free_4, [ A>=B && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 && A>=1 && free_2>=1+free_4 && L>=1+free_4 ], cost: NONTERM

    114: start -> [21] : A1'=free_18, B'=-1+B, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_4, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ B>=1+A && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 && -1+B>=1 ], cost: NONTERM

    115: start -> [21] : A1'=free_18, B'=A, C'=free, D'=free_3, E'=free_1, F'=free_4, G'=free_2, H'=free_5, Q'=1, L'=free_4+L, P'=free_4, Q_1'=free_11, R'=free_9, S'=1, T'=free_10, U'=free_13, V'=free_17, W'=free_16, [ A>=B && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 && A>=1 ], cost: NONTERM

    118: start -> [23] : [ B>=1+A && B>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 8+2*meter

    119: start -> [23] : [ A>=B && 1+A>=1 && free_2>=J && 1>=1+J && 1+K+2*meter>=2+K && L>=1+free_5 && meter>=1 && 1-J+K+2*meter>=1+free_19 && 1+K+2*meter>=1+free_2 && 1-J+K+2*meter>=free_2 ], cost: 9-B+A+2*meter

    120: start -> [23] : [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=1+free_4 && free_4>=L && 1+K>=free_4+L && free_4+L>=1+free_4 && free_11>=free_2 ], cost: 10-B+A

    121: start -> [23] : [ B>=1+A && B>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 ], cost: 9+2*meter_2

    122: start -> [23] : [ A>=B && 1+A>=1 && J>=1+free_2 && free_2>=2+K+2*meter_2-L && 1+K+2*meter_2-L>=L && 1+K+2*meter_2>=2+K && J>=1+free_5 && meter_2>=1 && 1+K+2*meter_2>=2+K+2*meter_2-L && free_11>=free_2 ], cost: 10-B+A+2*meter_2



Computing asymptotic complexity for rule 106

   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J (+/+!), free_19+free_8 (+/+!), J-K+free_8-2*meter (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==0,B==1+n,J==0,free_19==1-n,K==-1-3*n,A==n,L==0,free_8==2*n,free_5==-1,meter==n}

      resulting limit problem:

      [solved]



   Solution:

      free_2 / 0

      B / 1+n

      J / 0

      free_19 / 1-n

      K / -1-3*n

      A / n

      L / 0

      free_8 / 2*n

      free_5 / -1

      meter / n

   Resulting cost 7+2*n has complexity: Poly(n^1)



Found new complexity Poly(n^1).



Computing asymptotic complexity for rule 107

   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==0,K==-2*n,A==n,free_8==-2,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==0,B==1,J==0,free_19==0,K==-3*n,A==-n,L==0,free_8==-n,free_5==-1,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), 1-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==0,K==-2*n,A==-n,free_8==-2,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==0,K==-2*n,A==n,free_8==-2,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), B (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), B (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {B==1+n,J==0,K==-2*n,A==n,free_8==-2,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==0,J==0,K==-2*n,A==n,free_8==-2,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), 1-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==0,J==0,K==-2*n,A==-n,free_8==-2,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==0,J==0,K==-2*n,A==n,free_8==-2,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), B (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), B (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), J-K-2*meter (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==0,B==1+n,J==0,K==-2*n,A==n,free_8==-2,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==0,K==-2*n,A==n,L==1,free_8==-2,free_5==0,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), 1-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==0,K==-2*n,A==-n,L==1,free_8==-2,free_5==0,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==0,K==-2*n,A==n,L==1,free_8==-2,free_5==0,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), B (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), B (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {B==1+n,J==0,K==-2*n,A==n,L==1,free_8==-2,free_5==0,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==0,J==0,K==-2*n,A==n,L==1,free_8==-2,free_5==0,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), 1-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==0,J==0,K==-2*n,A==-n,L==1,free_8==-2,free_5==0,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==0,J==0,K==-2*n,A==n,L==1,free_8==-2,free_5==0,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_19==1-J+K+2*meter}

      resulting limit problem:

      7+2*meter (+), 1 (+/+!), B (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      7+2*meter (+), B (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), J-K-2*meter (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==0,B==n,J==0,K==-2*n,A==-1+n,L==1,free_8==-2,free_5==0,meter==-1+n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==-n,free_19==0,K==-4*n,A==0,free_8==-n,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==0,free_19==0,K==-3*n,A==-n,free_8==-n,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==-n,free_19==0,K==-4*n,A==0,free_8==-n,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {B==n,J==-n,free_19==0,K==-4*n,A==0,free_8==-n,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==0,J==0,free_19==-n,K==-4*n,A==0,free_8==-2*n,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==-n,J==-n,free_19==0,K==-4*n,A==-n,free_8==-n,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==0,J==0,free_19==-n,K==-4*n,A==0,free_8==-2*n,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {L==1+free_5}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==-n,B==n,J==-n,free_19==0,K==-4*n,A==0,free_8==-n,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==0,free_19==-n,K==-4*n,A==0,L==0,free_8==-2*n,free_5==-1,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==-n,free_19==0,K==-4*n,A==-n,L==0,free_8==-n,free_5==-1,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==0,free_19==-n,K==-4*n,A==0,L==0,free_8==-2*n,free_5==-1,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {free_2==J}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {B==n,J==0,free_19==0,K==-3*n,A==0,L==0,free_8==-n,free_5==-1,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==-n,J==-n,free_19==0,K==-4*n,A==0,L==0,free_8==-n,free_5==-1,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1-A (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==-n,J==-n,free_19==0,K==-4*n,A==-n,L==0,free_8==-n,free_5==-1,meter==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), B (+/+!), 1-free_19 (+/+!), B-A (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!) [not solved]



      applying transformation rule (C) using substitution {B==1+A}

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1 (+/+!), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      applying transformation rule (B), deleting 1 (+/+!)

      resulting limit problem:

      J+free_19-K-2*meter (+/+!), 7+2*meter (+), 1-free_19 (+/+!), 1-J+K-free_8+2*meter (+/+!), 1-J (+/+!), 1+free_2-J (+/+!), 2*meter (+/+!), L-free_5 (+/+!), 1+A (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {free_2==-n,J==-n,free_19==0,K==-4*n,A==0,L==0,free_8==-n,free_5==-1,meter==n}

      resulting limit problem:

      [solved]



   Solution:

      free_2 / 0

      B / 1+n

      J / 0

      free_19 / -1

      K / -2*n

      A / n

      L / 1

      free_8 / -2

      free_5 / 0

      meter / -1+n

   Resulting cost 5+2*n has complexity: Poly(n^1)



Computing asymptotic complexity for rule 108

   Guard is satisfiable, yielding nontermination

   Resulting cost NONTERM has complexity: Nonterm



Found new complexity Nonterm.



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

   Complexity:  Nonterm

   Cpx degree:  Nonterm

   Solved cost: NONTERM

   Rule cost:   NONTERM

   Rule guard:  [ B>=1+A && B>=1 && J>=1+free_2 && free_2>=1+free_4 && L>=1+free_4 ]



NO


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

(2)
BOUNDS(INF, INF)