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


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


WORST_CASE(Omega(n^1), O(n^1))
proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, nat(2 + 2 * Arg_7 + -2 * Arg_8) + nat(2 + -2 * Arg_8) + max(6 + -16 * Arg_10 + 32 * Arg_9, 6) + nat(4 + -4 * Arg_10) + nat(13 + -13 * Arg_10 + 13 * Arg_9) + nat(-2 * Arg_10 + 4 * Arg_9) + nat(8 + -8 * Arg_10) + nat(-4 * Arg_10 + 4 * Arg_9) + nat(4 * Arg_15 + 4 * Arg_7 + -4 * Arg_8) + nat(8 + -4 * Arg_8) + nat(-2 * Arg_10 + 2 * Arg_9) + nat(5 + 5 * Arg_7 + -5 * Arg_8) + nat(4 + -4 * Arg_8) + max(1, 2 + Arg_7 + -1 * Arg_8) + nat(12 + 24 * Arg_15 + -12 * Arg_16) + nat(2 * Arg_15 + 2 * Arg_7 + -2 * Arg_8) + nat(4 + -2 * Arg_8)).

(0) CpxIntTrs
(1) Koat2 Proof [FINISHED, 82.0 s]
(2) BOUNDS(1, nat(2 + 2 * Arg_7 + -2 * Arg_8) + nat(2 + -2 * Arg_8) + max(6 + -16 * Arg_10 + 32 * Arg_9, 6) + nat(4 + -4 * Arg_10) + nat(13 + -13 * Arg_10 + 13 * Arg_9) + nat(-2 * Arg_10 + 4 * Arg_9) + nat(8 + -8 * Arg_10) + nat(-4 * Arg_10 + 4 * Arg_9) + nat(4 * Arg_15 + 4 * Arg_7 + -4 * Arg_8) + nat(8 + -4 * Arg_8) + nat(-2 * Arg_10 + 2 * Arg_9) + nat(5 + 5 * Arg_7 + -5 * Arg_8) + nat(4 + -4 * Arg_8) + max(1, 2 + Arg_7 + -1 * Arg_8) + nat(12 + 24 * Arg_15 + -12 * Arg_16) + nat(2 * Arg_15 + 2 * Arg_7 + -2 * Arg_8) + nat(4 + -2 * Arg_8))
(3) Loat Proof [FINISHED, 144.1 s]
(4) BOUNDS(n^1, 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) -> Com_1(f13(1, X, Y, Z, A1, B1, C1, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: A >= 1 && A <= 1
f13(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f16(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: H >= I
f16(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f16(A, B, C, D, E, F, G, H, I, J, K + 1, L + 2, M, N, O, P, Q, R, S, T, U, V, W)) :|: J >= K
f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f27(A, X, Y, Z, A1, B1, C1, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: 0 >= A
f2(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f27(A, X, Y, Z, A1, B1, C1, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: A >= 2
f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f35(A, B, C, D, E, F, G, H, I, J, K, L, H - I + 2, 1, 0, P, Q, R, S, T, U, V, W)) :|: 0 >= I && H >= I
f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f35(A, B, C, D, E, F, G, H, I, J, K, L, H - I + 2, 1, 0, P, Q, R, S, T, U, V, W)) :|: I >= 2 && H >= I
f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f35(A, B, C, D, E, F, G, H, 1, J, K, L, 1, 1, 0, P, Q, R, S, T, U, V, W)) :|: H >= 1 && I >= 1 && I <= 1
f35(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: P >= 2 * X && 3 * X >= P + 1 && X + 1 >= Q
f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: 0 >= Q && J >= K
f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: Q >= 2 && J >= K
f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, K + 1, X + 3, M, N, O, P, 1, B * Y + B * Z, B * A1 - B * B1, C * C1 - C * D1, -(C) * E1 - C * F1, V, W)) :|: J >= K + 4 * X && 5 * X + K >= J + 1 && 0 >= K && J >= K && Q >= 1 && Q <= 1
f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, K + 1, X + 3, M, N, O, P, 1, B * Y + B * Z, B * A1 - B * B1, C * C1 - C * D1, -(C) * E1 - C * F1, V, W)) :|: J >= K + 4 * X && 5 * X + K >= J + 1 && J >= K && K >= 2 && Q >= 1 && Q <= 1
f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, 2, 1, M, N, O, P, 1, B * X + B * Y, B * Z - B * A1, C * B1 - C * C1, -(C) * D1 - C * E1, V, W)) :|: J >= 1 && K >= 1 && K <= 1 && Q >= 1 && Q <= 1
f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, K + 1, J - K + 2, M, N, O, P, Q, B * X + B * Y, B * Z - B * A1, C * B1 - C * C1, -(C) * D1 - C * E1, P + 3 - F1, W)) :|: Q >= 2 * F1 && 3 * F1 >= Q + 1 && 0 >= K
f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, K + 1, J - K + 2, M, N, O, P, Q, B * X + B * Y, B * Z - B * A1, C * B1 - C * C1, -(C) * D1 - C * E1, P + 3 - F1, W)) :|: Q >= 2 * F1 && 3 * F1 >= Q + 1 && K >= 2
f53(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f38(A, B, C, D, E, F, G, H, I, J, 2, 1, M, N, O, P, Q, B * X + B * Y, B * Z - B * A1, C * B1 - C * C1, -(C) * D1 - C * E1, P + 3 - F1, W)) :|: Q >= 2 * F1 && 3 * F1 >= Q + 1 && K >= 1 && K <= 1
f38(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f35(A, B, C, D, N, F, G, H, I, J, K, L, M, F * N - G * O + N, F * O + G * N + O, P, Q + 1, R, S, T, U, V, W + 2)) :|: K >= 1 + J
f35(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f27(A, B, C, D, E, F, G, H, I + 1, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: P >= 2 * X && 3 * X >= P + 1 && Q >= 2 + X
f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> 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)) :|: 0 >= 2 + A && I >= 1 + H
f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> 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)) :|: A >= 0 && I >= 1 + H
f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f1(-(1), B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: I >= 1 + H && A + 1 >= 0 && A + 1 <= 0
f16(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f13(A, B, C, D, E, F, G, H, I + 1, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: K >= 1 + J
f13(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W) -> Com_1(f27(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W)) :|: I >= 1 + H

The start-symbols are:[f2_23]


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

(1) Koat2 Proof (FINISHED)
YES( ?, 6+2*2*max([0, -(Arg_10)+2*Arg_9])+2*max([0, 1-Arg_10])+2*2*max([0, 1+Arg_9-Arg_10])+2*max([0, -(Arg_10)+2*Arg_9])+2*max([0, Arg_9-Arg_10])+2*max([0, 1-Arg_10])+2*2*max([0, 1-Arg_16+2*Arg_15])+2*max([0, Arg_7+Arg_15-Arg_8])+2*max([0, 2-Arg_8])+2*max([0, 1+Arg_7-Arg_8])+2*max([0, 1-Arg_8])+max([0, -(Arg_10)+2*Arg_9])+max([0, 1-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, Arg_9-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, Arg_7+Arg_15-Arg_8])+max([0, 2-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_9-Arg_10])+max([1, 2+Arg_7-Arg_8])+max([0, 1-Arg_8])+max([0, 1-Arg_8])+max([0, 1-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 2-Arg_8])+max([0, 2-Arg_8])+max([0, 2-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)})



Initial Complexity Problem:

  Start:  f2  

  Program_Vars:  Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6, Arg_7, Arg_8, Arg_9, Arg_10, Arg_11, Arg_12, Arg_13, Arg_14, Arg_15, Arg_16, Arg_17, Arg_18, Arg_19, Arg_20, Arg_21, Arg_22  

  Temp_Vars:  A1, B1, C1, D1, E1, F1, X, Y, Z  

  Locations:  f1, f13, f16, f2, f27, f35, f38, f53  

  Transitions:

  f13(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f16(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:Arg_0 <= 1 && 1 <= Arg_0 && Arg_8 <= Arg_7

  f13(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f27(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:Arg_0 <= 1 && 1 <= Arg_0 && 1+Arg_7 <= Arg_8

  f16(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f13(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8+1,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:Arg_8 <= Arg_7 && Arg_0 <= 1 && 1 <= Arg_0 && 1+Arg_9 <= Arg_10

  f16(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f16(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10+1,Arg_11+2,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:Arg_8 <= Arg_7 && Arg_0 <= 1 && 1 <= Arg_0 && Arg_10 <= Arg_9

  f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f13(1,X,Y,Z,A1,B1,C1,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:Arg_0 <= 1 && 1 <= Arg_0

  f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f27(Arg_0,X,Y,Z,A1,B1,C1,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:Arg_0 <= 0

  f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f27(Arg_0,X,Y,Z,A1,B1,C1,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:2 <= Arg_0

  f27(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:2+Arg_0 <= 0 && 1+Arg_7 <= Arg_8

  f27(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:0 <= Arg_0 && 1+Arg_7 <= Arg_8

  f27(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f1(-1,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:1+Arg_7 <= Arg_8 && Arg_0+1 <= 0 && 0 <= 1+Arg_0

  f27(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f35(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_7-Arg_8+2,1,0,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:Arg_8 <= 0 && Arg_8 <= Arg_7

  f27(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f35(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_7-Arg_8+2,1,0,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:2 <= Arg_8 && Arg_8 <= Arg_7

  f27(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f35(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,1,Arg_9,Arg_10,Arg_11,1,1,0,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:1 <= Arg_7 && Arg_8 <= 1 && 1 <= Arg_8

  f35(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f27(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8+1,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:Arg_8 <= Arg_7 && (2)*X <= Arg_15 && Arg_15+1 <= (3)*X && 2+X <= Arg_16

  f35(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:Arg_8 <= Arg_7 && (2)*X <= Arg_15 && Arg_15+1 <= (3)*X && Arg_16 <= X+1

  f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f35(Arg_0,Arg_1,Arg_2,Arg_3,Arg_13,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_5Arg_13-Arg_6Arg_14+Arg_13,Arg_5Arg_14+Arg_6Arg_13+Arg_14,Arg_15,Arg_16+1,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22+2):|:Arg_8 <= Arg_7 && 1+Arg_9 <= Arg_10

  f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10+1,X+3,Arg_12,Arg_13,Arg_14,Arg_15,1,Arg_1Y+Arg_1Z,A1Arg_1-Arg_1B1,Arg_2C1-Arg_2D1,-Arg_2E1-Arg_2F1,Arg_21,Arg_22):|:Arg_8 <= Arg_7 && Arg_10+(4)*X <= Arg_9 && Arg_9+1 <= (5)*X+Arg_10 && Arg_10 <= 0 && Arg_10 <= Arg_9 && Arg_16 <= 1 && 1 <= Arg_16

  f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10+1,X+3,Arg_12,Arg_13,Arg_14,Arg_15,1,Arg_1Y+Arg_1Z,A1Arg_1-Arg_1B1,Arg_2C1-Arg_2D1,-Arg_2E1-Arg_2F1,Arg_21,Arg_22):|:Arg_8 <= Arg_7 && Arg_10+(4)*X <= Arg_9 && Arg_9+1 <= (5)*X+Arg_10 && Arg_10 <= Arg_9 && 2 <= Arg_10 && Arg_16 <= 1 && 1 <= Arg_16

  f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,2,1,Arg_12,Arg_13,Arg_14,Arg_15,1,Arg_1X+Arg_1Y,Arg_1Z-A1Arg_1,B1Arg_2-Arg_2C1,-Arg_2D1-Arg_2E1,Arg_21,Arg_22):|:Arg_8 <= Arg_7 && 1 <= Arg_9 && Arg_10 <= 1 && 1 <= Arg_10 && Arg_16 <= 1 && 1 <= Arg_16

  f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f53(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:Arg_8 <= Arg_7 && Arg_16 <= 0 && Arg_10 <= Arg_9

  f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f53(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22):|:Arg_8 <= Arg_7 && 2 <= Arg_16 && Arg_10 <= Arg_9

  f53(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10+1,Arg_9-Arg_10+2,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_1X+Arg_1Y,Arg_1Z-A1Arg_1,B1Arg_2-Arg_2C1,-Arg_2D1-Arg_2E1,Arg_15+3-F1,Arg_22):|:Arg_10 <= Arg_9 && Arg_8 <= Arg_7 && (2)*F1 <= Arg_16 && Arg_16+1 <= (3)*F1 && Arg_10 <= 0

  f53(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10+1,Arg_9-Arg_10+2,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_1X+Arg_1Y,Arg_1Z-A1Arg_1,B1Arg_2-Arg_2C1,-Arg_2D1-Arg_2E1,Arg_15+3-F1,Arg_22):|:Arg_10 <= Arg_9 && Arg_8 <= Arg_7 && (2)*F1 <= Arg_16 && Arg_16+1 <= (3)*F1 && 2 <= Arg_10

  f53(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10,Arg_11,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_17,Arg_18,Arg_19,Arg_20,Arg_21,Arg_22) -> f38(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,2,1,Arg_12,Arg_13,Arg_14,Arg_15,Arg_16,Arg_1X+Arg_1Y,Arg_1Z-A1Arg_1,B1Arg_2-Arg_2C1,-Arg_2D1-Arg_2E1,Arg_15+3-F1,Arg_22):|:Arg_10 <= Arg_9 && Arg_8 <= Arg_7 && (2)*F1 <= Arg_16 && Arg_16+1 <= (3)*F1 && Arg_10 <= 1 && 1 <= Arg_10  



Timebounds: 

  Overall timebound: 6+2*2*max([0, -(Arg_10)+2*Arg_9])+2*max([0, 1-Arg_10])+2*2*max([0, 1+Arg_9-Arg_10])+2*max([0, -(Arg_10)+2*Arg_9])+2*max([0, Arg_9-Arg_10])+2*max([0, 1-Arg_10])+2*2*max([0, 1-Arg_16+2*Arg_15])+2*max([0, Arg_7+Arg_15-Arg_8])+2*max([0, 2-Arg_8])+2*max([0, 1+Arg_7-Arg_8])+2*max([0, 1-Arg_8])+max([0, -(Arg_10)+2*Arg_9])+max([0, 1-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, Arg_9-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, Arg_7+Arg_15-Arg_8])+max([0, 2-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_9-Arg_10])+max([1, 2+Arg_7-Arg_8])+max([0, 1-Arg_8])+max([0, 1-Arg_8])+max([0, 1-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 2-Arg_8])+max([0, 2-Arg_8])+max([0, 2-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  1: f13->f16: max([0, 1+Arg_7-Arg_8]) {O(n)}

  23: f13->f27: 1 {O(1)}

  2: f16->f16: max([0, 1+Arg_9-Arg_10]) {O(n)}

  22: f16->f13: max([0, 1+Arg_7-Arg_8]) {O(n)}

  0: f2->f13: 1 {O(1)}

  3: f2->f27: 1 {O(1)}

  4: f2->f27: 1 {O(1)}

  5: f27->f35: 2*max([0, 1-Arg_8])+max([0, 1-Arg_8])+max([0, 1-Arg_8])+max([0, 1-Arg_8])+max([0, 1-Arg_8]) {O(n)}

  6: f27->f35: 2*max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8]) {O(n)}

  7: f27->f35: 2*max([0, 2-Arg_8])+max([0, 2-Arg_8])+max([0, 2-Arg_8])+max([0, 2-Arg_8])+max([0, 2-Arg_8]) {O(n)}

  19: f27->f1: 1 {O(1)}

  20: f27->f1: 1 {O(1)}

  21: f27->f1: 1 {O(1)}

  8: f35->f38: 2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  18: f35->f27: 2*max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  9: f38->f53: 2*max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10]) {O(n)}

  10: f38->f53: 2*max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10]) {O(n)}

  11: f38->f38: 2*max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10]) {O(n)}

  12: f38->f38: 2*max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10]) {O(n)}

  13: f38->f38: 2*max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  17: f38->f35: 2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  14: f53->f38: 2*max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10]) {O(n)}

  15: f53->f38: 2*max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  16: f53->f38: 2*max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}



Costbounds:

  Overall costbound: 6+2*2*max([0, -(Arg_10)+2*Arg_9])+2*max([0, 1-Arg_10])+2*2*max([0, 1+Arg_9-Arg_10])+2*max([0, -(Arg_10)+2*Arg_9])+2*max([0, Arg_9-Arg_10])+2*max([0, 1-Arg_10])+2*2*max([0, 1-Arg_16+2*Arg_15])+2*max([0, Arg_7+Arg_15-Arg_8])+2*max([0, 2-Arg_8])+2*max([0, 1+Arg_7-Arg_8])+2*max([0, 1-Arg_8])+max([0, -(Arg_10)+2*Arg_9])+max([0, 1-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, Arg_9-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, Arg_7+Arg_15-Arg_8])+max([0, 2-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_9-Arg_10])+max([1, 2+Arg_7-Arg_8])+max([0, 1-Arg_8])+max([0, 1-Arg_8])+max([0, 1-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 2-Arg_8])+max([0, 2-Arg_8])+max([0, 2-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  1: f13->f16: max([0, 1+Arg_7-Arg_8]) {O(n)}

  23: f13->f27: 1 {O(1)}

  2: f16->f16: max([0, 1+Arg_9-Arg_10]) {O(n)}

  22: f16->f13: max([0, 1+Arg_7-Arg_8]) {O(n)}

  0: f2->f13: 1 {O(1)}

  3: f2->f27: 1 {O(1)}

  4: f2->f27: 1 {O(1)}

  5: f27->f35: 2*max([0, 1-Arg_8])+max([0, 1-Arg_8])+max([0, 1-Arg_8])+max([0, 1-Arg_8])+max([0, 1-Arg_8]) {O(n)}

  6: f27->f35: 2*max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8])+max([0, 1+Arg_7-Arg_8]) {O(n)}

  7: f27->f35: 2*max([0, 2-Arg_8])+max([0, 2-Arg_8])+max([0, 2-Arg_8])+max([0, 2-Arg_8])+max([0, 2-Arg_8]) {O(n)}

  19: f27->f1: 1 {O(1)}

  20: f27->f1: 1 {O(1)}

  21: f27->f1: 1 {O(1)}

  8: f35->f38: 2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  18: f35->f27: 2*max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  9: f38->f53: 2*max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10]) {O(n)}

  10: f38->f53: 2*max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10])+max([0, 1+Arg_9-Arg_10]) {O(n)}

  11: f38->f38: 2*max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10]) {O(n)}

  12: f38->f38: 2*max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10]) {O(n)}

  13: f38->f38: 2*max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  17: f38->f35: 2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  14: f53->f38: 2*max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10])+max([0, 1-Arg_10]) {O(n)}

  15: f53->f38: 2*max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  16: f53->f38: 2*max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}



Sizebounds:

`Lower:

  1: f13->f16, Arg_0: 1 {O(1)}

  1: f13->f16, Arg_7: Arg_7 {O(n)}

  1: f13->f16, Arg_8: Arg_8 {O(n)}

  1: f13->f16, Arg_9: Arg_9 {O(n)}

  1: f13->f16, Arg_10: Arg_10 {O(n)}

  1: f13->f16, Arg_11: Arg_11 {O(n)}

  1: f13->f16, Arg_12: Arg_12 {O(n)}

  1: f13->f16, Arg_13: Arg_13 {O(n)}

  1: f13->f16, Arg_14: Arg_14 {O(n)}

  1: f13->f16, Arg_15: Arg_15 {O(n)}

  1: f13->f16, Arg_16: Arg_16 {O(n)}

  1: f13->f16, Arg_17: Arg_17 {O(n)}

  1: f13->f16, Arg_18: Arg_18 {O(n)}

  1: f13->f16, Arg_19: Arg_19 {O(n)}

  1: f13->f16, Arg_20: Arg_20 {O(n)}

  1: f13->f16, Arg_21: Arg_21 {O(n)}

  1: f13->f16, Arg_22: Arg_22 {O(n)}

  23: f13->f27, Arg_0: 1 {O(1)}

  23: f13->f27, Arg_7: Arg_7 {O(n)}

  23: f13->f27, Arg_8: Arg_8 {O(n)}

  23: f13->f27, Arg_9: Arg_9 {O(n)}

  23: f13->f27, Arg_10: Arg_10 {O(n)}

  23: f13->f27, Arg_11: Arg_11 {O(n)}

  23: f13->f27, Arg_12: Arg_12 {O(n)}

  23: f13->f27, Arg_13: Arg_13 {O(n)}

  23: f13->f27, Arg_14: Arg_14 {O(n)}

  23: f13->f27, Arg_15: Arg_15 {O(n)}

  23: f13->f27, Arg_16: Arg_16 {O(n)}

  23: f13->f27, Arg_17: Arg_17 {O(n)}

  23: f13->f27, Arg_18: Arg_18 {O(n)}

  23: f13->f27, Arg_19: Arg_19 {O(n)}

  23: f13->f27, Arg_20: Arg_20 {O(n)}

  23: f13->f27, Arg_21: Arg_21 {O(n)}

  23: f13->f27, Arg_22: Arg_22 {O(n)}

  2: f16->f16, Arg_0: 1 {O(1)}

  2: f16->f16, Arg_7: Arg_7 {O(n)}

  2: f16->f16, Arg_8: Arg_8 {O(n)}

  2: f16->f16, Arg_9: Arg_9 {O(n)}

  2: f16->f16, Arg_10: Arg_10 {O(n)}

  2: f16->f16, Arg_11: Arg_11 {O(n)}

  2: f16->f16, Arg_12: Arg_12 {O(n)}

  2: f16->f16, Arg_13: Arg_13 {O(n)}

  2: f16->f16, Arg_14: Arg_14 {O(n)}

  2: f16->f16, Arg_15: Arg_15 {O(n)}

  2: f16->f16, Arg_16: Arg_16 {O(n)}

  2: f16->f16, Arg_17: Arg_17 {O(n)}

  2: f16->f16, Arg_18: Arg_18 {O(n)}

  2: f16->f16, Arg_19: Arg_19 {O(n)}

  2: f16->f16, Arg_20: Arg_20 {O(n)}

  2: f16->f16, Arg_21: Arg_21 {O(n)}

  2: f16->f16, Arg_22: Arg_22 {O(n)}

  22: f16->f13, Arg_0: 1 {O(1)}

  22: f16->f13, Arg_7: Arg_7 {O(n)}

  22: f16->f13, Arg_8: Arg_8 {O(n)}

  22: f16->f13, Arg_9: Arg_9 {O(n)}

  22: f16->f13, Arg_10: Arg_10 {O(n)}

  22: f16->f13, Arg_11: Arg_11 {O(n)}

  22: f16->f13, Arg_12: Arg_12 {O(n)}

  22: f16->f13, Arg_13: Arg_13 {O(n)}

  22: f16->f13, Arg_14: Arg_14 {O(n)}

  22: f16->f13, Arg_15: Arg_15 {O(n)}

  22: f16->f13, Arg_16: Arg_16 {O(n)}

  22: f16->f13, Arg_17: Arg_17 {O(n)}

  22: f16->f13, Arg_18: Arg_18 {O(n)}

  22: f16->f13, Arg_19: Arg_19 {O(n)}

  22: f16->f13, Arg_20: Arg_20 {O(n)}

  22: f16->f13, Arg_21: Arg_21 {O(n)}

  22: f16->f13, Arg_22: Arg_22 {O(n)}

  0: f2->f13, Arg_0: 1 {O(1)}

  0: f2->f13, Arg_7: Arg_7 {O(n)}

  0: f2->f13, Arg_8: Arg_8 {O(n)}

  0: f2->f13, Arg_9: Arg_9 {O(n)}

  0: f2->f13, Arg_10: Arg_10 {O(n)}

  0: f2->f13, Arg_11: Arg_11 {O(n)}

  0: f2->f13, Arg_12: Arg_12 {O(n)}

  0: f2->f13, Arg_13: Arg_13 {O(n)}

  0: f2->f13, Arg_14: Arg_14 {O(n)}

  0: f2->f13, Arg_15: Arg_15 {O(n)}

  0: f2->f13, Arg_16: Arg_16 {O(n)}

  0: f2->f13, Arg_17: Arg_17 {O(n)}

  0: f2->f13, Arg_18: Arg_18 {O(n)}

  0: f2->f13, Arg_19: Arg_19 {O(n)}

  0: f2->f13, Arg_20: Arg_20 {O(n)}

  0: f2->f13, Arg_21: Arg_21 {O(n)}

  0: f2->f13, Arg_22: Arg_22 {O(n)}

  3: f2->f27, Arg_0: Arg_0 {O(n)}

  3: f2->f27, Arg_7: Arg_7 {O(n)}

  3: f2->f27, Arg_8: Arg_8 {O(n)}

  3: f2->f27, Arg_9: Arg_9 {O(n)}

  3: f2->f27, Arg_10: Arg_10 {O(n)}

  3: f2->f27, Arg_11: Arg_11 {O(n)}

  3: f2->f27, Arg_12: Arg_12 {O(n)}

  3: f2->f27, Arg_13: Arg_13 {O(n)}

  3: f2->f27, Arg_14: Arg_14 {O(n)}

  3: f2->f27, Arg_15: Arg_15 {O(n)}

  3: f2->f27, Arg_16: Arg_16 {O(n)}

  3: f2->f27, Arg_17: Arg_17 {O(n)}

  3: f2->f27, Arg_18: Arg_18 {O(n)}

  3: f2->f27, Arg_19: Arg_19 {O(n)}

  3: f2->f27, Arg_20: Arg_20 {O(n)}

  3: f2->f27, Arg_21: Arg_21 {O(n)}

  3: f2->f27, Arg_22: Arg_22 {O(n)}

  4: f2->f27, Arg_0: 2 {O(1)}

  4: f2->f27, Arg_7: Arg_7 {O(n)}

  4: f2->f27, Arg_8: Arg_8 {O(n)}

  4: f2->f27, Arg_9: Arg_9 {O(n)}

  4: f2->f27, Arg_10: Arg_10 {O(n)}

  4: f2->f27, Arg_11: Arg_11 {O(n)}

  4: f2->f27, Arg_12: Arg_12 {O(n)}

  4: f2->f27, Arg_13: Arg_13 {O(n)}

  4: f2->f27, Arg_14: Arg_14 {O(n)}

  4: f2->f27, Arg_15: Arg_15 {O(n)}

  4: f2->f27, Arg_16: Arg_16 {O(n)}

  4: f2->f27, Arg_17: Arg_17 {O(n)}

  4: f2->f27, Arg_18: Arg_18 {O(n)}

  4: f2->f27, Arg_19: Arg_19 {O(n)}

  4: f2->f27, Arg_20: Arg_20 {O(n)}

  4: f2->f27, Arg_21: Arg_21 {O(n)}

  4: f2->f27, Arg_22: Arg_22 {O(n)}

  5: f27->f35, Arg_0: min([2, Arg_0]) {O(n)}

  5: f27->f35, Arg_7: min([1, Arg_7]) {O(n)}

  5: f27->f35, Arg_8: min([1, Arg_8]) {O(n)}

  5: f27->f35, Arg_9: min([1, Arg_9]) {O(n)}

  5: f27->f35, Arg_10: min([2, Arg_10]) {O(n)}

  5: f27->f35, Arg_11: min([1, Arg_11]) {O(n)}

  5: f27->f35, Arg_12: 2 {O(1)}

  5: f27->f35, Arg_13: 1 {O(1)}

  5: f27->f35, Arg_14: 0 {O(1)}

  5: f27->f35, Arg_15: min([2, Arg_15]) {O(n)}

  5: f27->f35, Arg_16: min([3, Arg_16]) {O(n)}

  5: f27->f35, Arg_22: Arg_22 {O(n)}

  6: f27->f35, Arg_0: min([2, Arg_0]) {O(n)}

  6: f27->f35, Arg_7: 2 {O(1)}

  6: f27->f35, Arg_8: 2 {O(1)}

  6: f27->f35, Arg_9: min([1, Arg_9]) {O(n)}

  6: f27->f35, Arg_10: min([2, Arg_10]) {O(n)}

  6: f27->f35, Arg_11: min([1, Arg_11]) {O(n)}

  6: f27->f35, Arg_12: 2 {O(1)}

  6: f27->f35, Arg_13: 1 {O(1)}

  6: f27->f35, Arg_14: 0 {O(1)}

  6: f27->f35, Arg_15: min([2, Arg_15]) {O(n)}

  6: f27->f35, Arg_16: min([3, Arg_16]) {O(n)}

  6: f27->f35, Arg_22: Arg_22 {O(n)}

  7: f27->f35, Arg_0: min([2, Arg_0]) {O(n)}

  7: f27->f35, Arg_7: 1 {O(1)}

  7: f27->f35, Arg_8: 1 {O(1)}

  7: f27->f35, Arg_9: min([1, Arg_9]) {O(n)}

  7: f27->f35, Arg_10: min([2, Arg_10]) {O(n)}

  7: f27->f35, Arg_11: min([1, Arg_11]) {O(n)}

  7: f27->f35, Arg_12: 1 {O(1)}

  7: f27->f35, Arg_13: 1 {O(1)}

  7: f27->f35, Arg_14: 0 {O(1)}

  7: f27->f35, Arg_15: min([2, Arg_15]) {O(n)}

  7: f27->f35, Arg_16: min([3, Arg_16]) {O(n)}

  7: f27->f35, Arg_22: Arg_22 {O(n)}

  19: f27->f1, Arg_0: min([2, Arg_0]) {O(n)}

  19: f27->f1, Arg_7: min([1, Arg_7]) {O(n)}

  19: f27->f1, Arg_8: min([1, Arg_8]) {O(n)}

  19: f27->f1, Arg_9: min([1, Arg_9]) {O(n)}

  19: f27->f1, Arg_10: min([2, Arg_10]) {O(n)}

  19: f27->f1, Arg_11: min([1, Arg_11]) {O(n)}

  19: f27->f1, Arg_12: min([1, Arg_12]) {O(n)}

  19: f27->f1, Arg_15: min([2, Arg_15]) {O(n)}

  19: f27->f1, Arg_16: min([3, Arg_16]) {O(n)}

  19: f27->f1, Arg_22: Arg_22 {O(n)}

  20: f27->f1, Arg_0: 0 {O(1)}

  20: f27->f1, Arg_7: min([1, Arg_7]) {O(n)}

  20: f27->f1, Arg_8: min([1, Arg_8]) {O(n)}

  20: f27->f1, Arg_9: min([1, Arg_9]) {O(n)}

  20: f27->f1, Arg_10: min([2, Arg_10]) {O(n)}

  20: f27->f1, Arg_11: min([1, Arg_11]) {O(n)}

  20: f27->f1, Arg_12: min([1, Arg_12]) {O(n)}

  20: f27->f1, Arg_15: min([2, Arg_15]) {O(n)}

  20: f27->f1, Arg_16: min([3, Arg_16]) {O(n)}

  20: f27->f1, Arg_22: Arg_22 {O(n)}

  21: f27->f1, Arg_0: -1 {O(1)}

  21: f27->f1, Arg_7: min([1, Arg_7]) {O(n)}

  21: f27->f1, Arg_8: min([1, Arg_8]) {O(n)}

  21: f27->f1, Arg_9: min([1, Arg_9]) {O(n)}

  21: f27->f1, Arg_10: min([2, Arg_10]) {O(n)}

  21: f27->f1, Arg_11: min([1, Arg_11]) {O(n)}

  21: f27->f1, Arg_12: min([1, Arg_12]) {O(n)}

  21: f27->f1, Arg_15: min([2, Arg_15]) {O(n)}

  21: f27->f1, Arg_16: min([3, Arg_16]) {O(n)}

  21: f27->f1, Arg_22: Arg_22 {O(n)}

  8: f35->f38, Arg_0: min([2, Arg_0]) {O(n)}

  8: f35->f38, Arg_7: min([1, Arg_7]) {O(n)}

  8: f35->f38, Arg_8: min([1, Arg_8]) {O(n)}

  8: f35->f38, Arg_9: min([1, Arg_9]) {O(n)}

  8: f35->f38, Arg_10: min([2, Arg_10]) {O(n)}

  8: f35->f38, Arg_11: min([1, Arg_11]) {O(n)}

  8: f35->f38, Arg_12: 1 {O(1)}

  8: f35->f38, Arg_15: 2 {O(1)}

  8: f35->f38, Arg_16: min([3, min([3, min([1, min([3, Arg_16])])])]) {O(n)}

  8: f35->f38, Arg_22: Arg_22 {O(n)}

  18: f35->f27, Arg_0: min([2, Arg_0]) {O(n)}

  18: f35->f27, Arg_7: min([1, Arg_7]) {O(n)}

  18: f35->f27, Arg_8: min([1, Arg_8]) {O(n)}

  18: f35->f27, Arg_9: min([1, Arg_9]) {O(n)}

  18: f35->f27, Arg_10: min([2, Arg_10]) {O(n)}

  18: f35->f27, Arg_11: min([1, Arg_11]) {O(n)}

  18: f35->f27, Arg_12: 1 {O(1)}

  18: f35->f27, Arg_15: 2 {O(1)}

  18: f35->f27, Arg_16: 3 {O(1)}

  18: f35->f27, Arg_22: Arg_22 {O(n)}

  9: f38->f53, Arg_0: min([2, Arg_0]) {O(n)}

  9: f38->f53, Arg_7: min([1, Arg_7]) {O(n)}

  9: f38->f53, Arg_8: min([1, Arg_8]) {O(n)}

  9: f38->f53, Arg_9: min([1, Arg_9]) {O(n)}

  9: f38->f53, Arg_10: min([2, Arg_10]) {O(n)}

  9: f38->f53, Arg_11: min([1, Arg_11]) {O(n)}

  9: f38->f53, Arg_12: 1 {O(1)}

  9: f38->f53, Arg_15: 2 {O(1)}

  9: f38->f53, Arg_16: min([3, min([3, min([1, min([3, Arg_16])])])]) {O(n)}

  9: f38->f53, Arg_22: Arg_22 {O(n)}

  10: f38->f53, Arg_0: min([2, Arg_0]) {O(n)}

  10: f38->f53, Arg_7: min([1, Arg_7]) {O(n)}

  10: f38->f53, Arg_8: min([1, Arg_8]) {O(n)}

  10: f38->f53, Arg_9: min([1, Arg_9]) {O(n)}

  10: f38->f53, Arg_10: min([2, Arg_10]) {O(n)}

  10: f38->f53, Arg_11: min([1, min([1, Arg_11])]) {O(n)}

  10: f38->f53, Arg_12: 1 {O(1)}

  10: f38->f53, Arg_15: 2 {O(1)}

  10: f38->f53, Arg_16: 2 {O(1)}

  10: f38->f53, Arg_22: Arg_22 {O(n)}

  11: f38->f38, Arg_0: min([2, Arg_0]) {O(n)}

  11: f38->f38, Arg_7: min([1, Arg_7]) {O(n)}

  11: f38->f38, Arg_8: min([1, Arg_8]) {O(n)}

  11: f38->f38, Arg_9: min([1, Arg_9]) {O(n)}

  11: f38->f38, Arg_10: min([2, Arg_10]) {O(n)}

  11: f38->f38, Arg_11: 4 {O(1)}

  11: f38->f38, Arg_12: 1 {O(1)}

  11: f38->f38, Arg_15: 2 {O(1)}

  11: f38->f38, Arg_16: 1 {O(1)}

  11: f38->f38, Arg_22: Arg_22 {O(n)}

  12: f38->f38, Arg_0: min([2, Arg_0]) {O(n)}

  12: f38->f38, Arg_7: min([1, Arg_7]) {O(n)}

  12: f38->f38, Arg_8: min([1, Arg_8]) {O(n)}

  12: f38->f38, Arg_9: 6 {O(1)}

  12: f38->f38, Arg_10: 3 {O(1)}

  12: f38->f38, Arg_11: 4 {O(1)}

  12: f38->f38, Arg_12: 1 {O(1)}

  12: f38->f38, Arg_15: 2 {O(1)}

  12: f38->f38, Arg_16: 1 {O(1)}

  12: f38->f38, Arg_22: Arg_22 {O(n)}

  13: f38->f38, Arg_0: min([2, Arg_0]) {O(n)}

  13: f38->f38, Arg_7: min([1, Arg_7]) {O(n)}

  13: f38->f38, Arg_8: min([1, Arg_8]) {O(n)}

  13: f38->f38, Arg_9: 1 {O(1)}

  13: f38->f38, Arg_10: 2 {O(1)}

  13: f38->f38, Arg_11: 1 {O(1)}

  13: f38->f38, Arg_12: 1 {O(1)}

  13: f38->f38, Arg_15: 2 {O(1)}

  13: f38->f38, Arg_16: 1 {O(1)}

  13: f38->f38, Arg_22: Arg_22 {O(n)}

  17: f38->f35, Arg_0: min([2, Arg_0]) {O(n)}

  17: f38->f35, Arg_7: min([1, Arg_7]) {O(n)}

  17: f38->f35, Arg_8: min([1, Arg_8]) {O(n)}

  17: f38->f35, Arg_9: min([1, Arg_9]) {O(n)}

  17: f38->f35, Arg_10: min([2, Arg_10]) {O(n)}

  17: f38->f35, Arg_11: min([1, Arg_11]) {O(n)}

  17: f38->f35, Arg_12: 1 {O(1)}

  17: f38->f35, Arg_15: 2 {O(1)}

  17: f38->f35, Arg_16: min([3, min([3, min([1, min([3, Arg_16])])])]) {O(n)}

  17: f38->f35, Arg_22: Arg_22 {O(n)}

  14: f53->f38, Arg_0: min([2, Arg_0]) {O(n)}

  14: f53->f38, Arg_7: min([1, Arg_7]) {O(n)}

  14: f53->f38, Arg_8: min([1, Arg_8]) {O(n)}

  14: f53->f38, Arg_9: min([1, Arg_9]) {O(n)}

  14: f53->f38, Arg_10: min([2, Arg_10]) {O(n)}

  14: f53->f38, Arg_11: 2 {O(1)}

  14: f53->f38, Arg_12: 1 {O(1)}

  14: f53->f38, Arg_15: 2 {O(1)}

  14: f53->f38, Arg_16: 2 {O(1)}

  14: f53->f38, Arg_22: Arg_22 {O(n)}

  15: f53->f38, Arg_0: min([2, Arg_0]) {O(n)}

  15: f53->f38, Arg_7: min([1, Arg_7]) {O(n)}

  15: f53->f38, Arg_8: min([1, Arg_8]) {O(n)}

  15: f53->f38, Arg_9: 2 {O(1)}

  15: f53->f38, Arg_10: 3 {O(1)}

  15: f53->f38, Arg_11: 2 {O(1)}

  15: f53->f38, Arg_12: 1 {O(1)}

  15: f53->f38, Arg_15: 2 {O(1)}

  15: f53->f38, Arg_16: 2 {O(1)}

  15: f53->f38, Arg_22: Arg_22 {O(n)}

  16: f53->f38, Arg_0: min([2, Arg_0]) {O(n)}

  16: f53->f38, Arg_7: min([1, Arg_7]) {O(n)}

  16: f53->f38, Arg_8: min([1, Arg_8]) {O(n)}

  16: f53->f38, Arg_9: 1 {O(1)}

  16: f53->f38, Arg_10: 2 {O(1)}

  16: f53->f38, Arg_11: 1 {O(1)}

  16: f53->f38, Arg_12: 1 {O(1)}

  16: f53->f38, Arg_15: 2 {O(1)}

  16: f53->f38, Arg_16: 2 {O(1)}

  16: f53->f38, Arg_22: Arg_22 {O(n)}

`Upper:

  1: f13->f16, Arg_0: 1 {O(1)}

  1: f13->f16, Arg_7: Arg_7 {O(n)}

  1: f13->f16, Arg_8: Arg_8+max([0, 1+Arg_7-Arg_8]) {O(n)}

  1: f13->f16, Arg_9: Arg_9 {O(n)}

  1: f13->f16, Arg_10: Arg_10+max([0, 1+Arg_9-Arg_10]) {O(n)}

  1: f13->f16, Arg_11: Arg_11+max([0, 2*(1+Arg_9-Arg_10)]) {O(n)}

  1: f13->f16, Arg_12: Arg_12 {O(n)}

  1: f13->f16, Arg_13: Arg_13 {O(n)}

  1: f13->f16, Arg_14: Arg_14 {O(n)}

  1: f13->f16, Arg_15: Arg_15 {O(n)}

  1: f13->f16, Arg_16: Arg_16 {O(n)}

  1: f13->f16, Arg_17: Arg_17 {O(n)}

  1: f13->f16, Arg_18: Arg_18 {O(n)}

  1: f13->f16, Arg_19: Arg_19 {O(n)}

  1: f13->f16, Arg_20: Arg_20 {O(n)}

  1: f13->f16, Arg_21: Arg_21 {O(n)}

  1: f13->f16, Arg_22: Arg_22 {O(n)}

  23: f13->f27, Arg_0: 1 {O(1)}

  23: f13->f27, Arg_7: Arg_7 {O(n)}

  23: f13->f27, Arg_8: max([Arg_8, Arg_8+max([0, 1+Arg_7-Arg_8])]) {O(n)}

  23: f13->f27, Arg_9: Arg_9 {O(n)}

  23: f13->f27, Arg_10: max([Arg_10, Arg_10+max([0, 1+Arg_9-Arg_10])]) {O(n)}

  23: f13->f27, Arg_11: max([Arg_11, Arg_11+max([0, 2*(1+Arg_9-Arg_10)])]) {O(n)}

  23: f13->f27, Arg_12: Arg_12 {O(n)}

  23: f13->f27, Arg_13: Arg_13 {O(n)}

  23: f13->f27, Arg_14: Arg_14 {O(n)}

  23: f13->f27, Arg_15: Arg_15 {O(n)}

  23: f13->f27, Arg_16: Arg_16 {O(n)}

  23: f13->f27, Arg_17: Arg_17 {O(n)}

  23: f13->f27, Arg_18: Arg_18 {O(n)}

  23: f13->f27, Arg_19: Arg_19 {O(n)}

  23: f13->f27, Arg_20: Arg_20 {O(n)}

  23: f13->f27, Arg_21: Arg_21 {O(n)}

  23: f13->f27, Arg_22: Arg_22 {O(n)}

  2: f16->f16, Arg_0: 1 {O(1)}

  2: f16->f16, Arg_7: Arg_7 {O(n)}

  2: f16->f16, Arg_8: Arg_8+max([0, 1+Arg_7-Arg_8]) {O(n)}

  2: f16->f16, Arg_9: Arg_9 {O(n)}

  2: f16->f16, Arg_10: Arg_10+max([0, 1+Arg_9-Arg_10]) {O(n)}

  2: f16->f16, Arg_11: Arg_11+max([0, 2*(1+Arg_9-Arg_10)]) {O(n)}

  2: f16->f16, Arg_12: Arg_12 {O(n)}

  2: f16->f16, Arg_13: Arg_13 {O(n)}

  2: f16->f16, Arg_14: Arg_14 {O(n)}

  2: f16->f16, Arg_15: Arg_15 {O(n)}

  2: f16->f16, Arg_16: Arg_16 {O(n)}

  2: f16->f16, Arg_17: Arg_17 {O(n)}

  2: f16->f16, Arg_18: Arg_18 {O(n)}

  2: f16->f16, Arg_19: Arg_19 {O(n)}

  2: f16->f16, Arg_20: Arg_20 {O(n)}

  2: f16->f16, Arg_21: Arg_21 {O(n)}

  2: f16->f16, Arg_22: Arg_22 {O(n)}

  22: f16->f13, Arg_0: 1 {O(1)}

  22: f16->f13, Arg_7: Arg_7 {O(n)}

  22: f16->f13, Arg_8: Arg_8+max([0, 1+Arg_7-Arg_8]) {O(n)}

  22: f16->f13, Arg_9: Arg_9 {O(n)}

  22: f16->f13, Arg_10: Arg_10+max([0, 1+Arg_9-Arg_10]) {O(n)}

  22: f16->f13, Arg_11: Arg_11+max([0, 2*(1+Arg_9-Arg_10)]) {O(n)}

  22: f16->f13, Arg_12: Arg_12 {O(n)}

  22: f16->f13, Arg_13: Arg_13 {O(n)}

  22: f16->f13, Arg_14: Arg_14 {O(n)}

  22: f16->f13, Arg_15: Arg_15 {O(n)}

  22: f16->f13, Arg_16: Arg_16 {O(n)}

  22: f16->f13, Arg_17: Arg_17 {O(n)}

  22: f16->f13, Arg_18: Arg_18 {O(n)}

  22: f16->f13, Arg_19: Arg_19 {O(n)}

  22: f16->f13, Arg_20: Arg_20 {O(n)}

  22: f16->f13, Arg_21: Arg_21 {O(n)}

  22: f16->f13, Arg_22: Arg_22 {O(n)}

  0: f2->f13, Arg_0: 1 {O(1)}

  0: f2->f13, Arg_7: Arg_7 {O(n)}

  0: f2->f13, Arg_8: Arg_8 {O(n)}

  0: f2->f13, Arg_9: Arg_9 {O(n)}

  0: f2->f13, Arg_10: Arg_10 {O(n)}

  0: f2->f13, Arg_11: Arg_11 {O(n)}

  0: f2->f13, Arg_12: Arg_12 {O(n)}

  0: f2->f13, Arg_13: Arg_13 {O(n)}

  0: f2->f13, Arg_14: Arg_14 {O(n)}

  0: f2->f13, Arg_15: Arg_15 {O(n)}

  0: f2->f13, Arg_16: Arg_16 {O(n)}

  0: f2->f13, Arg_17: Arg_17 {O(n)}

  0: f2->f13, Arg_18: Arg_18 {O(n)}

  0: f2->f13, Arg_19: Arg_19 {O(n)}

  0: f2->f13, Arg_20: Arg_20 {O(n)}

  0: f2->f13, Arg_21: Arg_21 {O(n)}

  0: f2->f13, Arg_22: Arg_22 {O(n)}

  3: f2->f27, Arg_0: 0 {O(1)}

  3: f2->f27, Arg_7: Arg_7 {O(n)}

  3: f2->f27, Arg_8: Arg_8 {O(n)}

  3: f2->f27, Arg_9: Arg_9 {O(n)}

  3: f2->f27, Arg_10: Arg_10 {O(n)}

  3: f2->f27, Arg_11: Arg_11 {O(n)}

  3: f2->f27, Arg_12: Arg_12 {O(n)}

  3: f2->f27, Arg_13: Arg_13 {O(n)}

  3: f2->f27, Arg_14: Arg_14 {O(n)}

  3: f2->f27, Arg_15: Arg_15 {O(n)}

  3: f2->f27, Arg_16: Arg_16 {O(n)}

  3: f2->f27, Arg_17: Arg_17 {O(n)}

  3: f2->f27, Arg_18: Arg_18 {O(n)}

  3: f2->f27, Arg_19: Arg_19 {O(n)}

  3: f2->f27, Arg_20: Arg_20 {O(n)}

  3: f2->f27, Arg_21: Arg_21 {O(n)}

  3: f2->f27, Arg_22: Arg_22 {O(n)}

  4: f2->f27, Arg_0: Arg_0 {O(n)}

  4: f2->f27, Arg_7: Arg_7 {O(n)}

  4: f2->f27, Arg_8: Arg_8 {O(n)}

  4: f2->f27, Arg_9: Arg_9 {O(n)}

  4: f2->f27, Arg_10: Arg_10 {O(n)}

  4: f2->f27, Arg_11: Arg_11 {O(n)}

  4: f2->f27, Arg_12: Arg_12 {O(n)}

  4: f2->f27, Arg_13: Arg_13 {O(n)}

  4: f2->f27, Arg_14: Arg_14 {O(n)}

  4: f2->f27, Arg_15: Arg_15 {O(n)}

  4: f2->f27, Arg_16: Arg_16 {O(n)}

  4: f2->f27, Arg_17: Arg_17 {O(n)}

  4: f2->f27, Arg_18: Arg_18 {O(n)}

  4: f2->f27, Arg_19: Arg_19 {O(n)}

  4: f2->f27, Arg_20: Arg_20 {O(n)}

  4: f2->f27, Arg_21: Arg_21 {O(n)}

  4: f2->f27, Arg_22: Arg_22 {O(n)}

  5: f27->f35, Arg_0: max([0, Arg_0]) {O(n)}

  5: f27->f35, Arg_7: Arg_7 {O(n)}

  5: f27->f35, Arg_8: 0 {O(1)}

  5: f27->f35, Arg_9: Arg_9 {O(n)}

  5: f27->f35, Arg_10: 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  5: f27->f35, Arg_11: max([1, max([Arg_9, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, 2+Arg_9+max([-2, -(Arg_10)])])])])])])])])]) {O(n)}

  5: f27->f35, Arg_12: max([2+Arg_7-Arg_8, max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])]) {O(n)}

  5: f27->f35, Arg_13: 1 {O(1)}

  5: f27->f35, Arg_14: 0 {O(1)}

  5: f27->f35, Arg_15: Arg_15 {O(n)}

  5: f27->f35, Arg_16: 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  5: f27->f35, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  5: f27->f35, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  6: f27->f35, Arg_0: max([0, Arg_0]) {O(n)}

  6: f27->f35, Arg_7: Arg_7 {O(n)}

  6: f27->f35, Arg_8: 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  6: f27->f35, Arg_9: Arg_9 {O(n)}

  6: f27->f35, Arg_10: 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  6: f27->f35, Arg_11: max([1, max([Arg_9, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, 2+Arg_9+max([-2, -(Arg_10)])])])])])])])])]) {O(n)}

  6: f27->f35, Arg_12: Arg_7 {O(n)}

  6: f27->f35, Arg_13: 1 {O(1)}

  6: f27->f35, Arg_14: 0 {O(1)}

  6: f27->f35, Arg_15: Arg_15 {O(n)}

  6: f27->f35, Arg_16: 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  6: f27->f35, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  6: f27->f35, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  7: f27->f35, Arg_0: max([0, Arg_0]) {O(n)}

  7: f27->f35, Arg_7: Arg_7 {O(n)}

  7: f27->f35, Arg_8: 1 {O(1)}

  7: f27->f35, Arg_9: Arg_9 {O(n)}

  7: f27->f35, Arg_10: 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  7: f27->f35, Arg_11: max([1, max([Arg_9, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, 2+Arg_9+max([-2, -(Arg_10)])])])])])])])])]) {O(n)}

  7: f27->f35, Arg_12: 1 {O(1)}

  7: f27->f35, Arg_13: 1 {O(1)}

  7: f27->f35, Arg_14: 0 {O(1)}

  7: f27->f35, Arg_15: Arg_15 {O(n)}

  7: f27->f35, Arg_16: 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  7: f27->f35, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  7: f27->f35, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  19: f27->f1, Arg_0: -2 {O(1)}

  19: f27->f1, Arg_7: Arg_7 {O(n)}

  19: f27->f1, Arg_8: max([Arg_8, 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])]) {O(n)}

  19: f27->f1, Arg_9: Arg_9 {O(n)}

  19: f27->f1, Arg_10: max([Arg_10, 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])]) {O(n)}

  19: f27->f1, Arg_11: max([1, max([Arg_9, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, 2+Arg_9+max([-2, -(Arg_10)])])])])])])])])])]) {O(n)}

  19: f27->f1, Arg_12: max([1, max([Arg_7, max([Arg_7, max([Arg_12, max([2+Arg_7-Arg_8, max([2+Arg_7+max([-1, -(Arg_8)]), max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])])])])])]) {O(n)}

  19: f27->f1, Arg_15: Arg_15 {O(n)}

  19: f27->f1, Arg_16: max([Arg_16, 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])]) {O(n)}

  19: f27->f1, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  19: f27->f1, Arg_22: max([Arg_22, Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]))]) {O(n)}

  20: f27->f1, Arg_0: max([1, Arg_0]) {O(n)}

  20: f27->f1, Arg_7: Arg_7 {O(n)}

  20: f27->f1, Arg_8: max([Arg_8, max([Arg_8, max([Arg_8+max([0, 1+Arg_7-Arg_8]), 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])])])]) {O(n)}

  20: f27->f1, Arg_9: Arg_9 {O(n)}

  20: f27->f1, Arg_10: max([Arg_10, max([Arg_10, max([Arg_10+max([0, 1+Arg_9-Arg_10]), 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])])])]) {O(n)}

  20: f27->f1, Arg_11: max([1, max([Arg_11, max([Arg_9, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([2+Arg_9+max([-2, -(Arg_10)]), Arg_11+max([0, 2*(1+Arg_9-Arg_10)])])])])])])])])])])])])]) {O(n)}

  20: f27->f1, Arg_12: max([1, max([Arg_7, max([Arg_7, max([Arg_12, max([Arg_12, max([Arg_12, max([2+Arg_7-Arg_8, max([2+Arg_7+max([-1, -(Arg_8)]), max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])])])])])])])]) {O(n)}

  20: f27->f1, Arg_15: Arg_15 {O(n)}

  20: f27->f1, Arg_16: max([Arg_16, 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])]) {O(n)}

  20: f27->f1, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  20: f27->f1, Arg_22: max([Arg_22, Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]))]) {O(n)}

  21: f27->f1, Arg_0: -1 {O(1)}

  21: f27->f1, Arg_7: Arg_7 {O(n)}

  21: f27->f1, Arg_8: max([Arg_8, 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])]) {O(n)}

  21: f27->f1, Arg_9: Arg_9 {O(n)}

  21: f27->f1, Arg_10: max([Arg_10, 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])]) {O(n)}

  21: f27->f1, Arg_11: max([1, max([Arg_9, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, 2+Arg_9+max([-2, -(Arg_10)])])])])])])])])])]) {O(n)}

  21: f27->f1, Arg_12: max([1, max([Arg_7, max([Arg_7, max([Arg_12, max([2+Arg_7-Arg_8, max([2+Arg_7+max([-1, -(Arg_8)]), max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])])])])])]) {O(n)}

  21: f27->f1, Arg_15: Arg_15 {O(n)}

  21: f27->f1, Arg_16: max([Arg_16, 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])]) {O(n)}

  21: f27->f1, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  21: f27->f1, Arg_22: max([Arg_22, Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]))]) {O(n)}

  8: f35->f38, Arg_0: max([0, Arg_0]) {O(n)}

  8: f35->f38, Arg_7: Arg_7 {O(n)}

  8: f35->f38, Arg_8: 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  8: f35->f38, Arg_9: Arg_9 {O(n)}

  8: f35->f38, Arg_10: 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  8: f35->f38, Arg_11: max([1, max([Arg_9, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, 2+Arg_9+max([-2, -(Arg_10)])])])])])])])])]) {O(n)}

  8: f35->f38, Arg_12: max([1, max([Arg_7, max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])]) {O(n)}

  8: f35->f38, Arg_15: Arg_15 {O(n)}

  8: f35->f38, Arg_16: 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  8: f35->f38, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  8: f35->f38, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  18: f35->f27, Arg_0: max([0, Arg_0]) {O(n)}

  18: f35->f27, Arg_7: Arg_7 {O(n)}

  18: f35->f27, Arg_8: 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  18: f35->f27, Arg_9: Arg_9 {O(n)}

  18: f35->f27, Arg_10: 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  18: f35->f27, Arg_11: max([1, max([Arg_9, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, 2+Arg_9+max([-2, -(Arg_10)])])])])])])])])]) {O(n)}

  18: f35->f27, Arg_12: max([1, max([Arg_7, max([Arg_7, max([2+Arg_7-Arg_8, max([2+Arg_7+max([-1, -(Arg_8)]), max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])])])])]) {O(n)}

  18: f35->f27, Arg_15: Arg_15 {O(n)}

  18: f35->f27, Arg_16: 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  18: f35->f27, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  18: f35->f27, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  9: f38->f53, Arg_0: max([0, Arg_0]) {O(n)}

  9: f38->f53, Arg_7: Arg_7 {O(n)}

  9: f38->f53, Arg_8: 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  9: f38->f53, Arg_9: Arg_9 {O(n)}

  9: f38->f53, Arg_10: 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  9: f38->f53, Arg_11: max([1, max([Arg_9, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, 2+Arg_9+max([-2, -(Arg_10)])])])])])])])])]) {O(n)}

  9: f38->f53, Arg_12: max([1, max([Arg_7, max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])]) {O(n)}

  9: f38->f53, Arg_15: Arg_15 {O(n)}

  9: f38->f53, Arg_16: 0 {O(1)}

  9: f38->f53, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  9: f38->f53, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  10: f38->f53, Arg_0: max([0, Arg_0]) {O(n)}

  10: f38->f53, Arg_7: Arg_7 {O(n)}

  10: f38->f53, Arg_8: 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  10: f38->f53, Arg_9: Arg_9 {O(n)}

  10: f38->f53, Arg_10: 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  10: f38->f53, Arg_11: max([1, max([1, max([Arg_9, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_9, 2+Arg_9+max([-2, -(Arg_10)])])])])])])])])])])]) {O(n)}

  10: f38->f53, Arg_12: max([1, max([Arg_7, max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])]) {O(n)}

  10: f38->f53, Arg_15: Arg_15 {O(n)}

  10: f38->f53, Arg_16: 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  10: f38->f53, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  10: f38->f53, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  11: f38->f38, Arg_0: max([0, Arg_0]) {O(n)}

  11: f38->f38, Arg_7: Arg_7 {O(n)}

  11: f38->f38, Arg_8: 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  11: f38->f38, Arg_9: Arg_9 {O(n)}

  11: f38->f38, Arg_10: 1 {O(1)}

  11: f38->f38, Arg_12: max([1, max([Arg_7, max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])]) {O(n)}

  11: f38->f38, Arg_15: Arg_15 {O(n)}

  11: f38->f38, Arg_16: 1 {O(1)}

  11: f38->f38, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  11: f38->f38, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  12: f38->f38, Arg_0: max([0, Arg_0]) {O(n)}

  12: f38->f38, Arg_7: Arg_7 {O(n)}

  12: f38->f38, Arg_8: 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  12: f38->f38, Arg_9: Arg_9 {O(n)}

  12: f38->f38, Arg_10: 2*max([0, Arg_9-Arg_10])+max([2, 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10])+max([0, Arg_9-Arg_10]) {O(n)}

  12: f38->f38, Arg_12: max([1, max([Arg_7, max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])]) {O(n)}

  12: f38->f38, Arg_15: Arg_15 {O(n)}

  12: f38->f38, Arg_16: 1 {O(1)}

  12: f38->f38, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  12: f38->f38, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  13: f38->f38, Arg_0: max([0, Arg_0]) {O(n)}

  13: f38->f38, Arg_7: Arg_7 {O(n)}

  13: f38->f38, Arg_8: 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  13: f38->f38, Arg_9: Arg_9 {O(n)}

  13: f38->f38, Arg_10: 2 {O(1)}

  13: f38->f38, Arg_11: 1 {O(1)}

  13: f38->f38, Arg_12: max([1, max([Arg_7, max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])]) {O(n)}

  13: f38->f38, Arg_15: Arg_15 {O(n)}

  13: f38->f38, Arg_16: 1 {O(1)}

  13: f38->f38, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  13: f38->f38, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  17: f38->f35, Arg_0: max([0, Arg_0]) {O(n)}

  17: f38->f35, Arg_7: Arg_7 {O(n)}

  17: f38->f35, Arg_8: 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  17: f38->f35, Arg_9: Arg_9 {O(n)}

  17: f38->f35, Arg_10: 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  17: f38->f35, Arg_11: max([1, max([Arg_9, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, max([Arg_11, 2+Arg_9+max([-2, -(Arg_10)])])])])])])])])]) {O(n)}

  17: f38->f35, Arg_12: max([1, max([Arg_7, max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])]) {O(n)}

  17: f38->f35, Arg_15: Arg_15 {O(n)}

  17: f38->f35, Arg_16: 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  17: f38->f35, Arg_21: max([Arg_21, 2+Arg_15]) {O(n)}

  17: f38->f35, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  14: f53->f38, Arg_0: max([0, Arg_0]) {O(n)}

  14: f53->f38, Arg_7: Arg_7 {O(n)}

  14: f53->f38, Arg_8: 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  14: f53->f38, Arg_9: Arg_9 {O(n)}

  14: f53->f38, Arg_10: 1 {O(1)}

  14: f53->f38, Arg_11: 2+Arg_9+max([-2, -(Arg_10)]) {O(n)}

  14: f53->f38, Arg_12: max([1, max([Arg_7, max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])]) {O(n)}

  14: f53->f38, Arg_15: Arg_15 {O(n)}

  14: f53->f38, Arg_16: 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  14: f53->f38, Arg_21: 2+Arg_15 {O(n)}

  14: f53->f38, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  15: f53->f38, Arg_0: max([0, Arg_0]) {O(n)}

  15: f53->f38, Arg_7: Arg_7 {O(n)}

  15: f53->f38, Arg_8: 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  15: f53->f38, Arg_9: Arg_9 {O(n)}

  15: f53->f38, Arg_10: 2*max([0, -(Arg_10)+2*Arg_9])+max([2, Arg_10])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9])+max([0, -(Arg_10)+2*Arg_9]) {O(n)}

  15: f53->f38, Arg_11: Arg_9 {O(n)}

  15: f53->f38, Arg_12: max([1, max([Arg_7, max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])]) {O(n)}

  15: f53->f38, Arg_15: Arg_15 {O(n)}

  15: f53->f38, Arg_16: 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  15: f53->f38, Arg_21: 2+Arg_15 {O(n)}

  15: f53->f38, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}

  16: f53->f38, Arg_0: max([0, Arg_0]) {O(n)}

  16: f53->f38, Arg_7: Arg_7 {O(n)}

  16: f53->f38, Arg_8: 2*max([0, Arg_7+Arg_15-Arg_8])+max([1, Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8])+max([0, Arg_7+Arg_15-Arg_8]) {O(n)}

  16: f53->f38, Arg_9: Arg_9 {O(n)}

  16: f53->f38, Arg_10: 2 {O(1)}

  16: f53->f38, Arg_11: 1 {O(1)}

  16: f53->f38, Arg_12: max([1, max([Arg_7, max([2+Arg_7+max([-1, -(Arg_8)]), 2+Arg_7-Arg_8])])]) {O(n)}

  16: f53->f38, Arg_15: Arg_15 {O(n)}

  16: f53->f38, Arg_16: 2*max([0, 1-Arg_16+2*Arg_15])+max([1, Arg_16])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15]) {O(n)}

  16: f53->f38, Arg_21: 2+Arg_15 {O(n)}

  16: f53->f38, Arg_22: Arg_22+2*(2*max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])+max([0, 1-Arg_16+2*Arg_15])) {O(n)}


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

