/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), ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.koat # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 14.1 s] (2) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f0(A, B + 1, C, D1, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && C >= D1 f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f0(A, B + 1, E1, D1, E1, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && D1 >= 1 + C f44(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f44(A, B + 1, C, D, E, 0, 0, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f44(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f44(A, B + 1, C, D, E, D1, E1, H + E1, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && 0 >= D1 + 1 f44(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f44(A, B + 1, C, D, E, D1, E1, H + E1, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && D1 >= 1 f54(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f57(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: 0 >= I + 1 && 200 >= J f54(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f57(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: I >= 1 && 200 >= J f57(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f59(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f59(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f59(A, B, C, D, E, F, G, H, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K f67(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f71(A, B, C, D, E, F, G, H, I, J, K, L, D1, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= L + 1 && 0 >= D1 + 1 f67(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f71(A, B, C, D, E, F, G, H, I, J, K, L, D1, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= L + 1 && D1 >= 1 f71(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f74(A, B, C, D, E, F, G, 0, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K f74(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f74(A, B + 1, C, D, E, F, G, D1, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f80(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f80(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f67(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f67(A, B, C, D, E, F, G, H, I, J, K, L + 1, 0, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= L + 1 f89(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f92(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f92(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f92(A, B, C, D, E, F, G, H, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= K + 1 f54(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f99(A, B, C, D, E, F, G, H, 0, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: 200 >= J && I >= 0 && I <= 0 f99(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f99(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f104(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f106(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f106(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f106(A, B, C, D, E, F, G, D1, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K f115(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f117(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f117(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f117(A, B, C, D, E, F, G, D1, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K f132(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f134(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f134(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f134(A, B, C, D, E, F, G, D1, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K f142(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f142(A, B + 1, C, D, E, 0, G, H, I, J, K, L, M, 0, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f142(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f142(A, B + 1, C, D, E, D1, G, H, I, J, K, L, M, E1, O + E1, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && 0 >= D1 + 1 f142(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f142(A, B + 1, C, D, E, D1, G, H, I, J, K, L, M, E1, O + E1, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && D1 >= 1 f151(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f151(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f156(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f156(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f161(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f163(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f163(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f163(A, B, C, D, E, F, G, D1, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K f171(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f173(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 f173(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f173(A, B, C, D, E, F, G, D1, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= K f181(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f181(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f188(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f190(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f190(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f190(A, B, C, D, E, F, G, D1, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= K f201(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f201(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, D1, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && C >= D1 f201(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f201(A, B + 1, D1, D, E, F, G, H, I, J, K, L, M, N, O, E1, D1, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B && E1 >= 1 + C f211(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f211(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: A >= B f218(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f228(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, D1, E1, E1, 1, E1, F1, X, Y, Z, A1, B1, C1)) :|: A >= B && E1 >= 2 f218(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f228(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, D1, E1, E1, 1, 1, F1, X, Y, Z, A1, B1, C1)) :|: A >= B && 1 >= E1 f228(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f218(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: C >= W f228(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f218(A, B + 1, W, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: W >= 1 + C f218(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f54(A, B, C, D, E, F, G, H, I, J + 1, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && C >= 0 f218(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f43(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && 0 >= C + 1 f211(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f54(A, B, C, D, E, F, G, H, I, J + 1, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f201(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f211(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, D1, Y, Z, A1, B1, C1)) :|: B >= 1 + A && 0 >= D1 + 1 f201(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f211(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, D1, Y, Z, A1, B1, C1)) :|: B >= 1 + A && D1 >= 1 f201(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f218(A, B, 0, D, E, F, G, H, 0, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, 0, Y, Z, A1, B1, C1)) :|: B >= 1 + A f190(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f188(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + A f188(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f201(A, B, 0, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f181(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f188(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, D1, Z, A1, B1, C1)) :|: B >= 1 + A f173(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f171(A, B - 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + B f171(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f181(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: 0 >= B f163(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f161(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + A f161(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f171(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f156(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f161(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f151(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f156(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f142(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f151(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f134(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f132(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + A f132(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f142(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f117(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f115(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, 0, D1, E1, F1)) :|: K >= 1 + A && D1 >= 0 f117(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f115(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, D1, E1, F1)) :|: K >= 1 + A && 0 >= D1 + 1 f115(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f161(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && 0 >= Z + 1 f115(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f161(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && Z >= 1 f115(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f132(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, 0, A1, B1, C1)) :|: B >= 1 + A && Z >= 0 && Z <= 0 f106(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f104(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + A f104(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f115(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, 1, A1, B1, C1)) :|: B >= 1 + A f99(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f104(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f92(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f89(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= B f89(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f161(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f80(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f71(A, B, C, D, E, F, G, H, I, J, K + 1, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f74(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f80(A, B, C, D, E, F, G, D1, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f71(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f67(A, B, C, D, E, F, G, H, I, J, K, L + 1, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + A f67(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f89(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: L >= A f59(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f57(A, B + 1, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: K >= 1 + A f57(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f67(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f54(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f43(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: J >= 201 f44(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f54(A, B, C, D, E, F, G, H, 1, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f43(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && 0 >= C f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f44(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: B >= 1 + A && C >= 1 start(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1) -> Com_1(f0(A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, A1, B1, C1)) :|: TRUE The start-symbols are:[start_29] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: start 0: f0 -> f0 : B'=1+B, D'=free, [ A>=B && C>=free ], cost: 1 1: f0 -> f0 : B'=1+B, C'=free_2, D'=free_1, E'=free_2, [ A>=B && free_1>=1+C ], cost: 1 80: f0 -> f43 : A1'=B, B'=C, B1'=D, C'=E, C1'=F, D'=G, D1'=H, E'=Q, E1'=J, F'=K, F1'=L, G'=M, H'=N, Q'=O, J'=P, K'=Q_1, L'=R, M'=S, N'=T, O'=U, P'=V, Q_1'=W, R'=X, S'=Y, T'=Z, U'=A1, V'=B1, W'=C1, [ B>=1+A && 0>=C ], cost: 1 81: f0 -> f44 : [ B>=1+A && C>=1 ], cost: 1 2: f44 -> f44 : B'=1+B, F'=0, G'=0, [ A>=B ], cost: 1 3: f44 -> f44 : B'=1+B, F'=free_4, G'=free_3, H'=free_3+H, [ A>=B && 0>=1+free_4 ], cost: 1 4: f44 -> f44 : B'=1+B, F'=free_6, G'=free_5, H'=H+free_5, [ A>=B && free_6>=1 ], cost: 1 79: f44 -> f54 : Q'=1, [ B>=1+A ], cost: 1 5: f54 -> f57 : [ 0>=1+Q && 200>=J ], cost: 1 6: f54 -> f57 : [ Q>=1 && 200>=J ], cost: 1 17: f54 -> f99 : Q'=0, [ 200>=J && Q==0 ], cost: 1 78: f54 -> f43 : A1'=B, B'=C, B1'=D, C'=E, C1'=F, D'=G, D1'=H, E'=Q, E1'=J, F'=K, F1'=L, G'=M, H'=N, Q'=O, J'=P, K'=Q_1, L'=R, M'=S, N'=T, O'=U, P'=V, Q_1'=W, R'=X, S'=Y, T'=Z, U'=A1, V'=B1, W'=C1, [ J>=201 ], cost: 1 7: f57 -> f59 : [ A>=B ], cost: 1 77: f57 -> f67 : [ B>=1+A ], cost: 1 8: f59 -> f59 : K'=1+K, [ A>=K ], cost: 1 76: f59 -> f57 : B'=1+B, [ K>=1+A ], cost: 1 9: f67 -> f71 : M'=free_7, [ A>=1+L && 0>=1+free_7 ], cost: 1 10: f67 -> f71 : M'=free_8, [ A>=1+L && free_8>=1 ], cost: 1 14: f67 -> f67 : L'=1+L, M'=0, [ A>=1+L ], cost: 1 75: f67 -> f89 : [ L>=A ], cost: 1 11: f71 -> f74 : H'=0, [ A>=K ], cost: 1 74: f71 -> f67 : L'=1+L, [ K>=1+A ], cost: 1 12: f74 -> f74 : B'=1+B, H'=free_9, [ A>=B ], cost: 1 73: f74 -> f80 : H'=free_38, [ B>=1+A ], cost: 1 13: f80 -> f80 : B'=1+B, [ A>=B ], cost: 1 72: f80 -> f71 : K'=1+K, [ B>=1+A ], cost: 1 15: f89 -> f92 : [ A>=B ], cost: 1 71: f89 -> f161 : [ B>=1+A ], cost: 1 16: f92 -> f92 : K'=1+K, [ B>=1+K ], cost: 1 70: f92 -> f89 : B'=1+B, [ K>=B ], cost: 1 18: f99 -> f99 : B'=1+B, [ A>=B ], cost: 1 69: f99 -> f104 : [ B>=1+A ], cost: 1 19: f104 -> f106 : [ A>=B ], cost: 1 68: f104 -> f115 : Z'=1, [ B>=1+A ], cost: 1 20: f106 -> f106 : H'=free_10, K'=1+K, [ A>=K ], cost: 1 67: f106 -> f104 : B'=1+B, [ K>=1+A ], cost: 1 21: f115 -> f117 : [ A>=B ], cost: 1 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 66: f115 -> f132 : Z'=0, [ B>=1+A && Z==0 ], cost: 1 22: f117 -> f117 : H'=free_11, K'=1+K, [ A>=K ], cost: 1 62: f117 -> f115 : A1'=free_33, B'=1+B, B1'=free_32, C1'=free_34, Z'=0, [ K>=1+A && free_33>=0 ], cost: 1 63: f117 -> f115 : A1'=free_36, B'=1+B, B1'=free_35, C1'=free_37, [ K>=1+A && 0>=1+free_36 ], cost: 1 23: f132 -> f134 : [ A>=B ], cost: 1 61: f132 -> f142 : [ B>=1+A ], cost: 1 24: f134 -> f134 : H'=free_12, K'=1+K, [ A>=K ], cost: 1 60: f134 -> f132 : B'=1+B, [ K>=1+A ], cost: 1 25: f142 -> f142 : B'=1+B, F'=0, N'=0, [ A>=B ], cost: 1 26: f142 -> f142 : B'=1+B, F'=free_14, N'=free_13, O'=free_13+O, [ A>=B && 0>=1+free_14 ], cost: 1 27: f142 -> f142 : B'=1+B, F'=free_16, N'=free_15, O'=free_15+O, [ A>=B && free_16>=1 ], cost: 1 59: f142 -> f151 : [ B>=1+A ], cost: 1 28: f151 -> f151 : B'=1+B, [ A>=B ], cost: 1 58: f151 -> f156 : [ B>=1+A ], cost: 1 29: f156 -> f156 : B'=1+B, [ A>=B ], cost: 1 57: f156 -> f161 : [ B>=1+A ], cost: 1 30: f161 -> f163 : [ A>=B ], cost: 1 56: f161 -> f171 : [ B>=1+A ], cost: 1 31: f163 -> f163 : H'=free_17, K'=1+K, [ A>=K ], cost: 1 55: f163 -> f161 : B'=1+B, [ K>=1+A ], cost: 1 32: f171 -> f173 : [ B>=1 ], cost: 1 54: f171 -> f181 : [ 0>=B ], cost: 1 33: f173 -> f173 : H'=free_18, K'=1+K, [ B>=K ], cost: 1 53: f173 -> f171 : B'=-1+B, [ K>=1+B ], cost: 1 34: f181 -> f181 : B'=1+B, [ A>=B ], cost: 1 52: f181 -> f188 : Y'=free_31, [ B>=1+A ], cost: 1 35: f188 -> f190 : [ A>=B ], cost: 1 51: f188 -> f201 : C'=0, [ B>=1+A ], cost: 1 36: f190 -> f190 : H'=free_19, K'=1+K, [ A>=K ], cost: 1 50: f190 -> f188 : B'=1+B, [ K>=1+A ], cost: 1 37: f201 -> f201 : B'=1+B, P'=free_20, [ A>=B && C>=free_20 ], cost: 1 38: f201 -> f201 : B'=1+B, C'=free_22, P'=free_21, Q_1'=free_22, [ A>=B && free_21>=1+C ], cost: 1 47: f201 -> f211 : X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 1 48: f201 -> f211 : X'=free_30, [ B>=1+A && free_30>=1 ], cost: 1 49: f201 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 1 39: f211 -> f211 : B'=1+B, [ A>=B ], cost: 1 46: f211 -> f54 : J'=1+J, [ B>=1+A ], cost: 1 40: f218 -> f228 : R'=free_24, S'=free_23, T'=free_23, U'=1, V'=free_23, W'=free_25, [ A>=B && free_23>=2 ], cost: 1 41: f218 -> f228 : R'=free_27, S'=free_26, T'=free_26, U'=1, V'=1, W'=free_28, [ A>=B && 1>=free_26 ], cost: 1 44: f218 -> f54 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1 45: f218 -> f43 : A1'=B, B'=C, B1'=D, C'=E, C1'=F, D'=G, D1'=H, E'=Q, E1'=J, F'=K, F1'=L, G'=M, H'=N, Q'=O, J'=P, K'=Q_1, L'=R, M'=S, N'=T, O'=U, P'=V, Q_1'=W, R'=X, S'=Y, T'=Z, U'=A1, V'=B1, W'=C1, [ B>=1+A && 0>=1+C ], cost: 1 42: f228 -> f218 : B'=1+B, [ C>=W ], cost: 1 43: f228 -> f218 : B'=1+B, C'=W, [ W>=1+C ], cost: 1 82: start -> f0 : [], cost: 1 Checking for constant complexity: The following rule is satisfiable with cost >= 1, yielding constant complexity: 82: start -> f0 : [], cost: 1 Removed unreachable and leaf rules: Start location: start 0: f0 -> f0 : B'=1+B, D'=free, [ A>=B && C>=free ], cost: 1 1: f0 -> f0 : B'=1+B, C'=free_2, D'=free_1, E'=free_2, [ A>=B && free_1>=1+C ], cost: 1 81: f0 -> f44 : [ B>=1+A && C>=1 ], cost: 1 2: f44 -> f44 : B'=1+B, F'=0, G'=0, [ A>=B ], cost: 1 3: f44 -> f44 : B'=1+B, F'=free_4, G'=free_3, H'=free_3+H, [ A>=B && 0>=1+free_4 ], cost: 1 4: f44 -> f44 : B'=1+B, F'=free_6, G'=free_5, H'=H+free_5, [ A>=B && free_6>=1 ], cost: 1 79: f44 -> f54 : Q'=1, [ B>=1+A ], cost: 1 5: f54 -> f57 : [ 0>=1+Q && 200>=J ], cost: 1 6: f54 -> f57 : [ Q>=1 && 200>=J ], cost: 1 17: f54 -> f99 : Q'=0, [ 200>=J && Q==0 ], cost: 1 7: f57 -> f59 : [ A>=B ], cost: 1 77: f57 -> f67 : [ B>=1+A ], cost: 1 8: f59 -> f59 : K'=1+K, [ A>=K ], cost: 1 76: f59 -> f57 : B'=1+B, [ K>=1+A ], cost: 1 9: f67 -> f71 : M'=free_7, [ A>=1+L && 0>=1+free_7 ], cost: 1 10: f67 -> f71 : M'=free_8, [ A>=1+L && free_8>=1 ], cost: 1 14: f67 -> f67 : L'=1+L, M'=0, [ A>=1+L ], cost: 1 75: f67 -> f89 : [ L>=A ], cost: 1 11: f71 -> f74 : H'=0, [ A>=K ], cost: 1 74: f71 -> f67 : L'=1+L, [ K>=1+A ], cost: 1 12: f74 -> f74 : B'=1+B, H'=free_9, [ A>=B ], cost: 1 73: f74 -> f80 : H'=free_38, [ B>=1+A ], cost: 1 13: f80 -> f80 : B'=1+B, [ A>=B ], cost: 1 72: f80 -> f71 : K'=1+K, [ B>=1+A ], cost: 1 15: f89 -> f92 : [ A>=B ], cost: 1 71: f89 -> f161 : [ B>=1+A ], cost: 1 16: f92 -> f92 : K'=1+K, [ B>=1+K ], cost: 1 70: f92 -> f89 : B'=1+B, [ K>=B ], cost: 1 18: f99 -> f99 : B'=1+B, [ A>=B ], cost: 1 69: f99 -> f104 : [ B>=1+A ], cost: 1 19: f104 -> f106 : [ A>=B ], cost: 1 68: f104 -> f115 : Z'=1, [ B>=1+A ], cost: 1 20: f106 -> f106 : H'=free_10, K'=1+K, [ A>=K ], cost: 1 67: f106 -> f104 : B'=1+B, [ K>=1+A ], cost: 1 21: f115 -> f117 : [ A>=B ], cost: 1 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 66: f115 -> f132 : Z'=0, [ B>=1+A && Z==0 ], cost: 1 22: f117 -> f117 : H'=free_11, K'=1+K, [ A>=K ], cost: 1 62: f117 -> f115 : A1'=free_33, B'=1+B, B1'=free_32, C1'=free_34, Z'=0, [ K>=1+A && free_33>=0 ], cost: 1 63: f117 -> f115 : A1'=free_36, B'=1+B, B1'=free_35, C1'=free_37, [ K>=1+A && 0>=1+free_36 ], cost: 1 23: f132 -> f134 : [ A>=B ], cost: 1 61: f132 -> f142 : [ B>=1+A ], cost: 1 24: f134 -> f134 : H'=free_12, K'=1+K, [ A>=K ], cost: 1 60: f134 -> f132 : B'=1+B, [ K>=1+A ], cost: 1 25: f142 -> f142 : B'=1+B, F'=0, N'=0, [ A>=B ], cost: 1 26: f142 -> f142 : B'=1+B, F'=free_14, N'=free_13, O'=free_13+O, [ A>=B && 0>=1+free_14 ], cost: 1 27: f142 -> f142 : B'=1+B, F'=free_16, N'=free_15, O'=free_15+O, [ A>=B && free_16>=1 ], cost: 1 59: f142 -> f151 : [ B>=1+A ], cost: 1 28: f151 -> f151 : B'=1+B, [ A>=B ], cost: 1 58: f151 -> f156 : [ B>=1+A ], cost: 1 29: f156 -> f156 : B'=1+B, [ A>=B ], cost: 1 57: f156 -> f161 : [ B>=1+A ], cost: 1 30: f161 -> f163 : [ A>=B ], cost: 1 56: f161 -> f171 : [ B>=1+A ], cost: 1 31: f163 -> f163 : H'=free_17, K'=1+K, [ A>=K ], cost: 1 55: f163 -> f161 : B'=1+B, [ K>=1+A ], cost: 1 32: f171 -> f173 : [ B>=1 ], cost: 1 54: f171 -> f181 : [ 0>=B ], cost: 1 33: f173 -> f173 : H'=free_18, K'=1+K, [ B>=K ], cost: 1 53: f173 -> f171 : B'=-1+B, [ K>=1+B ], cost: 1 34: f181 -> f181 : B'=1+B, [ A>=B ], cost: 1 52: f181 -> f188 : Y'=free_31, [ B>=1+A ], cost: 1 35: f188 -> f190 : [ A>=B ], cost: 1 51: f188 -> f201 : C'=0, [ B>=1+A ], cost: 1 36: f190 -> f190 : H'=free_19, K'=1+K, [ A>=K ], cost: 1 50: f190 -> f188 : B'=1+B, [ K>=1+A ], cost: 1 37: f201 -> f201 : B'=1+B, P'=free_20, [ A>=B && C>=free_20 ], cost: 1 38: f201 -> f201 : B'=1+B, C'=free_22, P'=free_21, Q_1'=free_22, [ A>=B && free_21>=1+C ], cost: 1 47: f201 -> f211 : X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 1 48: f201 -> f211 : X'=free_30, [ B>=1+A && free_30>=1 ], cost: 1 49: f201 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 1 39: f211 -> f211 : B'=1+B, [ A>=B ], cost: 1 46: f211 -> f54 : J'=1+J, [ B>=1+A ], cost: 1 40: f218 -> f228 : R'=free_24, S'=free_23, T'=free_23, U'=1, V'=free_23, W'=free_25, [ A>=B && free_23>=2 ], cost: 1 41: f218 -> f228 : R'=free_27, S'=free_26, T'=free_26, U'=1, V'=1, W'=free_28, [ A>=B && 1>=free_26 ], cost: 1 44: f218 -> f54 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1 42: f228 -> f218 : B'=1+B, [ C>=W ], cost: 1 43: f228 -> f218 : B'=1+B, C'=W, [ W>=1+C ], cost: 1 82: start -> f0 : [], cost: 1 ### Simplification by acceleration and chaining ### Accelerating simple loops of location 0. Accelerating the following rules: 0: f0 -> f0 : B'=1+B, D'=free, [ A>=B && C>=free ], cost: 1 1: f0 -> f0 : B'=1+B, C'=free_2, D'=free_1, E'=free_2, [ A>=B && free_1>=1+C ], cost: 1 Accelerated rule 0 with metering function 1-B+A, yielding the new rule 83. During metering: Instantiating temporary variables by {free_1==1+C} Accelerated rule 1 with metering function 1-B+A, yielding the new rule 84. Removing the simple loops: 0 1. Accelerating simple loops of location 1. Accelerating the following rules: 2: f44 -> f44 : B'=1+B, F'=0, G'=0, [ A>=B ], cost: 1 3: f44 -> f44 : B'=1+B, F'=free_4, G'=free_3, H'=free_3+H, [ A>=B && 0>=1+free_4 ], cost: 1 4: f44 -> f44 : B'=1+B, F'=free_6, G'=free_5, H'=H+free_5, [ A>=B && free_6>=1 ], cost: 1 Accelerated rule 2 with metering function 1-B+A, yielding the new rule 85. Accelerated rule 3 with metering function 1-B+A, yielding the new rule 86. Accelerated rule 4 with metering function 1-B+A, yielding the new rule 87. Removing the simple loops: 2 3 4. Accelerating simple loops of location 4. Accelerating the following rules: 8: f59 -> f59 : K'=1+K, [ A>=K ], cost: 1 Accelerated rule 8 with metering function 1-K+A, yielding the new rule 88. Removing the simple loops: 8. Accelerating simple loops of location 5. Accelerating the following rules: 14: f67 -> f67 : L'=1+L, M'=0, [ A>=1+L ], cost: 1 Accelerated rule 14 with metering function A-L, yielding the new rule 89. Removing the simple loops: 14. Accelerating simple loops of location 7. Accelerating the following rules: 12: f74 -> f74 : B'=1+B, H'=free_9, [ A>=B ], cost: 1 Accelerated rule 12 with metering function 1-B+A, yielding the new rule 90. Removing the simple loops: 12. Accelerating simple loops of location 8. Accelerating the following rules: 13: f80 -> f80 : B'=1+B, [ A>=B ], cost: 1 Accelerated rule 13 with metering function 1-B+A, yielding the new rule 91. Removing the simple loops: 13. Accelerating simple loops of location 10. Accelerating the following rules: 16: f92 -> f92 : K'=1+K, [ B>=1+K ], cost: 1 Accelerated rule 16 with metering function B-K, yielding the new rule 92. Removing the simple loops: 16. Accelerating simple loops of location 11. Accelerating the following rules: 18: f99 -> f99 : B'=1+B, [ A>=B ], cost: 1 Accelerated rule 18 with metering function 1-B+A, yielding the new rule 93. Removing the simple loops: 18. Accelerating simple loops of location 13. Accelerating the following rules: 20: f106 -> f106 : H'=free_10, K'=1+K, [ A>=K ], cost: 1 Accelerated rule 20 with metering function 1-K+A, yielding the new rule 94. Removing the simple loops: 20. Accelerating simple loops of location 15. Accelerating the following rules: 22: f117 -> f117 : H'=free_11, K'=1+K, [ A>=K ], cost: 1 Accelerated rule 22 with metering function 1-K+A, yielding the new rule 95. Removing the simple loops: 22. Accelerating simple loops of location 17. Accelerating the following rules: 24: f134 -> f134 : H'=free_12, K'=1+K, [ A>=K ], cost: 1 Accelerated rule 24 with metering function 1-K+A, yielding the new rule 96. Removing the simple loops: 24. Accelerating simple loops of location 18. Accelerating the following rules: 25: f142 -> f142 : B'=1+B, F'=0, N'=0, [ A>=B ], cost: 1 26: f142 -> f142 : B'=1+B, F'=free_14, N'=free_13, O'=free_13+O, [ A>=B && 0>=1+free_14 ], cost: 1 27: f142 -> f142 : B'=1+B, F'=free_16, N'=free_15, O'=free_15+O, [ A>=B && free_16>=1 ], cost: 1 Accelerated rule 25 with metering function 1-B+A, yielding the new rule 97. Accelerated rule 26 with metering function 1-B+A, yielding the new rule 98. Accelerated rule 27 with metering function 1-B+A, yielding the new rule 99. Removing the simple loops: 25 26 27. Accelerating simple loops of location 19. Accelerating the following rules: 28: f151 -> f151 : B'=1+B, [ A>=B ], cost: 1 Accelerated rule 28 with metering function 1-B+A, yielding the new rule 100. Removing the simple loops: 28. Accelerating simple loops of location 20. Accelerating the following rules: 29: f156 -> f156 : B'=1+B, [ A>=B ], cost: 1 Accelerated rule 29 with metering function 1-B+A, yielding the new rule 101. Removing the simple loops: 29. Accelerating simple loops of location 22. Accelerating the following rules: 31: f163 -> f163 : H'=free_17, K'=1+K, [ A>=K ], cost: 1 Accelerated rule 31 with metering function 1-K+A, yielding the new rule 102. Removing the simple loops: 31. Accelerating simple loops of location 24. Accelerating the following rules: 33: f173 -> f173 : H'=free_18, K'=1+K, [ B>=K ], cost: 1 Accelerated rule 33 with metering function 1+B-K, yielding the new rule 103. Removing the simple loops: 33. Accelerating simple loops of location 25. Accelerating the following rules: 34: f181 -> f181 : B'=1+B, [ A>=B ], cost: 1 Accelerated rule 34 with metering function 1-B+A, yielding the new rule 104. Removing the simple loops: 34. Accelerating simple loops of location 27. Accelerating the following rules: 36: f190 -> f190 : H'=free_19, K'=1+K, [ A>=K ], cost: 1 Accelerated rule 36 with metering function 1-K+A, yielding the new rule 105. Removing the simple loops: 36. Accelerating simple loops of location 28. Accelerating the following rules: 37: f201 -> f201 : B'=1+B, P'=free_20, [ A>=B && C>=free_20 ], cost: 1 38: f201 -> f201 : B'=1+B, C'=free_22, P'=free_21, Q_1'=free_22, [ A>=B && free_21>=1+C ], cost: 1 Accelerated rule 37 with metering function 1-B+A, yielding the new rule 106. During metering: Instantiating temporary variables by {free_21==1+C} Accelerated rule 38 with metering function 1-B+A, yielding the new rule 107. Removing the simple loops: 37 38. Accelerating simple loops of location 29. Accelerating the following rules: 39: f211 -> f211 : B'=1+B, [ A>=B ], cost: 1 Accelerated rule 39 with metering function 1-B+A, yielding the new rule 108. Removing the simple loops: 39. Accelerated all simple loops using metering functions (where possible): Start location: start 81: f0 -> f44 : [ B>=1+A && C>=1 ], cost: 1 83: f0 -> f0 : B'=1+A, D'=free, [ A>=B && C>=free ], cost: 1-B+A 84: f0 -> f0 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, [ A>=B ], cost: 1-B+A 79: f44 -> f54 : Q'=1, [ B>=1+A ], cost: 1 85: f44 -> f44 : B'=1+A, F'=0, G'=0, [ A>=B ], cost: 1-B+A 86: f44 -> f44 : B'=1+A, F'=free_4, G'=free_3, H'=-free_3*(-1+B-A)+H, [ A>=B && 0>=1+free_4 ], cost: 1-B+A 87: f44 -> f44 : B'=1+A, F'=free_6, G'=free_5, H'=-(-1+B-A)*free_5+H, [ A>=B && free_6>=1 ], cost: 1-B+A 5: f54 -> f57 : [ 0>=1+Q && 200>=J ], cost: 1 6: f54 -> f57 : [ Q>=1 && 200>=J ], cost: 1 17: f54 -> f99 : Q'=0, [ 200>=J && Q==0 ], cost: 1 7: f57 -> f59 : [ A>=B ], cost: 1 77: f57 -> f67 : [ B>=1+A ], cost: 1 76: f59 -> f57 : B'=1+B, [ K>=1+A ], cost: 1 88: f59 -> f59 : K'=1+A, [ A>=K ], cost: 1-K+A 9: f67 -> f71 : M'=free_7, [ A>=1+L && 0>=1+free_7 ], cost: 1 10: f67 -> f71 : M'=free_8, [ A>=1+L && free_8>=1 ], cost: 1 75: f67 -> f89 : [ L>=A ], cost: 1 89: f67 -> f67 : L'=A, M'=0, [ A>=1+L ], cost: A-L 11: f71 -> f74 : H'=0, [ A>=K ], cost: 1 74: f71 -> f67 : L'=1+L, [ K>=1+A ], cost: 1 73: f74 -> f80 : H'=free_38, [ B>=1+A ], cost: 1 90: f74 -> f74 : B'=1+A, H'=free_9, [ A>=B ], cost: 1-B+A 72: f80 -> f71 : K'=1+K, [ B>=1+A ], cost: 1 91: f80 -> f80 : B'=1+A, [ A>=B ], cost: 1-B+A 15: f89 -> f92 : [ A>=B ], cost: 1 71: f89 -> f161 : [ B>=1+A ], cost: 1 70: f92 -> f89 : B'=1+B, [ K>=B ], cost: 1 92: f92 -> f92 : K'=B, [ B>=1+K ], cost: B-K 69: f99 -> f104 : [ B>=1+A ], cost: 1 93: f99 -> f99 : B'=1+A, [ A>=B ], cost: 1-B+A 19: f104 -> f106 : [ A>=B ], cost: 1 68: f104 -> f115 : Z'=1, [ B>=1+A ], cost: 1 67: f106 -> f104 : B'=1+B, [ K>=1+A ], cost: 1 94: f106 -> f106 : H'=free_10, K'=1+A, [ A>=K ], cost: 1-K+A 21: f115 -> f117 : [ A>=B ], cost: 1 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 66: f115 -> f132 : Z'=0, [ B>=1+A && Z==0 ], cost: 1 62: f117 -> f115 : A1'=free_33, B'=1+B, B1'=free_32, C1'=free_34, Z'=0, [ K>=1+A && free_33>=0 ], cost: 1 63: f117 -> f115 : A1'=free_36, B'=1+B, B1'=free_35, C1'=free_37, [ K>=1+A && 0>=1+free_36 ], cost: 1 95: f117 -> f117 : H'=free_11, K'=1+A, [ A>=K ], cost: 1-K+A 23: f132 -> f134 : [ A>=B ], cost: 1 61: f132 -> f142 : [ B>=1+A ], cost: 1 60: f134 -> f132 : B'=1+B, [ K>=1+A ], cost: 1 96: f134 -> f134 : H'=free_12, K'=1+A, [ A>=K ], cost: 1-K+A 59: f142 -> f151 : [ B>=1+A ], cost: 1 97: f142 -> f142 : B'=1+A, F'=0, N'=0, [ A>=B ], cost: 1-B+A 98: f142 -> f142 : B'=1+A, F'=free_14, N'=free_13, O'=-free_13*(-1+B-A)+O, [ A>=B && 0>=1+free_14 ], cost: 1-B+A 99: f142 -> f142 : B'=1+A, F'=free_16, N'=free_15, O'=-free_15*(-1+B-A)+O, [ A>=B && free_16>=1 ], cost: 1-B+A 58: f151 -> f156 : [ B>=1+A ], cost: 1 100: f151 -> f151 : B'=1+A, [ A>=B ], cost: 1-B+A 57: f156 -> f161 : [ B>=1+A ], cost: 1 101: f156 -> f156 : B'=1+A, [ A>=B ], cost: 1-B+A 30: f161 -> f163 : [ A>=B ], cost: 1 56: f161 -> f171 : [ B>=1+A ], cost: 1 55: f163 -> f161 : B'=1+B, [ K>=1+A ], cost: 1 102: f163 -> f163 : H'=free_17, K'=1+A, [ A>=K ], cost: 1-K+A 32: f171 -> f173 : [ B>=1 ], cost: 1 54: f171 -> f181 : [ 0>=B ], cost: 1 53: f173 -> f171 : B'=-1+B, [ K>=1+B ], cost: 1 103: f173 -> f173 : H'=free_18, K'=1+B, [ B>=K ], cost: 1+B-K 52: f181 -> f188 : Y'=free_31, [ B>=1+A ], cost: 1 104: f181 -> f181 : B'=1+A, [ A>=B ], cost: 1-B+A 35: f188 -> f190 : [ A>=B ], cost: 1 51: f188 -> f201 : C'=0, [ B>=1+A ], cost: 1 50: f190 -> f188 : B'=1+B, [ K>=1+A ], cost: 1 105: f190 -> f190 : H'=free_19, K'=1+A, [ A>=K ], cost: 1-K+A 47: f201 -> f211 : X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 1 48: f201 -> f211 : X'=free_30, [ B>=1+A && free_30>=1 ], cost: 1 49: f201 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 1 106: f201 -> f201 : B'=1+A, P'=free_20, [ A>=B && C>=free_20 ], cost: 1-B+A 107: f201 -> f201 : B'=1+A, C'=free_22, P'=1+free_22, Q_1'=free_22, [ A>=B ], cost: 1-B+A 46: f211 -> f54 : J'=1+J, [ B>=1+A ], cost: 1 108: f211 -> f211 : B'=1+A, [ A>=B ], cost: 1-B+A 40: f218 -> f228 : R'=free_24, S'=free_23, T'=free_23, U'=1, V'=free_23, W'=free_25, [ A>=B && free_23>=2 ], cost: 1 41: f218 -> f228 : R'=free_27, S'=free_26, T'=free_26, U'=1, V'=1, W'=free_28, [ A>=B && 1>=free_26 ], cost: 1 44: f218 -> f54 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1 42: f228 -> f218 : B'=1+B, [ C>=W ], cost: 1 43: f228 -> f218 : B'=1+B, C'=W, [ W>=1+C ], cost: 1 82: start -> f0 : [], cost: 1 Chained accelerated rules (with incoming rules): Start location: start 81: f0 -> f44 : [ B>=1+A && C>=1 ], cost: 1 79: f44 -> f54 : Q'=1, [ B>=1+A ], cost: 1 5: f54 -> f57 : [ 0>=1+Q && 200>=J ], cost: 1 6: f54 -> f57 : [ Q>=1 && 200>=J ], cost: 1 17: f54 -> f99 : Q'=0, [ 200>=J && Q==0 ], cost: 1 116: f54 -> f99 : B'=1+A, Q'=0, [ 200>=J && Q==0 && A>=B ], cost: 2-B+A 7: f57 -> f59 : [ A>=B ], cost: 1 77: f57 -> f67 : [ B>=1+A ], cost: 1 111: f57 -> f59 : K'=1+A, [ A>=B && A>=K ], cost: 2-K+A 113: f57 -> f67 : L'=A, M'=0, [ B>=1+A && A>=1+L ], cost: 1+A-L 76: f59 -> f57 : B'=1+B, [ K>=1+A ], cost: 1 9: f67 -> f71 : M'=free_7, [ A>=1+L && 0>=1+free_7 ], cost: 1 10: f67 -> f71 : M'=free_8, [ A>=1+L && free_8>=1 ], cost: 1 75: f67 -> f89 : [ L>=A ], cost: 1 11: f71 -> f74 : H'=0, [ A>=K ], cost: 1 74: f71 -> f67 : L'=1+L, [ K>=1+A ], cost: 1 112: f71 -> f67 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: A-L 114: f71 -> f74 : B'=1+A, H'=free_9, [ A>=K && A>=B ], cost: 2-B+A 73: f74 -> f80 : H'=free_38, [ B>=1+A ], cost: 1 72: f80 -> f71 : K'=1+K, [ B>=1+A ], cost: 1 15: f89 -> f92 : [ A>=B ], cost: 1 71: f89 -> f161 : [ B>=1+A ], cost: 1 115: f89 -> f92 : K'=B, [ A>=B && B>=1+K ], cost: 1+B-K 70: f92 -> f89 : B'=1+B, [ K>=B ], cost: 1 69: f99 -> f104 : [ B>=1+A ], cost: 1 19: f104 -> f106 : [ A>=B ], cost: 1 68: f104 -> f115 : Z'=1, [ B>=1+A ], cost: 1 117: f104 -> f106 : H'=free_10, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A 67: f106 -> f104 : B'=1+B, [ K>=1+A ], cost: 1 21: f115 -> f117 : [ A>=B ], cost: 1 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 66: f115 -> f132 : Z'=0, [ B>=1+A && Z==0 ], cost: 1 118: f115 -> f117 : H'=free_11, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A 62: f117 -> f115 : A1'=free_33, B'=1+B, B1'=free_32, C1'=free_34, Z'=0, [ K>=1+A && free_33>=0 ], cost: 1 63: f117 -> f115 : A1'=free_36, B'=1+B, B1'=free_35, C1'=free_37, [ K>=1+A && 0>=1+free_36 ], cost: 1 23: f132 -> f134 : [ A>=B ], cost: 1 61: f132 -> f142 : [ B>=1+A ], cost: 1 119: f132 -> f134 : H'=free_12, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A 60: f134 -> f132 : B'=1+B, [ K>=1+A ], cost: 1 59: f142 -> f151 : [ B>=1+A ], cost: 1 58: f151 -> f156 : [ B>=1+A ], cost: 1 57: f156 -> f161 : [ B>=1+A ], cost: 1 30: f161 -> f163 : [ A>=B ], cost: 1 56: f161 -> f171 : [ B>=1+A ], cost: 1 120: f161 -> f163 : H'=free_17, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A 55: f163 -> f161 : B'=1+B, [ K>=1+A ], cost: 1 32: f171 -> f173 : [ B>=1 ], cost: 1 54: f171 -> f181 : [ 0>=B ], cost: 1 121: f171 -> f173 : H'=free_18, K'=1+B, [ B>=1 && B>=K ], cost: 2+B-K 122: f171 -> f181 : B'=1+A, [ 0>=B && A>=B ], cost: 2-B+A 53: f173 -> f171 : B'=-1+B, [ K>=1+B ], cost: 1 52: f181 -> f188 : Y'=free_31, [ B>=1+A ], cost: 1 35: f188 -> f190 : [ A>=B ], cost: 1 51: f188 -> f201 : C'=0, [ B>=1+A ], cost: 1 123: f188 -> f190 : H'=free_19, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A 50: f190 -> f188 : B'=1+B, [ K>=1+A ], cost: 1 47: f201 -> f211 : X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 1 48: f201 -> f211 : X'=free_30, [ B>=1+A && free_30>=1 ], cost: 1 49: f201 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 1 46: f211 -> f54 : J'=1+J, [ B>=1+A ], cost: 1 40: f218 -> f228 : R'=free_24, S'=free_23, T'=free_23, U'=1, V'=free_23, W'=free_25, [ A>=B && free_23>=2 ], cost: 1 41: f218 -> f228 : R'=free_27, S'=free_26, T'=free_26, U'=1, V'=1, W'=free_28, [ A>=B && 1>=free_26 ], cost: 1 44: f218 -> f54 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1 42: f228 -> f218 : B'=1+B, [ C>=W ], cost: 1 43: f228 -> f218 : B'=1+B, C'=W, [ W>=1+C ], cost: 1 82: start -> f0 : [], cost: 1 109: start -> f0 : B'=1+A, D'=free, [ A>=B && C>=free ], cost: 2-B+A 110: start -> f0 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, [ A>=B ], cost: 2-B+A Eliminated locations (on linear paths): Start location: start 124: f0 -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 2 5: f54 -> f57 : [ 0>=1+Q && 200>=J ], cost: 1 6: f54 -> f57 : [ Q>=1 && 200>=J ], cost: 1 17: f54 -> f99 : Q'=0, [ 200>=J && Q==0 ], cost: 1 116: f54 -> f99 : B'=1+A, Q'=0, [ 200>=J && Q==0 && A>=B ], cost: 2-B+A 7: f57 -> f59 : [ A>=B ], cost: 1 77: f57 -> f67 : [ B>=1+A ], cost: 1 111: f57 -> f59 : K'=1+A, [ A>=B && A>=K ], cost: 2-K+A 113: f57 -> f67 : L'=A, M'=0, [ B>=1+A && A>=1+L ], cost: 1+A-L 76: f59 -> f57 : B'=1+B, [ K>=1+A ], cost: 1 9: f67 -> f71 : M'=free_7, [ A>=1+L && 0>=1+free_7 ], cost: 1 10: f67 -> f71 : M'=free_8, [ A>=1+L && free_8>=1 ], cost: 1 75: f67 -> f89 : [ L>=A ], cost: 1 11: f71 -> f74 : H'=0, [ A>=K ], cost: 1 74: f71 -> f67 : L'=1+L, [ K>=1+A ], cost: 1 112: f71 -> f67 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: A-L 114: f71 -> f74 : B'=1+A, H'=free_9, [ A>=K && A>=B ], cost: 2-B+A 125: f74 -> f71 : H'=free_38, K'=1+K, [ B>=1+A ], cost: 2 15: f89 -> f92 : [ A>=B ], cost: 1 71: f89 -> f161 : [ B>=1+A ], cost: 1 115: f89 -> f92 : K'=B, [ A>=B && B>=1+K ], cost: 1+B-K 70: f92 -> f89 : B'=1+B, [ K>=B ], cost: 1 69: f99 -> f104 : [ B>=1+A ], cost: 1 19: f104 -> f106 : [ A>=B ], cost: 1 68: f104 -> f115 : Z'=1, [ B>=1+A ], cost: 1 117: f104 -> f106 : H'=free_10, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A 67: f106 -> f104 : B'=1+B, [ K>=1+A ], cost: 1 21: f115 -> f117 : [ A>=B ], cost: 1 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 66: f115 -> f132 : Z'=0, [ B>=1+A && Z==0 ], cost: 1 118: f115 -> f117 : H'=free_11, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A 62: f117 -> f115 : A1'=free_33, B'=1+B, B1'=free_32, C1'=free_34, Z'=0, [ K>=1+A && free_33>=0 ], cost: 1 63: f117 -> f115 : A1'=free_36, B'=1+B, B1'=free_35, C1'=free_37, [ K>=1+A && 0>=1+free_36 ], cost: 1 23: f132 -> f134 : [ A>=B ], cost: 1 119: f132 -> f134 : H'=free_12, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A 128: f132 -> f161 : [ B>=1+A ], cost: 4 60: f134 -> f132 : B'=1+B, [ K>=1+A ], cost: 1 30: f161 -> f163 : [ A>=B ], cost: 1 56: f161 -> f171 : [ B>=1+A ], cost: 1 120: f161 -> f163 : H'=free_17, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A 55: f163 -> f161 : B'=1+B, [ K>=1+A ], cost: 1 32: f171 -> f173 : [ B>=1 ], cost: 1 54: f171 -> f181 : [ 0>=B ], cost: 1 121: f171 -> f173 : H'=free_18, K'=1+B, [ B>=1 && B>=K ], cost: 2+B-K 122: f171 -> f181 : B'=1+A, [ 0>=B && A>=B ], cost: 2-B+A 53: f173 -> f171 : B'=-1+B, [ K>=1+B ], cost: 1 52: f181 -> f188 : Y'=free_31, [ B>=1+A ], cost: 1 35: f188 -> f190 : [ A>=B ], cost: 1 51: f188 -> f201 : C'=0, [ B>=1+A ], cost: 1 123: f188 -> f190 : H'=free_19, K'=1+A, [ A>=B && A>=K ], cost: 2-K+A 50: f190 -> f188 : B'=1+B, [ K>=1+A ], cost: 1 47: f201 -> f211 : X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 1 48: f201 -> f211 : X'=free_30, [ B>=1+A && free_30>=1 ], cost: 1 49: f201 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 1 46: f211 -> f54 : J'=1+J, [ B>=1+A ], cost: 1 40: f218 -> f228 : R'=free_24, S'=free_23, T'=free_23, U'=1, V'=free_23, W'=free_25, [ A>=B && free_23>=2 ], cost: 1 41: f218 -> f228 : R'=free_27, S'=free_26, T'=free_26, U'=1, V'=1, W'=free_28, [ A>=B && 1>=free_26 ], cost: 1 44: f218 -> f54 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1 42: f228 -> f218 : B'=1+B, [ C>=W ], cost: 1 43: f228 -> f218 : B'=1+B, C'=W, [ W>=1+C ], cost: 1 82: start -> f0 : [], cost: 1 109: start -> f0 : B'=1+A, D'=free, [ A>=B && C>=free ], cost: 2-B+A 110: start -> f0 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, [ A>=B ], cost: 2-B+A Eliminated locations (on tree-shaped paths): Start location: start 5: f54 -> f57 : [ 0>=1+Q && 200>=J ], cost: 1 6: f54 -> f57 : [ Q>=1 && 200>=J ], cost: 1 132: f54 -> f104 : Q'=0, [ 200>=J && Q==0 && B>=1+A ], cost: 2 133: f54 -> f104 : B'=1+A, Q'=0, [ 200>=J && Q==0 && A>=B ], cost: 3-B+A 77: f57 -> f67 : [ B>=1+A ], cost: 1 113: f57 -> f67 : L'=A, M'=0, [ B>=1+A && A>=1+L ], cost: 1+A-L 134: f57 -> f57 : B'=1+B, [ A>=B && K>=1+A ], cost: 2 135: f57 -> f57 : B'=1+B, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A 9: f67 -> f71 : M'=free_7, [ A>=1+L && 0>=1+free_7 ], cost: 1 10: f67 -> f71 : M'=free_8, [ A>=1+L && free_8>=1 ], cost: 1 75: f67 -> f89 : [ L>=A ], cost: 1 74: f71 -> f67 : L'=1+L, [ K>=1+A ], cost: 1 112: f71 -> f67 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: A-L 136: f71 -> f71 : H'=free_38, K'=1+K, [ A>=K && B>=1+A ], cost: 3 137: f71 -> f71 : B'=1+A, H'=free_38, K'=1+K, [ A>=K && A>=B ], cost: 4-B+A 71: f89 -> f161 : [ B>=1+A ], cost: 1 138: f89 -> f89 : B'=1+B, [ A>=B && K>=B ], cost: 2 139: f89 -> f89 : B'=1+B, K'=B, [ A>=B && B>=1+K ], cost: 2+B-K 68: f104 -> f115 : Z'=1, [ B>=1+A ], cost: 1 155: f104 -> f104 : B'=1+B, [ A>=B && K>=1+A ], cost: 2 156: f104 -> f104 : B'=1+B, H'=free_10, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 66: f115 -> f132 : Z'=0, [ B>=1+A && Z==0 ], cost: 1 157: f115 -> f115 : A1'=free_33, B'=1+B, B1'=free_32, C1'=free_34, Z'=0, [ A>=B && K>=1+A && free_33>=0 ], cost: 2 158: f115 -> f115 : A1'=free_36, B'=1+B, B1'=free_35, C1'=free_37, [ A>=B && K>=1+A && 0>=1+free_36 ], cost: 2 159: f115 -> f115 : A1'=free_33, B'=1+B, B1'=free_32, C1'=free_34, H'=free_11, K'=1+A, Z'=0, [ A>=B && A>=K && free_33>=0 ], cost: 3-K+A 160: f115 -> f115 : A1'=free_36, B'=1+B, B1'=free_35, C1'=free_37, H'=free_11, K'=1+A, [ A>=B && A>=K && 0>=1+free_36 ], cost: 3-K+A 128: f132 -> f161 : [ B>=1+A ], cost: 4 161: f132 -> f132 : B'=1+B, [ A>=B && K>=1+A ], cost: 2 162: f132 -> f132 : B'=1+B, H'=free_12, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A 56: f161 -> f171 : [ B>=1+A ], cost: 1 140: f161 -> f161 : B'=1+B, [ A>=B && K>=1+A ], cost: 2 141: f161 -> f161 : B'=1+B, H'=free_17, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A 142: f171 -> f171 : B'=-1+B, [ B>=1 && K>=1+B ], cost: 2 143: f171 -> f171 : B'=-1+B, H'=free_18, K'=1+B, [ B>=1 && B>=K ], cost: 3+B-K 144: f171 -> f188 : Y'=free_31, [ 0>=B && B>=1+A ], cost: 2 145: f171 -> f188 : B'=1+A, Y'=free_31, [ 0>=B && A>=B ], cost: 3-B+A 146: f188 -> f188 : B'=1+B, [ A>=B && K>=1+A ], cost: 2 147: f188 -> f188 : B'=1+B, H'=free_19, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A 148: f188 -> f211 : C'=0, X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 2 149: f188 -> f211 : C'=0, X'=free_30, [ B>=1+A && free_30>=1 ], cost: 2 150: f188 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 2 46: f211 -> f54 : J'=1+J, [ B>=1+A ], cost: 1 44: f218 -> f54 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1 151: f218 -> f218 : B'=1+B, R'=free_24, S'=free_23, T'=free_23, U'=1, V'=free_23, W'=free_25, [ A>=B && free_23>=2 && C>=free_25 ], cost: 2 152: f218 -> f218 : B'=1+B, C'=free_25, R'=free_24, S'=free_23, T'=free_23, U'=1, V'=free_23, W'=free_25, [ A>=B && free_23>=2 && free_25>=1+C ], cost: 2 153: f218 -> f218 : B'=1+B, R'=free_27, S'=free_26, T'=free_26, U'=1, V'=1, W'=free_28, [ A>=B && 1>=free_26 && C>=free_28 ], cost: 2 154: f218 -> f218 : B'=1+B, C'=free_28, R'=free_27, S'=free_26, T'=free_26, U'=1, V'=1, W'=free_28, [ A>=B && 1>=free_26 && free_28>=1+C ], cost: 2 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Accelerating simple loops of location 3. Accelerating the following rules: 134: f57 -> f57 : B'=1+B, [ A>=B && K>=1+A ], cost: 2 135: f57 -> f57 : B'=1+B, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A Accelerated rule 134 with metering function 1-B+A, yielding the new rule 163. Found no metering function for rule 135. Removing the simple loops: 134. Accelerating simple loops of location 6. Accelerating the following rules: 136: f71 -> f71 : H'=free_38, K'=1+K, [ A>=K && B>=1+A ], cost: 3 137: f71 -> f71 : B'=1+A, H'=free_38, K'=1+K, [ A>=K && A>=B ], cost: 4-B+A Accelerated rule 136 with metering function 1-K+A, yielding the new rule 164. Found no metering function for rule 137. Removing the simple loops: 136. Accelerating simple loops of location 9. Accelerating the following rules: 138: f89 -> f89 : B'=1+B, [ A>=B && K>=B ], cost: 2 139: f89 -> f89 : B'=1+B, K'=B, [ A>=B && B>=1+K ], cost: 2+B-K Found no metering function for rule 138. Accelerated rule 139 with metering function 1-B+A, yielding the new rule 165. Removing the simple loops: 139. Accelerating simple loops of location 12. Accelerating the following rules: 155: f104 -> f104 : B'=1+B, [ A>=B && K>=1+A ], cost: 2 156: f104 -> f104 : B'=1+B, H'=free_10, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A Accelerated rule 155 with metering function 1-B+A, yielding the new rule 166. Found no metering function for rule 156. Removing the simple loops: 155. Accelerating simple loops of location 14. Accelerating the following rules: 157: f115 -> f115 : A1'=free_33, B'=1+B, B1'=free_32, C1'=free_34, Z'=0, [ A>=B && K>=1+A && free_33>=0 ], cost: 2 158: f115 -> f115 : A1'=free_36, B'=1+B, B1'=free_35, C1'=free_37, [ A>=B && K>=1+A && 0>=1+free_36 ], cost: 2 159: f115 -> f115 : A1'=free_33, B'=1+B, B1'=free_32, C1'=free_34, H'=free_11, K'=1+A, Z'=0, [ A>=B && A>=K && free_33>=0 ], cost: 3-K+A 160: f115 -> f115 : A1'=free_36, B'=1+B, B1'=free_35, C1'=free_37, H'=free_11, K'=1+A, [ A>=B && A>=K && 0>=1+free_36 ], cost: 3-K+A Accelerated rule 157 with metering function 1-B+A, yielding the new rule 167. Accelerated rule 158 with metering function 1-B+A, yielding the new rule 168. Found no metering function for rule 159. Found no metering function for rule 160. Removing the simple loops: 157 158. Accelerating simple loops of location 16. Accelerating the following rules: 161: f132 -> f132 : B'=1+B, [ A>=B && K>=1+A ], cost: 2 162: f132 -> f132 : B'=1+B, H'=free_12, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A Accelerated rule 161 with metering function 1-B+A, yielding the new rule 169. Found no metering function for rule 162. Removing the simple loops: 161. Accelerating simple loops of location 21. Accelerating the following rules: 140: f161 -> f161 : B'=1+B, [ A>=B && K>=1+A ], cost: 2 141: f161 -> f161 : B'=1+B, H'=free_17, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A Accelerated rule 140 with metering function 1-B+A, yielding the new rule 170. Found no metering function for rule 141. Removing the simple loops: 140. Accelerating simple loops of location 23. Accelerating the following rules: 142: f171 -> f171 : B'=-1+B, [ B>=1 && K>=1+B ], cost: 2 143: f171 -> f171 : B'=-1+B, H'=free_18, K'=1+B, [ B>=1 && B>=K ], cost: 3+B-K Accelerated rule 142 with metering function B, yielding the new rule 171. Found no metering function for rule 143. Removing the simple loops: 142. Accelerating simple loops of location 26. Accelerating the following rules: 146: f188 -> f188 : B'=1+B, [ A>=B && K>=1+A ], cost: 2 147: f188 -> f188 : B'=1+B, H'=free_19, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A Accelerated rule 146 with metering function 1-B+A, yielding the new rule 172. Found no metering function for rule 147. Removing the simple loops: 146. Accelerating simple loops of location 30. Accelerating the following rules: 151: f218 -> f218 : B'=1+B, R'=free_24, S'=free_23, T'=free_23, U'=1, V'=free_23, W'=free_25, [ A>=B && free_23>=2 && C>=free_25 ], cost: 2 152: f218 -> f218 : B'=1+B, C'=free_25, R'=free_24, S'=free_23, T'=free_23, U'=1, V'=free_23, W'=free_25, [ A>=B && free_23>=2 && free_25>=1+C ], cost: 2 153: f218 -> f218 : B'=1+B, R'=free_27, S'=free_26, T'=free_26, U'=1, V'=1, W'=free_28, [ A>=B && 1>=free_26 && C>=free_28 ], cost: 2 154: f218 -> f218 : B'=1+B, C'=free_28, R'=free_27, S'=free_26, T'=free_26, U'=1, V'=1, W'=free_28, [ A>=B && 1>=free_26 && free_28>=1+C ], cost: 2 Accelerated rule 151 with metering function 1-B+A, yielding the new rule 173. During metering: Instantiating temporary variables by {free_25==1+C} Accelerated rule 152 with metering function 1-B+A, yielding the new rule 174. Accelerated rule 153 with metering function 1-B+A, yielding the new rule 175. During metering: Instantiating temporary variables by {free_28==1+C} Accelerated rule 154 with metering function 1-B+A, yielding the new rule 176. Removing the simple loops: 151 152 153 154. Accelerated all simple loops using metering functions (where possible): Start location: start 5: f54 -> f57 : [ 0>=1+Q && 200>=J ], cost: 1 6: f54 -> f57 : [ Q>=1 && 200>=J ], cost: 1 132: f54 -> f104 : Q'=0, [ 200>=J && Q==0 && B>=1+A ], cost: 2 133: f54 -> f104 : B'=1+A, Q'=0, [ 200>=J && Q==0 && A>=B ], cost: 3-B+A 77: f57 -> f67 : [ B>=1+A ], cost: 1 113: f57 -> f67 : L'=A, M'=0, [ B>=1+A && A>=1+L ], cost: 1+A-L 135: f57 -> f57 : B'=1+B, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A 163: f57 -> f57 : B'=1+A, [ A>=B && K>=1+A ], cost: 2-2*B+2*A 9: f67 -> f71 : M'=free_7, [ A>=1+L && 0>=1+free_7 ], cost: 1 10: f67 -> f71 : M'=free_8, [ A>=1+L && free_8>=1 ], cost: 1 75: f67 -> f89 : [ L>=A ], cost: 1 74: f71 -> f67 : L'=1+L, [ K>=1+A ], cost: 1 112: f71 -> f67 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: A-L 137: f71 -> f71 : B'=1+A, H'=free_38, K'=1+K, [ A>=K && A>=B ], cost: 4-B+A 164: f71 -> f71 : H'=free_38, K'=1+A, [ A>=K && B>=1+A ], cost: 3-3*K+3*A 71: f89 -> f161 : [ B>=1+A ], cost: 1 138: f89 -> f89 : B'=1+B, [ A>=B && K>=B ], cost: 2 165: f89 -> f89 : B'=1+A, K'=A, [ A>=B && B>=1+K ], cost: 3-3*B+3*A 68: f104 -> f115 : Z'=1, [ B>=1+A ], cost: 1 156: f104 -> f104 : B'=1+B, H'=free_10, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A 166: f104 -> f104 : B'=1+A, [ A>=B && K>=1+A ], cost: 2-2*B+2*A 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 66: f115 -> f132 : Z'=0, [ B>=1+A && Z==0 ], cost: 1 159: f115 -> f115 : A1'=free_33, B'=1+B, B1'=free_32, C1'=free_34, H'=free_11, K'=1+A, Z'=0, [ A>=B && A>=K && free_33>=0 ], cost: 3-K+A 160: f115 -> f115 : A1'=free_36, B'=1+B, B1'=free_35, C1'=free_37, H'=free_11, K'=1+A, [ A>=B && A>=K && 0>=1+free_36 ], cost: 3-K+A 167: f115 -> f115 : A1'=free_33, B'=1+A, B1'=free_32, C1'=free_34, Z'=0, [ A>=B && K>=1+A && free_33>=0 ], cost: 2-2*B+2*A 168: f115 -> f115 : A1'=free_36, B'=1+A, B1'=free_35, C1'=free_37, [ A>=B && K>=1+A && 0>=1+free_36 ], cost: 2-2*B+2*A 128: f132 -> f161 : [ B>=1+A ], cost: 4 162: f132 -> f132 : B'=1+B, H'=free_12, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A 169: f132 -> f132 : B'=1+A, [ A>=B && K>=1+A ], cost: 2-2*B+2*A 56: f161 -> f171 : [ B>=1+A ], cost: 1 141: f161 -> f161 : B'=1+B, H'=free_17, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A 170: f161 -> f161 : B'=1+A, [ A>=B && K>=1+A ], cost: 2-2*B+2*A 143: f171 -> f171 : B'=-1+B, H'=free_18, K'=1+B, [ B>=1 && B>=K ], cost: 3+B-K 144: f171 -> f188 : Y'=free_31, [ 0>=B && B>=1+A ], cost: 2 145: f171 -> f188 : B'=1+A, Y'=free_31, [ 0>=B && A>=B ], cost: 3-B+A 171: f171 -> f171 : B'=0, [ B>=1 && K>=1+B ], cost: 2*B 147: f188 -> f188 : B'=1+B, H'=free_19, K'=1+A, [ A>=B && A>=K ], cost: 3-K+A 148: f188 -> f211 : C'=0, X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 2 149: f188 -> f211 : C'=0, X'=free_30, [ B>=1+A && free_30>=1 ], cost: 2 150: f188 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 2 172: f188 -> f188 : B'=1+A, [ A>=B && K>=1+A ], cost: 2-2*B+2*A 46: f211 -> f54 : J'=1+J, [ B>=1+A ], cost: 1 44: f218 -> f54 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1 173: f218 -> f218 : B'=1+A, R'=free_24, S'=free_23, T'=free_23, U'=1, V'=free_23, W'=free_25, [ A>=B && free_23>=2 && C>=free_25 ], cost: 2-2*B+2*A 174: f218 -> f218 : B'=1+A, C'=1-B+A+C, R'=free_24, S'=free_23, T'=free_23, U'=1, V'=free_23, W'=1-B+A+C, [ A>=B && free_23>=2 ], cost: 2-2*B+2*A 175: f218 -> f218 : B'=1+A, R'=free_27, S'=free_26, T'=free_26, U'=1, V'=1, W'=free_28, [ A>=B && 1>=free_26 && C>=free_28 ], cost: 2-2*B+2*A 176: f218 -> f218 : B'=1+A, C'=1-B+A+C, R'=free_27, S'=free_26, T'=free_26, U'=1, V'=1, W'=1-B+A+C, [ A>=B && 1>=free_26 ], cost: 2-2*B+2*A 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Chained accelerated rules (with incoming rules): Start location: start 5: f54 -> f57 : [ 0>=1+Q && 200>=J ], cost: 1 6: f54 -> f57 : [ Q>=1 && 200>=J ], cost: 1 132: f54 -> f104 : Q'=0, [ 200>=J && Q==0 && B>=1+A ], cost: 2 133: f54 -> f104 : B'=1+A, Q'=0, [ 200>=J && Q==0 && A>=B ], cost: 3-B+A 177: f54 -> f57 : B'=1+B, K'=1+A, [ 0>=1+Q && 200>=J && A>=B && A>=K ], cost: 4-K+A 178: f54 -> f57 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K ], cost: 4-K+A 179: f54 -> f57 : B'=1+A, [ 0>=1+Q && 200>=J && A>=B && K>=1+A ], cost: 3-2*B+2*A 180: f54 -> f57 : B'=1+A, [ Q>=1 && 200>=J && A>=B && K>=1+A ], cost: 3-2*B+2*A 77: f57 -> f67 : [ B>=1+A ], cost: 1 113: f57 -> f67 : L'=A, M'=0, [ B>=1+A && A>=1+L ], cost: 1+A-L 9: f67 -> f71 : M'=free_7, [ A>=1+L && 0>=1+free_7 ], cost: 1 10: f67 -> f71 : M'=free_8, [ A>=1+L && free_8>=1 ], cost: 1 75: f67 -> f89 : [ L>=A ], cost: 1 181: f67 -> f71 : B'=1+A, H'=free_38, K'=1+K, M'=free_7, [ A>=1+L && 0>=1+free_7 && A>=K && A>=B ], cost: 5-B+A 182: f67 -> f71 : B'=1+A, H'=free_38, K'=1+K, M'=free_8, [ A>=1+L && free_8>=1 && A>=K && A>=B ], cost: 5-B+A 183: f67 -> f71 : H'=free_38, K'=1+A, M'=free_7, [ A>=1+L && 0>=1+free_7 && A>=K && B>=1+A ], cost: 4-3*K+3*A 184: f67 -> f71 : H'=free_38, K'=1+A, M'=free_8, [ A>=1+L && free_8>=1 && A>=K && B>=1+A ], cost: 4-3*K+3*A 185: f67 -> f89 : B'=1+B, [ L>=A && A>=B && K>=B ], cost: 3 186: f67 -> f89 : B'=1+A, K'=A, [ L>=A && A>=B && B>=1+K ], cost: 4-3*B+3*A 74: f71 -> f67 : L'=1+L, [ K>=1+A ], cost: 1 112: f71 -> f67 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: A-L 71: f89 -> f161 : [ B>=1+A ], cost: 1 68: f104 -> f115 : Z'=1, [ B>=1+A ], cost: 1 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 66: f115 -> f132 : Z'=0, [ B>=1+A && Z==0 ], cost: 1 128: f132 -> f161 : [ B>=1+A ], cost: 4 56: f161 -> f171 : [ B>=1+A ], cost: 1 187: f161 -> f171 : B'=-1+B, H'=free_18, K'=1+B, [ B>=1+A && B>=1 && B>=K ], cost: 4+B-K 188: f161 -> f171 : B'=0, [ B>=1+A && B>=1 && K>=1+B ], cost: 1+2*B 144: f171 -> f188 : Y'=free_31, [ 0>=B && B>=1+A ], cost: 2 145: f171 -> f188 : B'=1+A, Y'=free_31, [ 0>=B && A>=B ], cost: 3-B+A 148: f188 -> f211 : C'=0, X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 2 149: f188 -> f211 : C'=0, X'=free_30, [ B>=1+A && free_30>=1 ], cost: 2 150: f188 -> f218 : C'=0, Q'=0, X'=0, [ B>=1+A ], cost: 2 46: f211 -> f54 : J'=1+J, [ B>=1+A ], cost: 1 44: f218 -> f54 : J'=1+J, [ B>=1+A && C>=0 ], cost: 1 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Eliminated locations (on linear paths): Start location: start 5: f54 -> f57 : [ 0>=1+Q && 200>=J ], cost: 1 6: f54 -> f57 : [ Q>=1 && 200>=J ], cost: 1 132: f54 -> f104 : Q'=0, [ 200>=J && Q==0 && B>=1+A ], cost: 2 133: f54 -> f104 : B'=1+A, Q'=0, [ 200>=J && Q==0 && A>=B ], cost: 3-B+A 177: f54 -> f57 : B'=1+B, K'=1+A, [ 0>=1+Q && 200>=J && A>=B && A>=K ], cost: 4-K+A 178: f54 -> f57 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K ], cost: 4-K+A 179: f54 -> f57 : B'=1+A, [ 0>=1+Q && 200>=J && A>=B && K>=1+A ], cost: 3-2*B+2*A 180: f54 -> f57 : B'=1+A, [ Q>=1 && 200>=J && A>=B && K>=1+A ], cost: 3-2*B+2*A 77: f57 -> f67 : [ B>=1+A ], cost: 1 113: f57 -> f67 : L'=A, M'=0, [ B>=1+A && A>=1+L ], cost: 1+A-L 9: f67 -> f71 : M'=free_7, [ A>=1+L && 0>=1+free_7 ], cost: 1 10: f67 -> f71 : M'=free_8, [ A>=1+L && free_8>=1 ], cost: 1 75: f67 -> f89 : [ L>=A ], cost: 1 181: f67 -> f71 : B'=1+A, H'=free_38, K'=1+K, M'=free_7, [ A>=1+L && 0>=1+free_7 && A>=K && A>=B ], cost: 5-B+A 182: f67 -> f71 : B'=1+A, H'=free_38, K'=1+K, M'=free_8, [ A>=1+L && free_8>=1 && A>=K && A>=B ], cost: 5-B+A 183: f67 -> f71 : H'=free_38, K'=1+A, M'=free_7, [ A>=1+L && 0>=1+free_7 && A>=K && B>=1+A ], cost: 4-3*K+3*A 184: f67 -> f71 : H'=free_38, K'=1+A, M'=free_8, [ A>=1+L && free_8>=1 && A>=K && B>=1+A ], cost: 4-3*K+3*A 185: f67 -> f89 : B'=1+B, [ L>=A && A>=B && K>=B ], cost: 3 186: f67 -> f89 : B'=1+A, K'=A, [ L>=A && A>=B && B>=1+K ], cost: 4-3*B+3*A 74: f71 -> f67 : L'=1+L, [ K>=1+A ], cost: 1 112: f71 -> f67 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: A-L 71: f89 -> f161 : [ B>=1+A ], cost: 1 68: f104 -> f115 : Z'=1, [ B>=1+A ], cost: 1 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 190: f115 -> f161 : Z'=0, [ B>=1+A && Z==0 ], cost: 5 56: f161 -> f171 : [ B>=1+A ], cost: 1 187: f161 -> f171 : B'=-1+B, H'=free_18, K'=1+B, [ B>=1+A && B>=1 && B>=K ], cost: 4+B-K 188: f161 -> f171 : B'=0, [ B>=1+A && B>=1 && K>=1+B ], cost: 1+2*B 144: f171 -> f188 : Y'=free_31, [ 0>=B && B>=1+A ], cost: 2 145: f171 -> f188 : B'=1+A, Y'=free_31, [ 0>=B && A>=B ], cost: 3-B+A 148: f188 -> f211 : C'=0, X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 2 149: f188 -> f211 : C'=0, X'=free_30, [ B>=1+A && free_30>=1 ], cost: 2 189: f188 -> f54 : C'=0, Q'=0, J'=1+J, X'=0, [ B>=1+A ], cost: 3 46: f211 -> f54 : J'=1+J, [ B>=1+A ], cost: 1 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Eliminated locations (on tree-shaped paths): Start location: start 191: f54 -> f67 : [ 0>=1+Q && 200>=J && B>=1+A ], cost: 2 192: f54 -> f67 : L'=A, M'=0, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 193: f54 -> f67 : [ Q>=1 && 200>=J && B>=1+A ], cost: 2 194: f54 -> f67 : L'=A, M'=0, [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 195: f54 -> f67 : B'=1+B, K'=1+A, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A 196: f54 -> f67 : B'=1+B, K'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K+2*A-L 197: f54 -> f67 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A 198: f54 -> f67 : B'=1+B, K'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K+2*A-L 199: f54 -> f67 : B'=1+A, [ 0>=1+Q && 200>=J && A>=B && K>=1+A ], cost: 4-2*B+2*A 200: f54 -> f67 : B'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 4-2*B+3*A-L 201: f54 -> f67 : B'=1+A, [ Q>=1 && 200>=J && A>=B && K>=1+A ], cost: 4-2*B+2*A 202: f54 -> f67 : B'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 4-2*B+3*A-L 203: f54 -> f115 : Q'=0, Z'=1, [ 200>=J && Q==0 && B>=1+A ], cost: 3 204: f54 -> f115 : B'=1+A, Q'=0, Z'=1, [ 200>=J && Q==0 && A>=B ], cost: 4-B+A 205: f67 -> f67 : L'=1+L, M'=free_7, [ A>=1+L && 0>=1+free_7 && K>=1+A ], cost: 2 206: f67 -> f67 : L'=A, M'=0, [ 0>=1+free_7 && K>=1+A && A>=2+L ], cost: 1+A-L 207: f67 -> f67 : L'=1+L, M'=free_8, [ A>=1+L && free_8>=1 && K>=1+A ], cost: 2 208: f67 -> f67 : L'=A, M'=0, [ free_8>=1 && K>=1+A && A>=2+L ], cost: 1+A-L 209: f67 -> f67 : B'=1+A, H'=free_38, K'=1+K, L'=1+L, M'=free_7, [ A>=1+L && 0>=1+free_7 && A>=K && A>=B && 1+K>=1+A ], cost: 6-B+A 210: f67 -> f67 : B'=1+A, H'=free_38, K'=1+K, L'=A, M'=0, [ 0>=1+free_7 && A>=K && A>=B && 1+K>=1+A && A>=2+L ], cost: 5-B+2*A-L 211: f67 -> f67 : B'=1+A, H'=free_38, K'=1+K, L'=1+L, M'=free_8, [ A>=1+L && free_8>=1 && A>=K && A>=B && 1+K>=1+A ], cost: 6-B+A 212: f67 -> f67 : B'=1+A, H'=free_38, K'=1+K, L'=A, M'=0, [ free_8>=1 && A>=K && A>=B && 1+K>=1+A && A>=2+L ], cost: 5-B+2*A-L 213: f67 -> f67 : H'=free_38, K'=1+A, L'=1+L, M'=free_7, [ A>=1+L && 0>=1+free_7 && A>=K && B>=1+A ], cost: 5-3*K+3*A 214: f67 -> f67 : H'=free_38, K'=1+A, L'=A, M'=0, [ 0>=1+free_7 && A>=K && B>=1+A && A>=2+L ], cost: 4-3*K+4*A-L 215: f67 -> f67 : H'=free_38, K'=1+A, L'=1+L, M'=free_8, [ A>=1+L && free_8>=1 && A>=K && B>=1+A ], cost: 5-3*K+3*A 216: f67 -> f67 : H'=free_38, K'=1+A, L'=A, M'=0, [ free_8>=1 && A>=K && B>=1+A && A>=2+L ], cost: 4-3*K+4*A-L 217: f67 -> f161 : [ L>=A && B>=1+A ], cost: 2 218: f67 -> f161 : B'=1+B, [ L>=A && A>=B && K>=B && 1+B>=1+A ], cost: 4 219: f67 -> f161 : B'=1+A, K'=A, [ L>=A && A>=B && B>=1+K ], cost: 5-3*B+3*A 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 190: f115 -> f161 : Z'=0, [ B>=1+A && Z==0 ], cost: 5 220: f161 -> f188 : Y'=free_31, [ B>=1+A && 0>=B ], cost: 3 221: f161 -> f188 : B'=-1+B, H'=free_18, K'=1+B, Y'=free_31, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A ], cost: 6+B-K 222: f161 -> f188 : B'=1+A, H'=free_18, K'=1+B, Y'=free_31, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B ], cost: 8-K+A 223: f161 -> f188 : B'=0, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A ], cost: 3+2*B 224: f161 -> f188 : B'=1+A, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && A>=0 ], cost: 4+2*B+A 189: f188 -> f54 : C'=0, Q'=0, J'=1+J, X'=0, [ B>=1+A ], cost: 3 225: f188 -> f54 : C'=0, J'=1+J, X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 3 226: f188 -> f54 : C'=0, J'=1+J, X'=free_30, [ B>=1+A && free_30>=1 ], cost: 3 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Applied pruning (of leafs and parallel rules): Start location: start 192: f54 -> f67 : L'=A, M'=0, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 194: f54 -> f67 : L'=A, M'=0, [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 196: f54 -> f67 : B'=1+B, K'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K+2*A-L 197: f54 -> f67 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A 202: f54 -> f67 : B'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 4-2*B+3*A-L 203: f54 -> f115 : Q'=0, Z'=1, [ 200>=J && Q==0 && B>=1+A ], cost: 3 204: f54 -> f115 : B'=1+A, Q'=0, Z'=1, [ 200>=J && Q==0 && A>=B ], cost: 4-B+A 206: f67 -> f67 : L'=A, M'=0, [ 0>=1+free_7 && K>=1+A && A>=2+L ], cost: 1+A-L 208: f67 -> f67 : L'=A, M'=0, [ free_8>=1 && K>=1+A && A>=2+L ], cost: 1+A-L 211: f67 -> f67 : B'=1+A, H'=free_38, K'=1+K, L'=1+L, M'=free_8, [ A>=1+L && free_8>=1 && A>=K && A>=B && 1+K>=1+A ], cost: 6-B+A 213: f67 -> f67 : H'=free_38, K'=1+A, L'=1+L, M'=free_7, [ A>=1+L && 0>=1+free_7 && A>=K && B>=1+A ], cost: 5-3*K+3*A 215: f67 -> f67 : H'=free_38, K'=1+A, L'=1+L, M'=free_8, [ A>=1+L && free_8>=1 && A>=K && B>=1+A ], cost: 5-3*K+3*A 217: f67 -> f161 : [ L>=A && B>=1+A ], cost: 2 218: f67 -> f161 : B'=1+B, [ L>=A && A>=B && K>=B && 1+B>=1+A ], cost: 4 219: f67 -> f161 : B'=1+A, K'=A, [ L>=A && A>=B && B>=1+K ], cost: 5-3*B+3*A 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 190: f115 -> f161 : Z'=0, [ B>=1+A && Z==0 ], cost: 5 220: f161 -> f188 : Y'=free_31, [ B>=1+A && 0>=B ], cost: 3 221: f161 -> f188 : B'=-1+B, H'=free_18, K'=1+B, Y'=free_31, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A ], cost: 6+B-K 222: f161 -> f188 : B'=1+A, H'=free_18, K'=1+B, Y'=free_31, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B ], cost: 8-K+A 223: f161 -> f188 : B'=0, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A ], cost: 3+2*B 224: f161 -> f188 : B'=1+A, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && A>=0 ], cost: 4+2*B+A 189: f188 -> f54 : C'=0, Q'=0, J'=1+J, X'=0, [ B>=1+A ], cost: 3 225: f188 -> f54 : C'=0, J'=1+J, X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 3 226: f188 -> f54 : C'=0, J'=1+J, X'=free_30, [ B>=1+A && free_30>=1 ], cost: 3 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Accelerating simple loops of location 5. Simplified some of the simple loops (and removed duplicate rules). Accelerating the following rules: 208: f67 -> f67 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: 1+A-L 211: f67 -> f67 : B'=1+A, H'=free_38, K'=1+K, L'=1+L, M'=free_8, [ A>=1+L && free_8>=1 && K-A==0 && A>=B ], cost: 6-B+A 213: f67 -> f67 : H'=free_38, K'=1+A, L'=1+L, M'=free_7, [ A>=1+L && 0>=1+free_7 && A>=K && B>=1+A ], cost: 5-3*K+3*A 215: f67 -> f67 : H'=free_38, K'=1+A, L'=1+L, M'=free_8, [ A>=1+L && free_8>=1 && A>=K && B>=1+A ], cost: 5-3*K+3*A Found no metering function for rule 208. Accelerated rule 211 with metering function -K+A, yielding the new rule 227. Found no metering function for rule 213. Found no metering function for rule 215. Removing the simple loops: 211. Accelerated all simple loops using metering functions (where possible): Start location: start 192: f54 -> f67 : L'=A, M'=0, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 194: f54 -> f67 : L'=A, M'=0, [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 196: f54 -> f67 : B'=1+B, K'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K+2*A-L 197: f54 -> f67 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A 202: f54 -> f67 : B'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 4-2*B+3*A-L 203: f54 -> f115 : Q'=0, Z'=1, [ 200>=J && Q==0 && B>=1+A ], cost: 3 204: f54 -> f115 : B'=1+A, Q'=0, Z'=1, [ 200>=J && Q==0 && A>=B ], cost: 4-B+A 208: f67 -> f67 : L'=A, M'=0, [ K>=1+A && A>=2+L ], cost: 1+A-L 213: f67 -> f67 : H'=free_38, K'=1+A, L'=1+L, M'=free_7, [ A>=1+L && 0>=1+free_7 && A>=K && B>=1+A ], cost: 5-3*K+3*A 215: f67 -> f67 : H'=free_38, K'=1+A, L'=1+L, M'=free_8, [ A>=1+L && free_8>=1 && A>=K && B>=1+A ], cost: 5-3*K+3*A 217: f67 -> f161 : [ L>=A && B>=1+A ], cost: 2 218: f67 -> f161 : B'=1+B, [ L>=A && A>=B && K>=B && 1+B>=1+A ], cost: 4 219: f67 -> f161 : B'=1+A, K'=A, [ L>=A && A>=B && B>=1+K ], cost: 5-3*B+3*A 227: f67 -> f67 : B'=1+A, H'=free_38, K'=A, L'=-K+A+L, M'=free_8, [ A>=1+L && free_8>=1 && K-A==0 && A>=B && -K+A>=1 ], cost: -5*K+5*A 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 190: f115 -> f161 : Z'=0, [ B>=1+A && Z==0 ], cost: 5 220: f161 -> f188 : Y'=free_31, [ B>=1+A && 0>=B ], cost: 3 221: f161 -> f188 : B'=-1+B, H'=free_18, K'=1+B, Y'=free_31, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A ], cost: 6+B-K 222: f161 -> f188 : B'=1+A, H'=free_18, K'=1+B, Y'=free_31, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B ], cost: 8-K+A 223: f161 -> f188 : B'=0, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A ], cost: 3+2*B 224: f161 -> f188 : B'=1+A, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && A>=0 ], cost: 4+2*B+A 189: f188 -> f54 : C'=0, Q'=0, J'=1+J, X'=0, [ B>=1+A ], cost: 3 225: f188 -> f54 : C'=0, J'=1+J, X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 3 226: f188 -> f54 : C'=0, J'=1+J, X'=free_30, [ B>=1+A && free_30>=1 ], cost: 3 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Chained accelerated rules (with incoming rules): Start location: start 192: f54 -> f67 : L'=A, M'=0, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 194: f54 -> f67 : L'=A, M'=0, [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 196: f54 -> f67 : B'=1+B, K'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K+2*A-L 197: f54 -> f67 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A 202: f54 -> f67 : B'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 4-2*B+3*A-L 203: f54 -> f115 : Q'=0, Z'=1, [ 200>=J && Q==0 && B>=1+A ], cost: 3 204: f54 -> f115 : B'=1+A, Q'=0, Z'=1, [ 200>=J && Q==0 && A>=B ], cost: 4-B+A 228: f54 -> f67 : B'=1+B, K'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K+2*A-L 217: f67 -> f161 : [ L>=A && B>=1+A ], cost: 2 218: f67 -> f161 : B'=1+B, [ L>=A && A>=B && K>=B && 1+B>=1+A ], cost: 4 219: f67 -> f161 : B'=1+A, K'=A, [ L>=A && A>=B && B>=1+K ], cost: 5-3*B+3*A 64: f115 -> f161 : [ B>=1+A && 0>=1+Z ], cost: 1 65: f115 -> f161 : [ B>=1+A && Z>=1 ], cost: 1 190: f115 -> f161 : Z'=0, [ B>=1+A && Z==0 ], cost: 5 220: f161 -> f188 : Y'=free_31, [ B>=1+A && 0>=B ], cost: 3 221: f161 -> f188 : B'=-1+B, H'=free_18, K'=1+B, Y'=free_31, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A ], cost: 6+B-K 222: f161 -> f188 : B'=1+A, H'=free_18, K'=1+B, Y'=free_31, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B ], cost: 8-K+A 223: f161 -> f188 : B'=0, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A ], cost: 3+2*B 224: f161 -> f188 : B'=1+A, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && A>=0 ], cost: 4+2*B+A 189: f188 -> f54 : C'=0, Q'=0, J'=1+J, X'=0, [ B>=1+A ], cost: 3 225: f188 -> f54 : C'=0, J'=1+J, X'=free_29, [ B>=1+A && 0>=1+free_29 ], cost: 3 226: f188 -> f54 : C'=0, J'=1+J, X'=free_30, [ B>=1+A && free_30>=1 ], cost: 3 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Eliminated locations (on tree-shaped paths): Start location: start 229: f54 -> f161 : L'=A, M'=0, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 4+A-L 230: f54 -> f161 : L'=A, M'=0, [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 4+A-L 231: f54 -> f161 : B'=1+B, K'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 7-K+2*A-L 232: f54 -> f161 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && L>=A ], cost: 7-K+A 233: f54 -> f161 : B'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 6-2*B+3*A-L 234: f54 -> f161 : B'=1+B, K'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 8-K+2*A-L 235: f54 -> [65] : [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 236: f54 -> [65] : [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 237: f54 -> [65] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K+2*A-L 238: f54 -> [65] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A 239: f54 -> [65] : [ Q>=1 && 200>=J && A>=B && K>=1+A && A>=1+L ], cost: 4-2*B+3*A-L 240: f54 -> [65] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K+2*A-L 241: f54 -> f161 : Q'=0, Z'=1, [ 200>=J && Q==0 && B>=1+A ], cost: 4 242: f54 -> f161 : B'=1+A, Q'=0, Z'=1, [ 200>=J && Q==0 && A>=B ], cost: 5-B+A 243: f54 -> [66] : [ 200>=J && Q==0 && A>=B ], cost: 4-B+A 244: f161 -> f54 : C'=0, Q'=0, J'=1+J, X'=0, Y'=free_31, [ B>=1+A && 0>=B ], cost: 6 245: f161 -> f54 : C'=0, J'=1+J, X'=free_29, Y'=free_31, [ B>=1+A && 0>=B && 0>=1+free_29 ], cost: 6 246: f161 -> f54 : C'=0, J'=1+J, X'=free_30, Y'=free_31, [ B>=1+A && 0>=B && free_30>=1 ], cost: 6 247: f161 -> f54 : B'=-1+B, C'=0, H'=free_18, Q'=0, J'=1+J, K'=1+B, X'=0, Y'=free_31, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A ], cost: 9+B-K 248: f161 -> f54 : B'=-1+B, C'=0, H'=free_18, J'=1+J, K'=1+B, X'=free_29, Y'=free_31, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A && 0>=1+free_29 ], cost: 9+B-K 249: f161 -> f54 : B'=-1+B, C'=0, H'=free_18, J'=1+J, K'=1+B, X'=free_30, Y'=free_31, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A && free_30>=1 ], cost: 9+B-K 250: f161 -> f54 : B'=1+A, C'=0, H'=free_18, Q'=0, J'=1+J, K'=1+B, X'=0, Y'=free_31, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B ], cost: 11-K+A 251: f161 -> f54 : B'=1+A, C'=0, H'=free_18, J'=1+J, K'=1+B, X'=free_29, Y'=free_31, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B && 0>=1+free_29 ], cost: 11-K+A 252: f161 -> f54 : B'=1+A, C'=0, H'=free_18, J'=1+J, K'=1+B, X'=free_30, Y'=free_31, [ B>=1+A && B>=1 && B>=K && 0>=-1+B && A>=-1+B && free_30>=1 ], cost: 11-K+A 253: f161 -> f54 : B'=0, C'=0, Q'=0, J'=1+J, X'=0, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A ], cost: 6+2*B 254: f161 -> f54 : B'=0, C'=0, J'=1+J, X'=free_29, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 6+2*B 255: f161 -> f54 : B'=0, C'=0, J'=1+J, X'=free_30, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A && free_30>=1 ], cost: 6+2*B 256: f161 -> f54 : B'=1+A, C'=0, Q'=0, J'=1+J, X'=0, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && A>=0 ], cost: 7+2*B+A 257: f161 -> f54 : B'=1+A, C'=0, J'=1+J, X'=free_29, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 7+2*B+A 258: f161 -> f54 : B'=1+A, C'=0, J'=1+J, X'=free_30, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && A>=0 && free_30>=1 ], cost: 7+2*B+A 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Applied pruning (of leafs and parallel rules): Start location: start 229: f54 -> f161 : L'=A, M'=0, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 4+A-L 230: f54 -> f161 : L'=A, M'=0, [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 4+A-L 231: f54 -> f161 : B'=1+B, K'=1+A, L'=A, M'=0, [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 7-K+2*A-L 232: f54 -> f161 : B'=1+B, K'=1+A, [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && L>=A ], cost: 7-K+A 234: f54 -> f161 : B'=1+B, K'=1+A, L'=A, M'=0, [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 8-K+2*A-L 235: f54 -> [65] : [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 236: f54 -> [65] : [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 237: f54 -> [65] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K+2*A-L 238: f54 -> [65] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A 240: f54 -> [65] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K+2*A-L 243: f54 -> [66] : [ 200>=J && Q==0 && A>=B ], cost: 4-B+A 249: f161 -> f54 : B'=-1+B, C'=0, H'=free_18, J'=1+J, K'=1+B, X'=free_30, Y'=free_31, [ B>=1 && B>=K && 0>=-1+B && -1+B>=1+A && free_30>=1 ], cost: 9+B-K 253: f161 -> f54 : B'=0, C'=0, Q'=0, J'=1+J, X'=0, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A ], cost: 6+2*B 254: f161 -> f54 : B'=0, C'=0, J'=1+J, X'=free_29, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 6+2*B 257: f161 -> f54 : B'=1+A, C'=0, J'=1+J, X'=free_29, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 7+2*B+A 258: f161 -> f54 : B'=1+A, C'=0, J'=1+J, X'=free_30, Y'=free_31, [ B>=1+A && B>=1 && K>=1+B && A>=0 && free_30>=1 ], cost: 7+2*B+A 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Eliminated locations (on tree-shaped paths): Start location: start 235: f54 -> [65] : [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 236: f54 -> [65] : [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 237: f54 -> [65] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K+2*A-L 238: f54 -> [65] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A 240: f54 -> [65] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K+2*A-L 243: f54 -> [66] : [ 200>=J && Q==0 && A>=B ], cost: 4-B+A 259: f54 -> f54 : B'=-1+B, C'=0, H'=free_18, J'=1+J, K'=1+B, L'=A, M'=0, X'=free_30, Y'=free_31, [ 0>=1+Q && 200>=J && A>=1+L && B>=1 && B>=K && 0>=-1+B && -1+B>=1+A && free_30>=1 ], cost: 13+B-K+A-L 260: f54 -> f54 : B'=0, C'=0, Q'=0, J'=1+J, L'=A, M'=0, X'=0, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A ], cost: 10+2*B+A-L 261: f54 -> f54 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 10+2*B+A-L 262: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 11+2*B+2*A-L 263: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_30, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_30>=1 ], cost: 11+2*B+2*A-L 264: f54 -> f54 : B'=-1+B, C'=0, H'=free_18, J'=1+J, K'=1+B, L'=A, M'=0, X'=free_30, Y'=free_31, [ Q>=1 && 200>=J && A>=1+L && B>=1 && B>=K && 0>=-1+B && -1+B>=1+A && free_30>=1 ], cost: 13+B-K+A-L 265: f54 -> f54 : B'=0, C'=0, Q'=0, J'=1+J, L'=A, M'=0, X'=0, Y'=free_31, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A ], cost: 10+2*B+A-L 266: f54 -> f54 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 10+2*B+A-L 267: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 11+2*B+2*A-L 268: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_30, Y'=free_31, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_30>=1 ], cost: 11+2*B+2*A-L 269: f54 -> [67] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 7-K+2*A-L 270: f54 -> [67] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && L>=A ], cost: 7-K+A 271: f54 -> [67] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 8-K+2*A-L 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Applied pruning (of leafs and parallel rules): Start location: start 235: f54 -> [65] : [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 236: f54 -> [65] : [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 237: f54 -> [65] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K+2*A-L 238: f54 -> [65] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A 240: f54 -> [65] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K+2*A-L 243: f54 -> [66] : [ 200>=J && Q==0 && A>=B ], cost: 4-B+A 261: f54 -> f54 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 10+2*B+A-L 262: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 11+2*B+2*A-L 263: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_30, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_30>=1 ], cost: 11+2*B+2*A-L 266: f54 -> f54 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 10+2*B+A-L 267: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 11+2*B+2*A-L 269: f54 -> [67] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 7-K+2*A-L 270: f54 -> [67] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && L>=A ], cost: 7-K+A 271: f54 -> [67] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 8-K+2*A-L 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Accelerating simple loops of location 2. Accelerating the following rules: 261: f54 -> f54 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 10+2*B+A-L 262: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 11+2*B+2*A-L 263: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_30, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_30>=1 ], cost: 11+2*B+2*A-L 266: f54 -> f54 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 10+2*B+A-L 267: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 11+2*B+2*A-L Found no metering function for rule 261. Found no metering function for rule 262. Found no metering function for rule 263. Found no metering function for rule 266. Found no metering function for rule 267. Removing the simple loops:. Accelerated all simple loops using metering functions (where possible): Start location: start 235: f54 -> [65] : [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 236: f54 -> [65] : [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 237: f54 -> [65] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K+2*A-L 238: f54 -> [65] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A 240: f54 -> [65] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K+2*A-L 243: f54 -> [66] : [ 200>=J && Q==0 && A>=B ], cost: 4-B+A 261: f54 -> f54 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 10+2*B+A-L 262: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 11+2*B+2*A-L 263: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_30, Y'=free_31, [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && free_30>=1 ], cost: 11+2*B+2*A-L 266: f54 -> f54 : B'=0, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 10+2*B+A-L 267: f54 -> f54 : B'=1+A, C'=0, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ Q>=1 && 200>=J && B>=1+A && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 11+2*B+2*A-L 269: f54 -> [67] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 7-K+2*A-L 270: f54 -> [67] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && L>=A ], cost: 7-K+A 271: f54 -> [67] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 8-K+2*A-L 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A Chained accelerated rules (with incoming rules): Start location: start 235: f54 -> [65] : [ 0>=1+Q && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 236: f54 -> [65] : [ Q>=1 && 200>=J && B>=1+A && A>=1+L ], cost: 2+A-L 237: f54 -> [65] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 5-K+2*A-L 238: f54 -> [65] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A ], cost: 5-K+A 240: f54 -> [65] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 6-K+2*A-L 243: f54 -> [66] : [ 200>=J && Q==0 && A>=B ], cost: 4-B+A 269: f54 -> [67] : [ 0>=1+Q && 200>=J && A>=B && A>=K && 1+B>=1+A && A>=1+L ], cost: 7-K+2*A-L 270: f54 -> [67] : [ Q>=1 && 200>=J && A>=B && A>=K && 1+B>=1+A && L>=A ], cost: 7-K+A 271: f54 -> [67] : [ Q>=1 && 200>=J && B-A==0 && A>=K && A>=2+L ], cost: 8-K+2*A-L 129: start -> f54 : Q'=1, [ B>=1+A && C>=1 ], cost: 3 130: start -> f54 : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 ], cost: 4-B+A 131: start -> f54 : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 ], cost: 4-B+A 272: start -> f54 : B'=0, C'=0, Q'=1, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ B>=1+A && C>=1 && 200>=J && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 13+2*B+A-L 273: start -> f54 : B'=1+A, C'=0, Q'=1, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ B>=1+A && C>=1 && 200>=J && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 14+2*B+2*A-L 274: start -> f54 : B'=1+A, C'=0, D'=free, Q'=1, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ A>=B && C>=free && C>=1 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && 0>=1+free_29 ], cost: 17-B+5*A-L 275: start -> f54 : B'=1+A, C'=0, D'=1+free_2, E'=free_2, Q'=1, J'=1+J, L'=A, M'=0, X'=free_29, Y'=free_31, [ A>=B && free_2>=1 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && 0>=1+free_29 ], cost: 17-B+5*A-L Eliminated locations (on tree-shaped paths): Start location: start 276: start -> [65] : Q'=1, [ B>=1+A && C>=1 && 200>=J && A>=1+L ], cost: 5+A-L 277: start -> [65] : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 && 200>=J && A>=1+L ], cost: 6-B+2*A-L 278: start -> [65] : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 && 200>=J && A>=1+L ], cost: 6-B+2*A-L 279: start -> [69] : [ A>=B && C>=free && C>=1 ], cost: 4-B+A 280: start -> [69] : [ A>=B && free_2>=1 ], cost: 4-B+A 281: start -> [69] : [ B>=1+A && C>=1 && 200>=J && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 13+2*B+A-L 282: start -> [69] : [ B>=1+A && C>=1 && 200>=J && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 14+2*B+2*A-L 283: start -> [69] : [ A>=B && C>=free && C>=1 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && 0>=1+free_29 ], cost: 17-B+5*A-L 284: start -> [69] : [ A>=B && free_2>=1 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && 0>=1+free_29 ], cost: 17-B+5*A-L Applied pruning (of leafs and parallel rules): Start location: start 276: start -> [65] : Q'=1, [ B>=1+A && C>=1 && 200>=J && A>=1+L ], cost: 5+A-L 277: start -> [65] : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 && 200>=J && A>=1+L ], cost: 6-B+2*A-L 278: start -> [65] : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 && 200>=J && A>=1+L ], cost: 6-B+2*A-L 279: start -> [69] : [ A>=B && C>=free && C>=1 ], cost: 4-B+A 281: start -> [69] : [ B>=1+A && C>=1 && 200>=J && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 13+2*B+A-L 282: start -> [69] : [ B>=1+A && C>=1 && 200>=J && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 14+2*B+2*A-L 283: start -> [69] : [ A>=B && C>=free && C>=1 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && 0>=1+free_29 ], cost: 17-B+5*A-L 284: start -> [69] : [ A>=B && free_2>=1 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && 0>=1+free_29 ], cost: 17-B+5*A-L ### Computing asymptotic complexity ### Fully simplified ITS problem Start location: start 276: start -> [65] : Q'=1, [ B>=1+A && C>=1 && 200>=J && A>=1+L ], cost: 5+A-L 277: start -> [65] : B'=1+A, D'=free, Q'=1, [ A>=B && C>=free && C>=1 && 200>=J && A>=1+L ], cost: 6-B+2*A-L 278: start -> [65] : B'=1+A, C'=free_2, D'=1+free_2, E'=free_2, Q'=1, [ A>=B && free_2>=1 && 200>=J && A>=1+L ], cost: 6-B+2*A-L 279: start -> [69] : [ A>=B && C>=free && C>=1 ], cost: 4-B+A 281: start -> [69] : [ B>=1+A && C>=1 && 200>=J && A>=1+L && B>=1 && K>=1+B && 0>=1+A && 0>=1+free_29 ], cost: 13+2*B+A-L 282: start -> [69] : [ B>=1+A && C>=1 && 200>=J && A>=1+L && B>=1 && K>=1+B && A>=0 && 0>=1+free_29 ], cost: 14+2*B+2*A-L 283: start -> [69] : [ A>=B && C>=free && C>=1 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && 0>=1+free_29 ], cost: 17-B+5*A-L 284: start -> [69] : [ A>=B && free_2>=1 && 200>=J && A>=1+L && 1+A>=1 && K>=2+A && 0>=1+free_29 ], cost: 17-B+5*A-L Computing asymptotic complexity for rule 276 Solved the limit problem by the following transformations: Created initial limit problem: 201-J (+/+!), B-A (+/+!), A-L (+/+!), C (+/+!), 5+A-L (+) [not solved] removing all constraints (solved by SMT) resulting limit problem: [solved] applying transformation rule (C) using substitution {B==0,J==-n,A==-1,C==n,L==-n} resulting limit problem: [solved] Solution: B / 0 J / -n A / -1 C / n L / -n Resulting cost 4+n has complexity: Poly(n^1) Found new 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: 4+n Rule cost: 5+A-L Rule guard: [ B>=1+A && C>=1 && 200>=J && A>=1+L ] WORST_CASE(Omega(n^1),?) ---------------------------------------- (2) BOUNDS(n^1, INF)