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