(2)
BOUNDS(1, nat(2 + 2 * Arg_7 + -2 * Arg_8) + nat(2 + -2 * Arg_8) + max(6 + -16 * Arg_10 + 32 * Arg_9, 6) + nat(4 + -4 * Arg_10) + nat(13 + -13 * Arg_10 + 13 * Arg_9) + nat(-2 * Arg_10 + 4 * Arg_9) + nat(8 + -8 * Arg_10) + nat(-4 * Arg_10 + 4 * Arg_9) + nat(4 * Arg_15 + 4 * Arg_7 + -4 * Arg_8) + nat(8 + -4 * Arg_8) + nat(-2 * Arg_10 + 2 * Arg_9) + nat(5 + 5 * Arg_7 + -5 * Arg_8) + nat(4 + -4 * Arg_8) + max(1, 2 + Arg_7 + -1 * Arg_8) + nat(12 + 24 * Arg_15 + -12 * Arg_16) + nat(2 * Arg_15 + 2 * Arg_7 + -2 * Arg_8) + nat(4 + -2 * Arg_8))

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

(3) Loat Proof (FINISHED)


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



Initial linear ITS problem

   Start location: f2

      0: f2 -> f13 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 ], cost: 1

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

      1: f13 -> f16 : [ H>=Q ], cost: 1

     23: f13 -> f27 : [ Q>=1+H ], cost: 1

      2: f16 -> f16 : K'=1+K, L'=2+L, [ J>=K ], cost: 1

     22: f16 -> f13 : Q'=1+Q, [ K>=1+J ], cost: 1

      5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1

      6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1

      7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1

     19: f27 -> 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, [ 0>=2+A && Q>=1+H ], cost: 1

     20: f27 -> 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, [ A>=0 && Q>=1+H ], cost: 1

     21: f27 -> f1 : A'=-1, 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, [ Q>=1+H && 1+A==0 ], cost: 1

      8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1

     18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1

      9: f38 -> f53 : [ 0>=Q_1 && J>=K ], cost: 1

     10: f38 -> f53 : [ Q_1>=2 && J>=K ], cost: 1

     11: f38 -> f38 : K'=1+K, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && J>=K && Q_1==1 ], cost: 1

     12: f38 -> f38 : K'=1+K, L'=3+free_35, Q_1'=1, R'=B*free_29+B*free_32, S'=free_36*B-free_33*B, T'=free_30*C-free_34*C, U'=-free_31*C-free_28*C, [ J>=K+4*free_35 && K+5*free_35>=1+J && J>=K && K>=2 && Q_1==1 ], cost: 1

     13: f38 -> f38 : K'=2, L'=1, Q_1'=1, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, [ J>=1 && K==1 && Q_1==1 ], cost: 1

     17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1

     14: f53 -> f38 : K'=1+K, L'=2+J-K, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, [ Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K ], cost: 1

     15: f53 -> f38 : K'=1+K, L'=2+J-K, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, [ Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 1

     16: f53 -> f38 : K'=2, L'=1, R'=free_64*B+B*free_70, S'=B*free_67-free_71*B, T'=-free_65*C+free_68*C, U'=-free_66*C-free_69*C, V'=3+P-free_63, [ Q_1>=2*free_63 && 3*free_63>=1+Q_1 && K==1 ], cost: 1



Removed unreachable and leaf rules:

   Start location: f2

      0: f2 -> f13 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 ], cost: 1

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

      1: f13 -> f16 : [ H>=Q ], cost: 1

     23: f13 -> f27 : [ Q>=1+H ], cost: 1

      2: f16 -> f16 : K'=1+K, L'=2+L, [ J>=K ], cost: 1

     22: f16 -> f13 : Q'=1+Q, [ K>=1+J ], cost: 1

      5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1

      6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1

      7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1

      8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1

     18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1

      9: f38 -> f53 : [ 0>=Q_1 && J>=K ], cost: 1

     10: f38 -> f53 : [ Q_1>=2 && J>=K ], cost: 1

     11: f38 -> f38 : K'=1+K, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && J>=K && Q_1==1 ], cost: 1

     12: f38 -> f38 : K'=1+K, L'=3+free_35, Q_1'=1, R'=B*free_29+B*free_32, S'=free_36*B-free_33*B, T'=free_30*C-free_34*C, U'=-free_31*C-free_28*C, [ J>=K+4*free_35 && K+5*free_35>=1+J && J>=K && K>=2 && Q_1==1 ], cost: 1

     13: f38 -> f38 : K'=2, L'=1, Q_1'=1, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, [ J>=1 && K==1 && Q_1==1 ], cost: 1

     17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1

     14: f53 -> f38 : K'=1+K, L'=2+J-K, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, [ Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K ], cost: 1

     15: f53 -> f38 : K'=1+K, L'=2+J-K, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, [ Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 1

     16: f53 -> f38 : K'=2, L'=1, R'=free_64*B+B*free_70, S'=B*free_67-free_71*B, T'=-free_65*C+free_68*C, U'=-free_66*C-free_69*C, V'=3+P-free_63, [ Q_1>=2*free_63 && 3*free_63>=1+Q_1 && K==1 ], cost: 1



### Simplification by acceleration and chaining ###



Accelerating simple loops of location 2.

   Accelerating the following rules:

      2: f16 -> f16 : K'=1+K, L'=2+L, [ J>=K ], cost: 1



   Accelerated rule 2 with metering function 1+J-K, yielding the new rule 24.

   Removing the simple loops: 2.



Accelerating simple loops of location 5.

   Accelerating the following rules:

     11: f38 -> f38 : K'=1+K, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 ], cost: 1

     12: f38 -> f38 : K'=1+K, L'=3+free_35, Q_1'=1, R'=B*free_29+B*free_32, S'=free_36*B-free_33*B, T'=free_30*C-free_34*C, U'=-free_31*C-free_28*C, [ J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 1

     13: f38 -> f38 : K'=2, L'=1, Q_1'=1, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, [ J>=1 && K==1 && Q_1==1 ], cost: 1



   Accelerated rule 11 with backward acceleration, yielding the new rule 25.

   Accelerated rule 11 with backward acceleration, yielding the new rule 26.

   Accelerated rule 12 with metering function 1+J-K-4*free_35, yielding the new rule 27.

   Accelerated rule 13 with metering function 2-K, yielding the new rule 28.

   Nested simple loops 13 (outer loop) and 25 (inner loop) with metering function J-4*free_26, resulting in the new rules: 29.

   Removing the simple loops: 11 12 13.



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

   Start location: f2

      0: f2 -> f13 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 ], cost: 1

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

      1: f13 -> f16 : [ H>=Q ], cost: 1

     23: f13 -> f27 : [ Q>=1+H ], cost: 1

     22: f16 -> f13 : Q'=1+Q, [ K>=1+J ], cost: 1

     24: f16 -> f16 : K'=1+J, L'=2+2*J-2*K+L, [ J>=K ], cost: 1+J-K

      5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1

      6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1

      7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1

      8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1

     18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1

      9: f38 -> f53 : [ 0>=Q_1 && J>=K ], cost: 1

     10: f38 -> f53 : [ Q_1>=2 && J>=K ], cost: 1

     17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1

     25: f38 -> f38 : K'=1+J-4*free_26, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 1+J-K-4*free_26

     26: f38 -> f38 : K'=1, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 1-K

     27: f38 -> f38 : K'=1+J-4*free_35, L'=3+free_35, Q_1'=1, R'=B*free_29+B*free_32, S'=free_36*B-free_33*B, T'=free_30*C-free_34*C, U'=-free_31*C-free_28*C, [ J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 1+J-K-4*free_35

     28: f38 -> f38 : K'=2, L'=1, Q_1'=1, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, [ J>=1 && K==1 && Q_1==1 ], cost: 2-K

     29: f38 -> f38 : K'=2, L'=1, Q_1'=1, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, [ J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && J>=1 && 1+J-4*free_26==1 && J-4*free_26>=1 ], cost: -4*(J-4*free_26)*free_26+J*(J-4*free_26)

     14: f53 -> f38 : K'=1+K, L'=2+J-K, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, [ Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K ], cost: 1

     15: f53 -> f38 : K'=1+K, L'=2+J-K, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, [ Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 1

     16: f53 -> f38 : K'=2, L'=1, R'=free_64*B+B*free_70, S'=B*free_67-free_71*B, T'=-free_65*C+free_68*C, U'=-free_66*C-free_69*C, V'=3+P-free_63, [ Q_1>=2*free_63 && 3*free_63>=1+Q_1 && K==1 ], cost: 1



Chained accelerated rules (with incoming rules):

   Start location: f2

      0: f2 -> f13 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 ], cost: 1

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

      1: f13 -> f16 : [ H>=Q ], cost: 1

     23: f13 -> f27 : [ Q>=1+H ], cost: 1

     30: f13 -> f16 : K'=1+J, L'=2+2*J-2*K+L, [ H>=Q && J>=K ], cost: 2+J-K

     22: f16 -> f13 : Q'=1+Q, [ K>=1+J ], cost: 1

      5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1

      6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1

      7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1

      8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1

     18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1

     31: f35 -> f38 : K'=1+J-4*free_26, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 2+J-K-4*free_26

     32: f35 -> f38 : K'=1, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 2-K

     33: f35 -> f38 : K'=1+J-4*free_35, L'=3+free_35, Q_1'=1, R'=B*free_29+B*free_32, S'=free_36*B-free_33*B, T'=free_30*C-free_34*C, U'=-free_31*C-free_28*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 2+J-K-4*free_35

     34: f35 -> f38 : K'=2, L'=1, Q_1'=1, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=1 && K==1 && Q_1==1 ], cost: 3-K

      9: f38 -> f53 : [ 0>=Q_1 && J>=K ], cost: 1

     10: f38 -> f53 : [ Q_1>=2 && J>=K ], cost: 1

     17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1

     14: f53 -> f38 : K'=1+K, L'=2+J-K, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, [ Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K ], cost: 1

     15: f53 -> f38 : K'=1+K, L'=2+J-K, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, [ Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 1

     16: f53 -> f38 : K'=2, L'=1, R'=free_64*B+B*free_70, S'=B*free_67-free_71*B, T'=-free_65*C+free_68*C, U'=-free_66*C-free_69*C, V'=3+P-free_63, [ Q_1>=2*free_63 && 3*free_63>=1+Q_1 && K==1 ], cost: 1



Eliminated locations (on tree-shaped paths):

   Start location: f2

      0: f2 -> f13 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 ], cost: 1

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

     23: f13 -> f27 : [ Q>=1+H ], cost: 1

     35: f13 -> f13 : Q'=1+Q, [ H>=Q && K>=1+J ], cost: 2

     36: f13 -> f13 : Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ H>=Q && J>=K ], cost: 3+J-K

      5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1

      6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1

      7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1

      8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1

     18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1

     31: f35 -> f38 : K'=1+J-4*free_26, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 2+J-K-4*free_26

     32: f35 -> f38 : K'=1, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 2-K

     33: f35 -> f38 : K'=1+J-4*free_35, L'=3+free_35, Q_1'=1, R'=B*free_29+B*free_32, S'=free_36*B-free_33*B, T'=free_30*C-free_34*C, U'=-free_31*C-free_28*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 2+J-K-4*free_35

     34: f35 -> f38 : K'=2, L'=1, Q_1'=1, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=1 && K==1 && Q_1==1 ], cost: 3-K

     17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1

     37: f38 -> f38 : K'=1+K, L'=2+J-K, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, [ Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K ], cost: 2

     38: f38 -> f38 : K'=1+K, L'=2+J-K, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, [ Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 2

     39: f38 -> f38 : K'=2, L'=1, R'=free_64*B+B*free_70, S'=B*free_67-free_71*B, T'=-free_65*C+free_68*C, U'=-free_66*C-free_69*C, V'=3+P-free_63, [ Q_1>=2 && J>=K && Q_1>=2*free_63 && 3*free_63>=1+Q_1 && K==1 ], cost: 2



Accelerating simple loops of location 1.

   Accelerating the following rules:

     35: f13 -> f13 : Q'=1+Q, [ H>=Q && K>=1+J ], cost: 2

     36: f13 -> f13 : Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ H>=Q && J>=K ], cost: 3+J-K



   Accelerated rule 35 with metering function 1+H-Q, yielding the new rule 40.

   Found no metering function for rule 36.

   Removing the simple loops: 35.



Accelerating simple loops of location 5.

   Accelerating the following rules:

     37: f38 -> f38 : K'=1+K, L'=2+J-K, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, [ Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K ], cost: 2

     38: f38 -> f38 : K'=1+K, L'=2+J-K, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, [ Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 2

     39: f38 -> f38 : K'=2, L'=1, R'=free_64*B+B*free_70, S'=B*free_67-free_71*B, T'=-free_65*C+free_68*C, U'=-free_66*C-free_69*C, V'=3+P-free_63, [ Q_1>=2 && J>=K && Q_1>=2*free_63 && 3*free_63>=1+Q_1 && K==1 ], cost: 2



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

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

   Accelerated rule 38 with metering function 1+J-K, yielding the new rule 43.

   Accelerated rule 39 with metering function 1-K, yielding the new rule 44.

   Removing the simple loops: 37 38 39.



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

   Start location: f2

      0: f2 -> f13 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 ], cost: 1

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

     23: f13 -> f27 : [ Q>=1+H ], cost: 1

     36: f13 -> f13 : Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ H>=Q && J>=K ], cost: 3+J-K

     40: f13 -> f13 : Q'=1+H, [ H>=Q && K>=1+J ], cost: 2+2*H-2*Q

      5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1

      6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1

      7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1

      8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1

     18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1

     31: f35 -> f38 : K'=1+J-4*free_26, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 2+J-K-4*free_26

     32: f35 -> f38 : K'=1, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 2-K

     33: f35 -> f38 : K'=1+J-4*free_35, L'=3+free_35, Q_1'=1, R'=B*free_29+B*free_32, S'=free_36*B-free_33*B, T'=free_30*C-free_34*C, U'=-free_31*C-free_28*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 2+J-K-4*free_35

     34: f35 -> f38 : K'=2, L'=1, Q_1'=1, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=1 && K==1 && Q_1==1 ], cost: 3-K

     17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1

     41: f38 -> f38 : K'=1+J, L'=2, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, [ Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 2+2*J-2*K

     42: f38 -> f38 : K'=1, L'=2+J, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, [ Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && J>=0 ], cost: 2-2*K

     43: f38 -> f38 : K'=1+J, L'=2, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, [ Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 2+2*J-2*K

     44: f38 -> f38 : K'=2, L'=1, R'=free_64*B+B*free_70, S'=B*free_67-free_71*B, T'=-free_65*C+free_68*C, U'=-free_66*C-free_69*C, V'=3+P-free_63, [ Q_1>=2 && J>=K && Q_1>=2*free_63 && 3*free_63>=1+Q_1 && K==1 && 1-K>=1 ], cost: 2-2*K



Chained accelerated rules (with incoming rules):

   Start location: f2

      0: f2 -> f13 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 ], cost: 1

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

     45: f2 -> f13 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K ], cost: 4+J-K

     46: f2 -> f13 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 3+2*H-2*Q

     23: f13 -> f27 : [ Q>=1+H ], cost: 1

      5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1

      6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1

      7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1

      8: f35 -> f38 : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 ], cost: 1

     18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1

     31: f35 -> f38 : K'=1+J-4*free_26, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 2+J-K-4*free_26

     32: f35 -> f38 : K'=1, L'=3+free_26, Q_1'=1, R'=B*free_20+B*free_23, S'=free_27*B-free_24*B, T'=free_21*C-free_25*C, U'=-free_22*C-free_19*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 2-K

     33: f35 -> f38 : K'=1+J-4*free_35, L'=3+free_35, Q_1'=1, R'=B*free_29+B*free_32, S'=free_36*B-free_33*B, T'=free_30*C-free_34*C, U'=-free_31*C-free_28*C, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 2+J-K-4*free_35

     34: f35 -> f38 : K'=2, L'=1, Q_1'=1, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=1 && K==1 && Q_1==1 ], cost: 3-K

     47: f35 -> f38 : K'=1+J, L'=2, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 3+2*J-2*K

     48: f35 -> f38 : K'=1, L'=2+J, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && J>=0 ], cost: 3-2*K

     49: f35 -> f38 : K'=1+J, L'=2, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 3+2*J-2*K

     17: f38 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ K>=1+J ], cost: 1



Eliminated locations (on tree-shaped paths):

   Start location: f2

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

     50: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 && Q>=1+H ], cost: 2

     51: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K

     52: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q

      5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1

      6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1

      7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1

     18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1

     53: f35 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J ], cost: 2

     54: f35 -> f35 : E'=N, K'=2, L'=1, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=2, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=1 && K==1 && Q_1==1 && 2>=1+J ], cost: 4-K

     55: f35 -> f35 : E'=N, K'=1+J, L'=2, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 4+2*J-2*K

     56: f35 -> f35 : E'=N, K'=1, L'=2+J, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && J>=0 && 1>=1+J ], cost: 4-2*K

     57: f35 -> f35 : E'=N, K'=1+J, L'=2, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 4+2*J-2*K

     58: f35 -> [12] : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 2+J-K-4*free_26

     59: f35 -> [12] : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 2-K

     60: f35 -> [12] : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 2+J-K-4*free_35



Accelerating simple loops of location 4.

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

   Accelerating the following rules:

     53: f35 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J ], cost: 2

     54: f35 -> f35 : E'=N, K'=2, L'=1, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=2, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 4-K

     55: f35 -> f35 : E'=N, K'=1+J, L'=2, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 4+2*J-2*K

     56: f35 -> f35 : E'=N, K'=1, L'=2+J, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 4-2*K

     57: f35 -> f35 : E'=N, K'=1+J, L'=2, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 4+2*J-2*K



   Found no metering function for rule 53 (rule is too complicated).

   Found no metering function for rule 54 (rule is too complicated).

   Found no metering function for rule 55.

   Found no metering function for rule 56 (rule is too complicated).

   Found no metering function for rule 57.

   Removing the simple loops:.



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

   Start location: f2

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

     50: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 && Q>=1+H ], cost: 2

     51: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K

     52: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q

      5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1

      6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1

      7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1

     18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1

     53: f35 -> f35 : E'=N, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J ], cost: 2

     54: f35 -> f35 : E'=N, K'=2, L'=1, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=2, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 4-K

     55: f35 -> f35 : E'=N, K'=1+J, L'=2, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 4+2*J-2*K

     56: f35 -> f35 : E'=N, K'=1, L'=2+J, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 4-2*K

     57: f35 -> f35 : E'=N, K'=1+J, L'=2, N'=N*F+N-G*O, O'=G*N+F*O+O, Q_1'=1+Q_1, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, W'=2+W, [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 4+2*J-2*K

     58: f35 -> [12] : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 2+J-K-4*free_26

     59: f35 -> [12] : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 2-K

     60: f35 -> [12] : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 2+J-K-4*free_35



Chained accelerated rules (with incoming rules):

   Start location: f2

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

     50: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 && Q>=1+H ], cost: 2

     51: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K

     52: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q

      5: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q ], cost: 1

      6: f27 -> f35 : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q ], cost: 1

      7: f27 -> f35 : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 ], cost: 1

     61: f27 -> f35 : E'=1, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J ], cost: 3

     62: f27 -> f35 : E'=1, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J ], cost: 3

     63: f27 -> f35 : E'=1, Q'=1, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J ], cost: 3

     64: f27 -> f35 : E'=1, K'=2, L'=1, M'=2+H-Q, N'=1+F, O'=G, Q_1'=2, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K

     65: f27 -> f35 : E'=1, K'=2, L'=1, M'=2+H-Q, N'=1+F, O'=G, Q_1'=2, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K

     66: f27 -> f35 : E'=1, Q'=1, K'=2, L'=1, M'=1, N'=1+F, O'=G, Q_1'=2, R'=B*free_43+B*free_37, S'=B*free_40-B*free_44, T'=-free_38*C+free_41*C, U'=-free_39*C-C*free_42, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K

     67: f27 -> f35 : E'=1, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 5+2*J-2*K

     68: f27 -> f35 : E'=1, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 5+2*J-2*K

     69: f27 -> f35 : E'=1, Q'=1, K'=1+J, L'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 5+2*J-2*K

     70: f27 -> f35 : E'=1, K'=1, L'=2+J, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

     71: f27 -> f35 : E'=1, K'=1, L'=2+J, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

     72: f27 -> f35 : E'=1, Q'=1, K'=1, L'=2+J, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

     73: f27 -> f35 : E'=1, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K

     74: f27 -> f35 : E'=1, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K

     75: f27 -> f35 : E'=1, Q'=1, K'=1+J, L'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K

     18: f35 -> f27 : Q'=1+Q, [ P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 1

     58: f35 -> [12] : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 2+J-K-4*free_26

     59: f35 -> [12] : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 2-K

     60: f35 -> [12] : [ P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 2+J-K-4*free_35



Eliminated locations (on tree-shaped paths):

   Start location: f2

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

     50: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 && Q>=1+H ], cost: 2

     51: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K

     52: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q

     76: f27 -> f27 : Q'=1+Q, M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q && P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 2

     77: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 3+J-K-4*free_26

     78: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 3-K

     79: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 3+J-K-4*free_35

     80: f27 -> f27 : Q'=1+Q, M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q && P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 2

     81: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 3+J-K-4*free_26

     82: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 3-K

     83: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 3+J-K-4*free_35

     84: f27 -> f27 : Q'=2, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_72 && 3*free_72>=1+P && Q_1>=2+free_72 ], cost: 2

     85: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 3+J-K-4*free_26

     86: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 3-K

     87: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 3+J-K-4*free_35

     88: f27 -> f27 : E'=1, Q'=1+Q, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 4

     89: f27 -> f27 : E'=1, Q'=1+Q, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 4

     90: f27 -> f27 : E'=1, Q'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && K>=1+J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 4

     91: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

     92: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

     93: f27 -> f27 : E'=1, Q'=2, K'=1+J, L'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

     94: f27 -> f27 : E'=1, Q'=1+Q, K'=1, L'=2+J, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6-2*K

     95: f27 -> f27 : E'=1, Q'=1+Q, K'=1, L'=2+J, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6-2*K

     96: f27 -> f27 : E'=1, Q'=2, K'=1, L'=2+J, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6-2*K

     97: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

     98: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

     99: f27 -> f27 : E'=1, Q'=2, K'=1+J, L'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_55*B+free_61*B, S'=-B*free_62+B*free_58, T'=-free_56*C+free_59*C, U'=-free_57*C-free_60*C, V'=3+P-free_54, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

    100: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K

    101: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K

    102: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && 1-J==0 && K==1 && Q_1==1 ], cost: 5-K

    103: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 5+2*J-2*K

    104: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 5+2*J-2*K

    105: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 5+2*J-2*K

    106: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

    107: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

    108: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

    109: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K

    110: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K

    111: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K



Applied pruning (of leafs and parallel rules):

   Start location: f2

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

     50: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 && Q>=1+H ], cost: 2

     51: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K

     52: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q

     77: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 3+J-K-4*free_26

     81: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 3+J-K-4*free_26

     85: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 3+J-K-4*free_26

     86: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 3-K

     87: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 3+J-K-4*free_35

     91: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

     92: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

     93: f27 -> f27 : E'=1, Q'=2, K'=1+J, L'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

     94: f27 -> f27 : E'=1, Q'=1+Q, K'=1, L'=2+J, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6-2*K

     96: f27 -> f27 : E'=1, Q'=2, K'=1, L'=2+J, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6-2*K

    103: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 5+2*J-2*K

    106: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

    107: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

    108: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

    111: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K



Accelerating simple loops of location 3.

   Accelerating the following rules:

     91: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

     92: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

     93: f27 -> f27 : E'=1, Q'=2, K'=1+J, L'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

     94: f27 -> f27 : E'=1, Q'=1+Q, K'=1, L'=2+J, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6-2*K

     96: f27 -> f27 : E'=1, Q'=2, K'=1, L'=2+J, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6-2*K



   Found no metering function for rule 91.

   Found no metering function for rule 92.

   Accelerated rule 93 with metering function 1-Q, yielding the new rule 112.

   Accelerated rule 94 with metering function -J, yielding the new rule 113.

   Accelerated rule 96 with metering function 1-J-Q, yielding the new rule 114.

   Removing the simple loops: 93 94 96.



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

   Start location: f2

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

     50: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 && Q>=1+H ], cost: 2

     51: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K

     52: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q

     77: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 3+J-K-4*free_26

     81: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 3+J-K-4*free_26

     85: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 3+J-K-4*free_26

     86: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 3-K

     87: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 3+J-K-4*free_35

     91: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

     92: f27 -> f27 : E'=1, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+F, O'=G, Q_1'=1+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 6+2*J-2*K

    103: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 5+2*J-2*K

    106: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

    107: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

    108: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

    111: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K

    112: f27 -> f27 : E'=1, Q'=2, K'=1+J, L'=2, M'=1, N'=1+F, O'=G, Q_1'=1+Q_1-Q, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2+W-2*Q, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 && 1-Q>=1 ], cost: 4-4*Q

    113: f27 -> f27 : E'=1, Q'=-J+Q, K'=1, L'=2+J, M'=3+J+H-Q, N'=1+F, O'=G, Q_1'=-J+Q_1, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=-2*J+W, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 && -J>=1 ], cost: -4*J

    114: f27 -> f27 : E'=1, Q'=2, K'=1, L'=2+J, M'=1, N'=1+F, O'=G, Q_1'=1-J+Q_1-Q, R'=free_52*B+free_46*B, S'=-B*free_53+free_49*B, T'=-free_47*C+free_50*C, U'=-free_48*C-free_51*C, V'=3+P-free_45, W'=2-2*J+W-2*Q, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 && 1-J-Q>=1 ], cost: 4-4*J-4*Q



Chained accelerated rules (with incoming rules):

   Start location: f2

      3: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A ], cost: 1

      4: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 ], cost: 1

     50: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, [ A==1 && Q>=1+H ], cost: 2

     51: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+Q, K'=1+J, L'=2+2*J-2*K+L, [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K

     52: f2 -> f27 : A'=1, B'=free_4, C'=free, D'=free_2, E'=free_5, F'=free_3, G'=free_1, Q'=1+H, [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q

    115: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=1, F'=free_9, G'=free_7, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+free_9, O'=free_7, Q_1'=1+Q_1, R'=free_52*free_10+free_46*free_10, S'=free_49*free_10-free_53*free_10, T'=free_50*free_6-free_47*free_6, U'=-free_6*free_51-free_6*free_48, V'=3+P-free_45, W'=2+W, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

    116: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=1, F'=free_15, G'=free_13, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+free_15, O'=free_13, Q_1'=1+Q_1, R'=free_46*free_16+free_52*free_16, S'=free_49*free_16-free_53*free_16, T'=-free_12*free_47+free_50*free_12, U'=-free_12*free_48-free_12*free_51, V'=3+P-free_45, W'=2+W, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

    117: f2 -> f27 : B'=free_10, C'=free_6, D'=free_8, E'=1, F'=free_9, G'=free_7, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+free_9, O'=free_7, Q_1'=1+Q_1, R'=free_52*free_10+free_46*free_10, S'=free_49*free_10-free_53*free_10, T'=free_50*free_6-free_47*free_6, U'=-free_6*free_51-free_6*free_48, V'=3+P-free_45, W'=2+W, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

    118: f2 -> f27 : B'=free_16, C'=free_12, D'=free_14, E'=1, F'=free_15, G'=free_13, Q'=1+Q, K'=1+J, L'=2, M'=2+H-Q, N'=1+free_15, O'=free_13, Q_1'=1+Q_1, R'=free_46*free_16+free_52*free_16, S'=free_49*free_16-free_53*free_16, T'=-free_12*free_47+free_50*free_12, U'=-free_12*free_48-free_12*free_51, V'=3+P-free_45, W'=2+W, [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

     77: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 3+J-K-4*free_26

     81: f27 -> [12] : M'=2+H-Q, N'=1, O'=0, [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 3+J-K-4*free_26

     85: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 3+J-K-4*free_26

     86: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 3-K

     87: f27 -> [12] : Q'=1, M'=1, N'=1, O'=0, [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 3+J-K-4*free_35

    103: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 5+2*J-2*K

    106: f27 -> [14] : [ 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

    107: f27 -> [14] : [ Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

    108: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 5-2*K

    111: f27 -> [14] : [ H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 5+2*J-2*K



Eliminated locations (on tree-shaped paths):

   Start location: f2

    119: f2 -> [12] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, M'=2+H-Q, N'=1, O'=0, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 4+J-K-4*free_26

    120: f2 -> [12] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, M'=2+H-Q, N'=1, O'=0, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 4+J-K-4*free_26

    121: f2 -> [12] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, Q'=1, M'=1, N'=1, O'=0, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 4+J-K-4*free_26

    122: f2 -> [12] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, Q'=1, M'=1, N'=1, O'=0, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 4-K

    123: f2 -> [12] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, Q'=1, M'=1, N'=1, O'=0, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 4+J-K-4*free_35

    124: f2 -> [14] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 6+2*J-2*K

    125: f2 -> [14] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    126: f2 -> [14] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    127: f2 -> [14] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    128: f2 -> [14] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K

    129: f2 -> [12] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, M'=2+H-Q, N'=1, O'=0, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 4+J-K-4*free_26

    130: f2 -> [12] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, M'=2+H-Q, N'=1, O'=0, [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 4+J-K-4*free_26

    131: f2 -> [12] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, Q'=1, M'=1, N'=1, O'=0, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 4+J-K-4*free_26

    132: f2 -> [12] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, Q'=1, M'=1, N'=1, O'=0, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 4-K

    133: f2 -> [12] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, Q'=1, M'=1, N'=1, O'=0, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_35 && K+5*free_35>=1+J && K>=2 && Q_1==1 ], cost: 4+J-K-4*free_35

    134: f2 -> [14] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J ], cost: 6+2*J-2*K

    135: f2 -> [14] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    136: f2 -> [14] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    137: f2 -> [14] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    138: f2 -> [14] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_54 && 3*free_54>=1+Q_1 && K>=2 ], cost: 6+2*J-2*K

    139: f2 -> [16] : [ A==1 && H>=Q && J>=K && 1+Q>=1+H ], cost: 5+J-K

    140: f2 -> [16] : [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q

    141: f2 -> [16] : [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

    142: f2 -> [16] : [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

    143: f2 -> [16] : [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

    144: f2 -> [16] : [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K



Applied pruning (of leafs and parallel rules):

   Start location: f2

    121: f2 -> [12] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, Q'=1, M'=1, N'=1, O'=0, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 4+J-K-4*free_26

    122: f2 -> [12] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, Q'=1, M'=1, N'=1, O'=0, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 4-K

    125: f2 -> [14] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    126: f2 -> [14] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    127: f2 -> [14] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    129: f2 -> [12] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, M'=2+H-Q, N'=1, O'=0, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 4+J-K-4*free_26

    131: f2 -> [12] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, Q'=1, M'=1, N'=1, O'=0, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 4+J-K-4*free_26

    132: f2 -> [12] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, Q'=1, M'=1, N'=1, O'=0, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 4-K

    135: f2 -> [14] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    136: f2 -> [14] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    140: f2 -> [16] : [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q

    141: f2 -> [16] : [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

    142: f2 -> [16] : [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

    143: f2 -> [16] : [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

    144: f2 -> [16] : [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K



### Computing asymptotic complexity ###



Fully simplified ITS problem

   Start location: f2

    121: f2 -> [12] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, Q'=1, M'=1, N'=1, O'=0, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 4+J-K-4*free_26

    122: f2 -> [12] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, Q'=1, M'=1, N'=1, O'=0, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 4-K

    125: f2 -> [14] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    126: f2 -> [14] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    127: f2 -> [14] : B'=free_10, C'=free_6, D'=free_8, E'=free_11, F'=free_9, G'=free_7, [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    129: f2 -> [12] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, M'=2+H-Q, N'=1, O'=0, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 4+J-K-4*free_26

    131: f2 -> [12] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, Q'=1, M'=1, N'=1, O'=0, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J+free_26>=1+J && 0>=J-4*free_26 ], cost: 4+J-K-4*free_26

    132: f2 -> [12] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, Q'=1, M'=1, N'=1, O'=0, [ A>=2 && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && J>=4*free_26 && 5*free_26>=1+J ], cost: 4-K

    135: f2 -> [14] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    136: f2 -> [14] : B'=free_16, C'=free_12, D'=free_14, E'=free_17, F'=free_15, G'=free_13, [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && -J==0 ], cost: 6-2*K

    140: f2 -> [16] : [ A==1 && H>=Q && K>=1+J ], cost: 4+2*H-2*Q

    141: f2 -> [16] : [ 0>=A && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

    142: f2 -> [16] : [ A>=2 && 0>=Q && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

    143: f2 -> [16] : [ 0>=A && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K

    144: f2 -> [16] : [ A>=2 && Q>=2 && H>=Q && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && Q_1>=2 && J>=K && Q_1>=2*free_45 && 3*free_45>=1+Q_1 && 0>=K && 0>=J && P>=2*free_72 && 3*free_72>=1+P && 1+Q_1>=2+free_72 ], cost: 7+2*J-2*K



Computing asymptotic complexity for rule 121

   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,A==-n,H==n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==0}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==8*n,free_18==1,K==-n,free_26==2*n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,A==-n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==0}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,H==n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,A==-n,H==n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==0}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,A==-n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==0}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,H==n,free_26==n}

      resulting limit problem:

      [solved]



   Solution:

      P / 2

      J / 4*n

      free_18 / 1

      Q_1 / 1

      K / 1-n

      A / -n

      H / n

      free_26 / n

      Q / 1

   Resulting cost 3+n has complexity: Poly(n^1)



Found new complexity Poly(n^1).



Computing asymptotic complexity for rule 129

   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,A==n,H==0,free_26==n,Q==0}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==2}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {Q==0}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {H==Q}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+Q (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+Q (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+Q (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,free_26==n,Q==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {Q==0}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {H==Q}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+Q (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+Q (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+Q (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,A==n,free_26==n,Q==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==2}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {H==Q}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), 1-Q (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), 1-Q (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,free_26==n,Q==-n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {H==Q}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), 1-Q (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), 1-Q (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,A==n,free_26==n,Q==-n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==2}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {Q==0}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,H==n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {Q==0}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,A==n,H==n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==2}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,H==n,free_26==n,Q==0}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,A==n,H==0,free_26==n,Q==0}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==2}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {Q==0}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {H==Q}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+Q (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+Q (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,free_26==n,Q==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {Q==0}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {H==Q}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+Q (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+Q (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,A==n,free_26==n,Q==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==2}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {H==Q}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,free_26==n,Q==-n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {H==Q}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,A==n,free_26==n,Q==-n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==2}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {Q==0}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,H==n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {Q==0}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1+H (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,A==n,H==n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==2}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), 1+H-Q (+/+!), 1-Q (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,H==0,free_26==n,Q==0}

      resulting limit problem:

      [solved]



   Solution:

      P / 2

      J / 4*n

      free_18 / 1

      Q_1 / 1

      K / 1-n

      A / n

      H / 0

      free_26 / n

      Q / 0

   Resulting cost 3+n has complexity: Poly(n^1)



Computing asymptotic complexity for rule 131

   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,A==n,H==n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==2}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==8*n,free_18==1,K==-n,free_26==2*n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,A==n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==2}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,H==n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {P==2*free_18}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1-K (+/+!), free_18 (+/+!), 1+J-K-4*free_26 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {J==4*n,free_18==1,K==1-n,A==n,H==n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==2}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,A==n,free_26==n}

      resulting limit problem:

      [solved]



   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q (+/+!), 2-Q_1 (+/+!), Q (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 2+free_18-Q_1 (+/+!), 1-K (+/+!), Q_1 (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!), 2-Q_1 (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), -1+A (+/+!), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      applying transformation rule (C) using substitution {A==2}

      resulting limit problem:

      1 (+/+!), 1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



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

      resulting limit problem:

      1+free_18 (+/+!), 4+J-K-4*free_26 (+), 1+P-2*free_18 (+/+!), 1-K (+/+!), 1+J-K-4*free_26 (+/+!), -P+3*free_18 (+/+!), H (+/+!), -J+K+5*free_26 (+/+!), 1-J+4*free_26 (+/+!) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {P==2,J==4*n,free_18==1,K==1-n,H==n,free_26==n}

      resulting limit problem:

      [solved]



   Solution:

      P / 2

      J / 4*n

      free_18 / 1

      Q_1 / 1

      K / 1-n

      A / n

      H / n

      free_26 / n

      Q / 1

   Resulting cost 3+n has complexity: Poly(n^1)



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

   Complexity:  Poly(n^1)

   Cpx degree:  1

   Solved cost: 3+n

   Rule cost:   4+J-K-4*free_26

   Rule guard:  [ 0>=A && H>=1 && Q==1 && P>=2*free_18 && 3*free_18>=1+P && 1+free_18>=Q_1 && J>=K+4*free_26 && K+5*free_26>=1+J && 0>=K && Q_1==1 && 0>=J-4*free_26 ]



WORST_CASE(Omega(n^1),?)


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

(4)
BOUNDS(n^1, INF)