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


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


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


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, nat(max(3 * Arg_1 + nat(6 + 6 * Arg_0 + -6 * Arg_1), 3 * Arg_1) + max(min(-3 * Arg_3 + min(-6 + -6 * Arg_0 + 6 * Arg_3, 0), -3 * Arg_3), -3 * Arg_3)) + nat(1 + 2 * Arg_0 + max(min(-2 * Arg_3 + min(-4 + -4 * Arg_0 + 4 * Arg_3, 0), -2 * Arg_3), -2 * Arg_3)) + nat(2 + 2 * Arg_0 + -2 * Arg_1) + nat(-1 * Arg_7 + max(Arg_1 + nat(2 + 2 * Arg_0 + -2 * Arg_1), Arg_1)) + nat(2 * Arg_0 + max(min(-2 * Arg_3 + min(-4 + -4 * Arg_0 + 4 * Arg_3, 0), -2 * Arg_3), -2 * Arg_3)) + max(1, 7 + 6 * Arg_0 + -6 * Arg_3) + nat(-3 * Arg_3 + max(3 * Arg_1 + nat(6 + 6 * Arg_0 + -6 * Arg_1), 3 * Arg_1)) + max(2, 4 + 2 * Arg_0 + -2 * Arg_1) + nat(3 * Arg_0 + max(-3 * Arg_3, min(-3 * Arg_3 + min(-6 + -6 * Arg_0 + 6 * Arg_3, 0), -3 * Arg_3)))).

(0) CpxIntTrs
(1) Koat2 Proof [FINISHED, 13.1 s]
(2) BOUNDS(1, nat(max(3 * Arg_1 + nat(6 + 6 * Arg_0 + -6 * Arg_1), 3 * Arg_1) + max(min(-3 * Arg_3 + min(-6 + -6 * Arg_0 + 6 * Arg_3, 0), -3 * Arg_3), -3 * Arg_3)) + nat(1 + 2 * Arg_0 + max(min(-2 * Arg_3 + min(-4 + -4 * Arg_0 + 4 * Arg_3, 0), -2 * Arg_3), -2 * Arg_3)) + nat(2 + 2 * Arg_0 + -2 * Arg_1) + nat(-1 * Arg_7 + max(Arg_1 + nat(2 + 2 * Arg_0 + -2 * Arg_1), Arg_1)) + nat(2 * Arg_0 + max(min(-2 * Arg_3 + min(-4 + -4 * Arg_0 + 4 * Arg_3, 0), -2 * Arg_3), -2 * Arg_3)) + max(1, 7 + 6 * Arg_0 + -6 * Arg_3) + nat(-3 * Arg_3 + max(3 * Arg_1 + nat(6 + 6 * Arg_0 + -6 * Arg_1), 3 * Arg_1)) + max(2, 4 + 2 * Arg_0 + -2 * Arg_1) + nat(3 * Arg_0 + max(-3 * Arg_3, min(-3 * Arg_3 + min(-6 + -6 * Arg_0 + 6 * Arg_3, 0), -3 * Arg_3))))
(3) Loat Proof [FINISHED, 18.8 s]
(4) BOUNDS(n^1, INF)


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
f69(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f71(A, B, C, D, E, F, G, H, I, J, K)) :|: 0 >= L + 1
f69(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f71(A, B, C, D, E, F, G, H, I, J, K)) :|: TRUE
f0(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f12(A, B, C, D, E, F, G, H, I, J, K)) :|: TRUE
f12(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f15(A, B, 0, D, E, F, G, H, I, J, K)) :|: A >= B
f15(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f15(A, B, C, D + 1, L, L, G, H, I, J, K)) :|: C >= L && A >= D
f15(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f15(A, B, L, D + 1, L, L, G, H, I, J, K)) :|: L >= 1 + C && A >= D
f28(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f30(A, B, C, D, E, F, G, H, I, J, K)) :|: A >= D
f30(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f33(A, B, C, D, E, F, L, H, I, J, K)) :|: D >= B + 1
f33(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f33(A, B, C, D, E, F, L, H + 1, I, J, K)) :|: B >= H + 1
f42(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f45(A, B, C, D, E, F, L, H, I, J, K)) :|: A >= B
f45(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f45(A, B, C, D, E, F, L, H + 1, I, J, K)) :|: D >= H + 1
f59(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f59(A, B, C, D, E, F, G, H + 1, L, J, K)) :|: A >= H
f71(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f73(A, B, C, D, E, F, G, H, L, J, K)) :|: A >= D + 1
f71(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f73(A, B, C, D, E, F, G, H, L, J, K)) :|: D >= 1 + A
f73(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f73(A, B + 1, C, D, E, F, G, H, I, J, K)) :|: A >= B
f71(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f28(A, B, C, A + 1, E, F, G, H, I, J, K)) :|: A >= D && A <= D
f73(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f28(A, B, C, D + 1, E, F, G, H, I, J, K)) :|: B >= 1 + A
f59(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f69(A, B, C, D, E, F, G, H, I, J, K)) :|: H >= 1 + A
f45(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f42(A, B + 1, C, D, E, F, G, H, M, L, K)) :|: C >= M + 1 && H >= D
f45(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f42(A, B + 1, L, D, E, F, G, H, L, M, B)) :|: L >= C && H >= D
f42(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f59(A, B, C, D, E, F, G, H, I, J, K)) :|: B >= 1 + A && K >= D + 1
f42(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f59(A, B, C, D, E, F, G, H, I, J, K)) :|: B >= 1 + A && D >= 1 + K
f42(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f69(A, B, C, D, E, F, G, H, I, J, D)) :|: B >= 1 + A && D >= K && D <= K
f33(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f30(A, B + 1, C, D, E, F, G, H, I, J, K)) :|: H >= B
f30(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f42(A, B, 0, D, E, F, G, H, I, J, K)) :|: B >= D
f28(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f82(A, B, C, D, E, F, G, H, I, J, K)) :|: D >= 1 + A
f15(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f12(A, B + 1, C, D, E, F, G, H, I, J, K)) :|: 0 >= C + 1 && D >= 1 + A
f15(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f12(A, B + 1, C, D, E, F, G, H, I, J, K)) :|: C >= 1 && D >= 1 + A
f15(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f12(A, B + 1, 0, D, E, F, G, H, I, J, K)) :|: D >= 1 + A && C >= 0 && C <= 0
f12(A, B, C, D, E, F, G, H, I, J, K) -> Com_1(f28(A, B, C, D, E, F, G, H, I, J, K)) :|: B >= 1 + A

The start-symbols are:[f0_11]


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

(1) Koat2 Proof (FINISHED)
YES( ?, 1+2*2*max([0, 1+Arg_0-Arg_3])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, 1+Arg_0-Arg_1])+max([0, 2*Arg_0+max([-2*Arg_3, -2*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, 1+Arg_0-Arg_3])+max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([2, 2+2+2*Arg_0+-2*Arg_1])+max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([0, 1+Arg_0-Arg_3])+max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([0, 1+Arg_0-Arg_1])+max([0, max([3*Arg_1, 3*max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, 1+2*Arg_0+max([-2*Arg_3, -2*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)})



Initial Complexity Problem:

  Start:  f0  

  Program_Vars:  Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6, Arg_7, Arg_8, Arg_9, Arg_10  

  Temp_Vars:  L  

  Locations:  f0, f12, f15, f28, f30, f42, f59, f69, f71, f73, f82  

  Transitions:

  f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f12(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:

  f12(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f15(Arg_0,Arg_1,0,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:Arg_1 <= Arg_0

  f12(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f28(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_0 <= Arg_1

  f15(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f12(Arg_0,Arg_1+1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:0 <= Arg_2 && Arg_1 <= Arg_0 && 1 <= Arg_2 && 1+Arg_0 <= Arg_3

  f15(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f12(Arg_0,Arg_1+1,0,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:0 <= Arg_2 && Arg_1 <= Arg_0 && 1+Arg_0 <= Arg_3 && Arg_2 <= 0 && 0 <= Arg_2

  f15(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f15(Arg_0,Arg_1,Arg_2,Arg_3+1,L,L,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:0 <= Arg_2 && Arg_1 <= Arg_0 && L <= Arg_2 && Arg_3 <= Arg_0

  f15(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f15(Arg_0,Arg_1,L,Arg_3+1,L,L,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:0 <= Arg_2 && Arg_1 <= Arg_0 && 1+Arg_2 <= L && Arg_3 <= Arg_0

  f28(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f30(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_0 <= Arg_1 && Arg_3 <= Arg_0

  f28(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f82(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_0 <= Arg_1 && 1+Arg_0 <= Arg_3

  f30(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f42(Arg_0,Arg_1,0,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && 1+Arg_0 <= Arg_1 && Arg_3 <= Arg_1

  f42(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f59(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && 1+Arg_0 <= Arg_1 && Arg_3+1 <= Arg_10

  f42(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f59(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && 1+Arg_0 <= Arg_1 && 1+Arg_10 <= Arg_3

  f42(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f69(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_3):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && 1+Arg_0 <= Arg_1 && Arg_3 <= Arg_10 && Arg_10 <= Arg_3

  f59(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f59(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7+1,L,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && Arg_7 <= Arg_0

  f59(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f69(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && 1+Arg_0 <= Arg_7

  f69(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f71(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && L+1 <= 0

  f69(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f71(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1

  f71(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f28(Arg_0,Arg_1,Arg_2,Arg_0+1,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && Arg_0 <= Arg_3 && Arg_3 <= Arg_0

  f71(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f73(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,L,Arg_9,Arg_10):|:1+Arg_3 <= Arg_1 && Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && Arg_3+1 <= Arg_0

  f73(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f28(Arg_0,Arg_1,Arg_2,Arg_3+1,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:2+Arg_3 <= Arg_1 && 1+Arg_3 <= Arg_0 && Arg_2 <= 0 && 0 <= Arg_2 && 1+Arg_0 <= Arg_1 && 1+Arg_0 <= Arg_1  



Timebounds: 

  Overall timebound: 1+2*2*max([0, 1+Arg_0-Arg_3])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, 1+Arg_0-Arg_1])+max([0, 2*Arg_0+max([-2*Arg_3, -2*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, 1+Arg_0-Arg_3])+max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([2, 2+2+2*Arg_0+-2*Arg_1])+max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([0, 1+Arg_0-Arg_3])+max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([0, 1+Arg_0-Arg_1])+max([0, max([3*Arg_1, 3*max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, 1+2*Arg_0+max([-2*Arg_3, -2*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  2: f0->f12: 1 {O(1)}

  3: f12->f15: max([0, 2+2*Arg_0+-2*Arg_1]) {O(n)}

  29: f12->f28: 1 {O(1)}

  4: f15->f15: max([0, 1+Arg_0-Arg_3]) {O(n)}

  5: f15->f15: max([0, 1+Arg_0-Arg_3]) {O(n)}

  27: f15->f12: max([0, 1+Arg_0-Arg_1]) {O(n)}

  28: f15->f12: max([0, 1+Arg_0-Arg_1]) {O(n)}

  6: f28->f30: max([0, 1+2*Arg_0+max([-2*Arg_3, -2*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  25: f28->f82: 1 {O(1)}

  24: f30->f42: max([0, 1+Arg_0-Arg_3]) {O(n)}

  20: f42->f59: max([0, 1+Arg_0-Arg_3]) {O(n)}

  21: f42->f59: max([0, 1+Arg_0-Arg_3]) {O(n)}

  22: f42->f69: max([0, 1+Arg_0-Arg_3]) {O(n)}

  11: f59->f59: max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  17: f59->f69: max([0, max([3*Arg_1, 3*max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  0: f69->f71: max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  1: f69->f71: max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  12: f71->f73: max([0, 2*Arg_0+max([-2*Arg_3, -2*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  15: f71->f28: max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  16: f73->f28: max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}



Costbounds:

  Overall costbound: 1+2*2*max([0, 1+Arg_0-Arg_3])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, 1+Arg_0-Arg_1])+max([0, 2*Arg_0+max([-2*Arg_3, -2*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, 1+Arg_0-Arg_3])+max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([2, 2+2+2*Arg_0+-2*Arg_1])+max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([0, 1+Arg_0-Arg_3])+max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([0, 1+Arg_0-Arg_1])+max([0, max([3*Arg_1, 3*max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, 1+2*Arg_0+max([-2*Arg_3, -2*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  2: f0->f12: 1 {O(1)}

  3: f12->f15: max([0, 2+2*Arg_0+-2*Arg_1]) {O(n)}

  29: f12->f28: 1 {O(1)}

  4: f15->f15: max([0, 1+Arg_0-Arg_3]) {O(n)}

  5: f15->f15: max([0, 1+Arg_0-Arg_3]) {O(n)}

  27: f15->f12: max([0, 1+Arg_0-Arg_1]) {O(n)}

  28: f15->f12: max([0, 1+Arg_0-Arg_1]) {O(n)}

  6: f28->f30: max([0, 1+2*Arg_0+max([-2*Arg_3, -2*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  25: f28->f82: 1 {O(1)}

  24: f30->f42: max([0, 1+Arg_0-Arg_3]) {O(n)}

  20: f42->f59: max([0, 1+Arg_0-Arg_3]) {O(n)}

  21: f42->f59: max([0, 1+Arg_0-Arg_3]) {O(n)}

  22: f42->f69: max([0, 1+Arg_0-Arg_3]) {O(n)}

  11: f59->f59: max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  17: f59->f69: max([0, max([3*Arg_1, 3*max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  0: f69->f71: max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  1: f69->f71: max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  12: f71->f73: max([0, 2*Arg_0+max([-2*Arg_3, -2*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  15: f71->f28: max([0, -(Arg_3)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  16: f73->f28: max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}



Sizebounds:

`Lower:

  2: f0->f12, Arg_0: Arg_0 {O(n)}

  2: f0->f12, Arg_1: Arg_1 {O(n)}

  2: f0->f12, Arg_2: Arg_2 {O(n)}

  2: f0->f12, Arg_3: Arg_3 {O(n)}

  2: f0->f12, Arg_4: Arg_4 {O(n)}

  2: f0->f12, Arg_5: Arg_5 {O(n)}

  2: f0->f12, Arg_6: Arg_6 {O(n)}

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

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

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

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

  3: f12->f15, Arg_0: Arg_0 {O(n)}

  3: f12->f15, Arg_1: Arg_1 {O(n)}

  3: f12->f15, Arg_2: 0 {O(1)}

  3: f12->f15, Arg_3: Arg_3 {O(n)}

  3: f12->f15, Arg_6: Arg_6 {O(n)}

  3: f12->f15, Arg_7: Arg_7 {O(n)}

  3: f12->f15, Arg_8: Arg_8 {O(n)}

  3: f12->f15, Arg_9: Arg_9 {O(n)}

  3: f12->f15, Arg_10: Arg_10 {O(n)}

  29: f12->f28, Arg_0: Arg_0 {O(n)}

  29: f12->f28, Arg_1: Arg_1 {O(n)}

  29: f12->f28, Arg_2: min([0, Arg_2]) {O(n)}

  29: f12->f28, Arg_3: Arg_3 {O(n)}

  29: f12->f28, Arg_6: Arg_6 {O(n)}

  29: f12->f28, Arg_7: Arg_7 {O(n)}

  29: f12->f28, Arg_8: Arg_8 {O(n)}

  29: f12->f28, Arg_9: Arg_9 {O(n)}

  29: f12->f28, Arg_10: Arg_10 {O(n)}

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

  4: f15->f15, Arg_1: Arg_1 {O(n)}

  4: f15->f15, Arg_2: 0 {O(1)}

  4: f15->f15, Arg_3: Arg_3 {O(n)}

  4: f15->f15, Arg_6: Arg_6 {O(n)}

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

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

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

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

  5: f15->f15, Arg_0: Arg_0 {O(n)}

  5: f15->f15, Arg_1: Arg_1 {O(n)}

  5: f15->f15, Arg_2: 1 {O(1)}

  5: f15->f15, Arg_3: Arg_3 {O(n)}

  5: f15->f15, Arg_4: 1 {O(1)}

  5: f15->f15, Arg_5: 1 {O(1)}

  5: f15->f15, Arg_6: Arg_6 {O(n)}

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

  5: f15->f15, Arg_8: Arg_8 {O(n)}

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

  5: f15->f15, Arg_10: Arg_10 {O(n)}

  27: f15->f12, Arg_0: Arg_0 {O(n)}

  27: f15->f12, Arg_1: Arg_1 {O(n)}

  27: f15->f12, Arg_2: 1 {O(1)}

  27: f15->f12, Arg_3: Arg_3 {O(n)}

  27: f15->f12, Arg_6: Arg_6 {O(n)}

  27: f15->f12, Arg_7: Arg_7 {O(n)}

  27: f15->f12, Arg_8: Arg_8 {O(n)}

  27: f15->f12, Arg_9: Arg_9 {O(n)}

  27: f15->f12, Arg_10: Arg_10 {O(n)}

  28: f15->f12, Arg_0: Arg_0 {O(n)}

  28: f15->f12, Arg_1: Arg_1 {O(n)}

  28: f15->f12, Arg_2: 0 {O(1)}

  28: f15->f12, Arg_3: Arg_3 {O(n)}

  28: f15->f12, Arg_6: Arg_6 {O(n)}

  28: f15->f12, Arg_7: Arg_7 {O(n)}

  28: f15->f12, Arg_8: Arg_8 {O(n)}

  28: f15->f12, Arg_9: Arg_9 {O(n)}

  28: f15->f12, Arg_10: Arg_10 {O(n)}

  6: f28->f30, Arg_0: Arg_0 {O(n)}

  6: f28->f30, Arg_1: Arg_1 {O(n)}

  6: f28->f30, Arg_2: min([0, Arg_2]) {O(n)}

  6: f28->f30, Arg_3: Arg_3 {O(n)}

  6: f28->f30, Arg_6: Arg_6 {O(n)}

  6: f28->f30, Arg_7: Arg_7 {O(n)}

  6: f28->f30, Arg_9: Arg_9 {O(n)}

  6: f28->f30, Arg_10: min([Arg_3, Arg_10]) {O(n)}

  25: f28->f82, Arg_0: Arg_0 {O(n)}

  25: f28->f82, Arg_1: Arg_1 {O(n)}

  25: f28->f82, Arg_2: min([0, Arg_2]) {O(n)}

  25: f28->f82, Arg_3: min([Arg_3, -(-1-Arg_0)]) {O(n)}

  25: f28->f82, Arg_6: Arg_6 {O(n)}

  25: f28->f82, Arg_7: Arg_7 {O(n)}

  25: f28->f82, Arg_9: Arg_9 {O(n)}

  25: f28->f82, Arg_10: min([Arg_10, min([Arg_3, Arg_10])]) {O(n)}

  24: f30->f42, Arg_0: Arg_0 {O(n)}

  24: f30->f42, Arg_1: Arg_1 {O(n)}

  24: f30->f42, Arg_2: 0 {O(1)}

  24: f30->f42, Arg_3: Arg_3 {O(n)}

  24: f30->f42, Arg_6: Arg_6 {O(n)}

  24: f30->f42, Arg_7: Arg_7 {O(n)}

  24: f30->f42, Arg_9: Arg_9 {O(n)}

  24: f30->f42, Arg_10: min([Arg_3, Arg_10]) {O(n)}

  20: f42->f59, Arg_0: Arg_0 {O(n)}

  20: f42->f59, Arg_1: Arg_1 {O(n)}

  20: f42->f59, Arg_2: 0 {O(1)}

  20: f42->f59, Arg_3: Arg_3 {O(n)}

  20: f42->f59, Arg_6: Arg_6 {O(n)}

  20: f42->f59, Arg_7: Arg_7 {O(n)}

  20: f42->f59, Arg_9: Arg_9 {O(n)}

  20: f42->f59, Arg_10: min([Arg_3, Arg_10]) {O(n)}

  21: f42->f59, Arg_0: Arg_0 {O(n)}

  21: f42->f59, Arg_1: Arg_1 {O(n)}

  21: f42->f59, Arg_2: 0 {O(1)}

  21: f42->f59, Arg_3: Arg_3 {O(n)}

  21: f42->f59, Arg_6: Arg_6 {O(n)}

  21: f42->f59, Arg_7: Arg_7 {O(n)}

  21: f42->f59, Arg_9: Arg_9 {O(n)}

  21: f42->f59, Arg_10: min([Arg_3, Arg_10]) {O(n)}

  22: f42->f69, Arg_0: Arg_0 {O(n)}

  22: f42->f69, Arg_1: Arg_1 {O(n)}

  22: f42->f69, Arg_2: 0 {O(1)}

  22: f42->f69, Arg_3: Arg_3 {O(n)}

  22: f42->f69, Arg_6: Arg_6 {O(n)}

  22: f42->f69, Arg_7: Arg_7 {O(n)}

  22: f42->f69, Arg_9: Arg_9 {O(n)}

  22: f42->f69, Arg_10: Arg_3 {O(n)}

  11: f59->f59, Arg_0: Arg_0 {O(n)}

  11: f59->f59, Arg_1: Arg_1 {O(n)}

  11: f59->f59, Arg_2: 0 {O(1)}

  11: f59->f59, Arg_3: Arg_3 {O(n)}

  11: f59->f59, Arg_6: Arg_6 {O(n)}

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

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

  11: f59->f59, Arg_10: min([Arg_3, Arg_10]) {O(n)}

  17: f59->f69, Arg_0: Arg_0 {O(n)}

  17: f59->f69, Arg_1: Arg_1 {O(n)}

  17: f59->f69, Arg_2: 0 {O(1)}

  17: f59->f69, Arg_3: Arg_3 {O(n)}

  17: f59->f69, Arg_6: Arg_6 {O(n)}

  17: f59->f69, Arg_7: Arg_7 {O(n)}

  17: f59->f69, Arg_9: Arg_9 {O(n)}

  17: f59->f69, Arg_10: min([Arg_3, Arg_10]) {O(n)}

  0: f69->f71, Arg_0: Arg_0 {O(n)}

  0: f69->f71, Arg_1: Arg_1 {O(n)}

  0: f69->f71, Arg_2: 0 {O(1)}

  0: f69->f71, Arg_3: Arg_3 {O(n)}

  0: f69->f71, Arg_6: Arg_6 {O(n)}

  0: f69->f71, Arg_7: Arg_7 {O(n)}

  0: f69->f71, Arg_9: Arg_9 {O(n)}

  0: f69->f71, Arg_10: min([Arg_3, Arg_10]) {O(n)}

  1: f69->f71, Arg_0: Arg_0 {O(n)}

  1: f69->f71, Arg_1: Arg_1 {O(n)}

  1: f69->f71, Arg_2: 0 {O(1)}

  1: f69->f71, Arg_3: Arg_3 {O(n)}

  1: f69->f71, Arg_6: Arg_6 {O(n)}

  1: f69->f71, Arg_7: Arg_7 {O(n)}

  1: f69->f71, Arg_9: Arg_9 {O(n)}

  1: f69->f71, Arg_10: min([Arg_3, Arg_10]) {O(n)}

  12: f71->f73, Arg_0: Arg_0 {O(n)}

  12: f71->f73, Arg_1: Arg_1 {O(n)}

  12: f71->f73, Arg_2: 0 {O(1)}

  12: f71->f73, Arg_3: Arg_3 {O(n)}

  12: f71->f73, Arg_6: Arg_6 {O(n)}

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

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

  12: f71->f73, Arg_10: min([Arg_3, Arg_10]) {O(n)}

  15: f71->f28, Arg_0: Arg_0 {O(n)}

  15: f71->f28, Arg_1: Arg_1 {O(n)}

  15: f71->f28, Arg_2: 0 {O(1)}

  15: f71->f28, Arg_3: 1+Arg_0 {O(n)}

  15: f71->f28, Arg_6: Arg_6 {O(n)}

  15: f71->f28, Arg_7: Arg_7 {O(n)}

  15: f71->f28, Arg_9: Arg_9 {O(n)}

  15: f71->f28, Arg_10: min([Arg_3, Arg_10]) {O(n)}

  16: f73->f28, Arg_0: Arg_0 {O(n)}

  16: f73->f28, Arg_1: Arg_1 {O(n)}

  16: f73->f28, Arg_2: 0 {O(1)}

  16: f73->f28, Arg_3: Arg_3 {O(n)}

  16: f73->f28, Arg_6: Arg_6 {O(n)}

  16: f73->f28, Arg_7: Arg_7 {O(n)}

  16: f73->f28, Arg_9: Arg_9 {O(n)}

  16: f73->f28, Arg_10: min([Arg_3, Arg_10]) {O(n)}

`Upper:

  2: f0->f12, Arg_0: Arg_0 {O(n)}

  2: f0->f12, Arg_1: Arg_1 {O(n)}

  2: f0->f12, Arg_2: Arg_2 {O(n)}

  2: f0->f12, Arg_3: Arg_3 {O(n)}

  2: f0->f12, Arg_4: Arg_4 {O(n)}

  2: f0->f12, Arg_5: Arg_5 {O(n)}

  2: f0->f12, Arg_6: Arg_6 {O(n)}

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

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

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

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

  3: f12->f15, Arg_0: Arg_0 {O(n)}

  3: f12->f15, Arg_1: Arg_1+2*max([0, 1+Arg_0-Arg_1]) {O(n)}

  3: f12->f15, Arg_2: 0 {O(1)}

  3: f12->f15, Arg_3: Arg_3+2*max([0, 1+Arg_0-Arg_3]) {O(n)}

  3: f12->f15, Arg_6: Arg_6 {O(n)}

  3: f12->f15, Arg_7: Arg_7 {O(n)}

  3: f12->f15, Arg_8: Arg_8 {O(n)}

  3: f12->f15, Arg_9: Arg_9 {O(n)}

  3: f12->f15, Arg_10: Arg_10 {O(n)}

  29: f12->f28, Arg_0: Arg_0 {O(n)}

  29: f12->f28, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  29: f12->f28, Arg_3: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])]) {O(n)}

  29: f12->f28, Arg_6: Arg_6 {O(n)}

  29: f12->f28, Arg_7: Arg_7 {O(n)}

  29: f12->f28, Arg_8: Arg_8 {O(n)}

  29: f12->f28, Arg_9: Arg_9 {O(n)}

  29: f12->f28, Arg_10: Arg_10 {O(n)}

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

  4: f15->f15, Arg_1: Arg_1+2*max([0, 1+Arg_0-Arg_1]) {O(n)}

  4: f15->f15, Arg_3: Arg_3+2*max([0, 1+Arg_0-Arg_3]) {O(n)}

  4: f15->f15, Arg_6: Arg_6 {O(n)}

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

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

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

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

  5: f15->f15, Arg_0: Arg_0 {O(n)}

  5: f15->f15, Arg_1: Arg_1+2*max([0, 1+Arg_0-Arg_1]) {O(n)}

  5: f15->f15, Arg_3: Arg_3+2*max([0, 1+Arg_0-Arg_3]) {O(n)}

  5: f15->f15, Arg_6: Arg_6 {O(n)}

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

  5: f15->f15, Arg_8: Arg_8 {O(n)}

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

  5: f15->f15, Arg_10: Arg_10 {O(n)}

  27: f15->f12, Arg_0: Arg_0 {O(n)}

  27: f15->f12, Arg_1: Arg_1+2*max([0, 1+Arg_0-Arg_1]) {O(n)}

  27: f15->f12, Arg_3: Arg_3+2*max([0, 1+Arg_0-Arg_3]) {O(n)}

  27: f15->f12, Arg_6: Arg_6 {O(n)}

  27: f15->f12, Arg_7: Arg_7 {O(n)}

  27: f15->f12, Arg_8: Arg_8 {O(n)}

  27: f15->f12, Arg_9: Arg_9 {O(n)}

  27: f15->f12, Arg_10: Arg_10 {O(n)}

  28: f15->f12, Arg_0: Arg_0 {O(n)}

  28: f15->f12, Arg_1: Arg_1+2*max([0, 1+Arg_0-Arg_1]) {O(n)}

  28: f15->f12, Arg_2: 0 {O(1)}

  28: f15->f12, Arg_3: Arg_3+2*max([0, 1+Arg_0-Arg_3]) {O(n)}

  28: f15->f12, Arg_6: Arg_6 {O(n)}

  28: f15->f12, Arg_7: Arg_7 {O(n)}

  28: f15->f12, Arg_8: Arg_8 {O(n)}

  28: f15->f12, Arg_9: Arg_9 {O(n)}

  28: f15->f12, Arg_10: Arg_10 {O(n)}

  6: f28->f30, Arg_0: Arg_0 {O(n)}

  6: f28->f30, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  6: f28->f30, Arg_3: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  6: f28->f30, Arg_6: Arg_6 {O(n)}

  6: f28->f30, Arg_7: Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  6: f28->f30, Arg_9: Arg_9 {O(n)}

  6: f28->f30, Arg_10: max([Arg_10, max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])]) {O(n)}

  25: f28->f82, Arg_0: Arg_0 {O(n)}

  25: f28->f82, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  25: f28->f82, Arg_3: max([Arg_3, max([1+Arg_0, Arg_3+2*max([0, 1+Arg_0-Arg_3])])]) {O(n)}

  25: f28->f82, Arg_6: Arg_6 {O(n)}

  25: f28->f82, Arg_7: max([Arg_7, Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])])]) {O(n)}

  25: f28->f82, Arg_9: Arg_9 {O(n)}

  25: f28->f82, Arg_10: max([Arg_10, max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])]) {O(n)}

  24: f30->f42, Arg_0: Arg_0 {O(n)}

  24: f30->f42, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  24: f30->f42, Arg_2: 0 {O(1)}

  24: f30->f42, Arg_3: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  24: f30->f42, Arg_6: Arg_6 {O(n)}

  24: f30->f42, Arg_7: Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  24: f30->f42, Arg_9: Arg_9 {O(n)}

  24: f30->f42, Arg_10: max([Arg_10, max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])]) {O(n)}

  20: f42->f59, Arg_0: Arg_0 {O(n)}

  20: f42->f59, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  20: f42->f59, Arg_2: 0 {O(1)}

  20: f42->f59, Arg_3: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  20: f42->f59, Arg_6: Arg_6 {O(n)}

  20: f42->f59, Arg_7: Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  20: f42->f59, Arg_9: Arg_9 {O(n)}

  20: f42->f59, Arg_10: max([Arg_10, max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])]) {O(n)}

  21: f42->f59, Arg_0: Arg_0 {O(n)}

  21: f42->f59, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  21: f42->f59, Arg_2: 0 {O(1)}

  21: f42->f59, Arg_3: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  21: f42->f59, Arg_6: Arg_6 {O(n)}

  21: f42->f59, Arg_7: Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  21: f42->f59, Arg_9: Arg_9 {O(n)}

  21: f42->f59, Arg_10: max([Arg_10, max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])]) {O(n)}

  22: f42->f69, Arg_0: Arg_0 {O(n)}

  22: f42->f69, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  22: f42->f69, Arg_2: 0 {O(1)}

  22: f42->f69, Arg_3: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  22: f42->f69, Arg_6: Arg_6 {O(n)}

  22: f42->f69, Arg_7: Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  22: f42->f69, Arg_9: Arg_9 {O(n)}

  22: f42->f69, Arg_10: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  11: f59->f59, Arg_0: Arg_0 {O(n)}

  11: f59->f59, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  11: f59->f59, Arg_2: 0 {O(1)}

  11: f59->f59, Arg_3: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  11: f59->f59, Arg_6: Arg_6 {O(n)}

  11: f59->f59, Arg_7: Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

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

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

  17: f59->f69, Arg_0: Arg_0 {O(n)}

  17: f59->f69, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  17: f59->f69, Arg_2: 0 {O(1)}

  17: f59->f69, Arg_3: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  17: f59->f69, Arg_6: Arg_6 {O(n)}

  17: f59->f69, Arg_7: Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  17: f59->f69, Arg_9: Arg_9 {O(n)}

  17: f59->f69, Arg_10: max([Arg_10, max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])]) {O(n)}

  0: f69->f71, Arg_0: Arg_0 {O(n)}

  0: f69->f71, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  0: f69->f71, Arg_2: 0 {O(1)}

  0: f69->f71, Arg_3: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  0: f69->f71, Arg_6: Arg_6 {O(n)}

  0: f69->f71, Arg_7: Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  0: f69->f71, Arg_9: Arg_9 {O(n)}

  0: f69->f71, Arg_10: max([Arg_10, max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])]) {O(n)}

  1: f69->f71, Arg_0: Arg_0 {O(n)}

  1: f69->f71, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  1: f69->f71, Arg_2: 0 {O(1)}

  1: f69->f71, Arg_3: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  1: f69->f71, Arg_6: Arg_6 {O(n)}

  1: f69->f71, Arg_7: Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  1: f69->f71, Arg_9: Arg_9 {O(n)}

  1: f69->f71, Arg_10: max([Arg_10, max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])]) {O(n)}

  12: f71->f73, Arg_0: Arg_0 {O(n)}

  12: f71->f73, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  12: f71->f73, Arg_2: 0 {O(1)}

  12: f71->f73, Arg_3: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  12: f71->f73, Arg_6: Arg_6 {O(n)}

  12: f71->f73, Arg_7: Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

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

  12: f71->f73, Arg_10: max([Arg_10, max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])]) {O(n)}

  15: f71->f28, Arg_0: Arg_0 {O(n)}

  15: f71->f28, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  15: f71->f28, Arg_2: 0 {O(1)}

  15: f71->f28, Arg_3: 1+Arg_0 {O(n)}

  15: f71->f28, Arg_6: Arg_6 {O(n)}

  15: f71->f28, Arg_7: Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  15: f71->f28, Arg_9: Arg_9 {O(n)}

  15: f71->f28, Arg_10: max([Arg_10, max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])]) {O(n)}

  16: f73->f28, Arg_0: Arg_0 {O(n)}

  16: f73->f28, Arg_1: max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])]) {O(n)}

  16: f73->f28, Arg_2: 0 {O(1)}

  16: f73->f28, Arg_3: max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])]) {O(n)}

  16: f73->f28, Arg_6: Arg_6 {O(n)}

  16: f73->f28, Arg_7: Arg_7+max([0, -(Arg_7)+max([Arg_1, Arg_1+2*max([0, 1+Arg_0-Arg_1])])]) {O(n)}

  16: f73->f28, Arg_9: Arg_9 {O(n)}

  16: f73->f28, Arg_10: max([Arg_10, max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])+max([0, 3*Arg_0+max([-3*Arg_3, -3*max([Arg_3, Arg_3+2*max([0, 1+Arg_0-Arg_3])])])])]) {O(n)}


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

(2)
BOUNDS(1, nat(max(3 * Arg_1 + nat(6 + 6 * Arg_0 + -6 * Arg_1), 3 * Arg_1) + max(min(-3 * Arg_3 + min(-6 + -6 * Arg_0 + 6 * Arg_3, 0), -3 * Arg_3), -3 * Arg_3)) + nat(1 + 2 * Arg_0 + max(min(-2 * Arg_3 + min(-4 + -4 * Arg_0 + 4 * Arg_3, 0), -2 * Arg_3), -2 * Arg_3)) + nat(2 + 2 * Arg_0 + -2 * Arg_1) + nat(-1 * Arg_7 + max(Arg_1 + nat(2 + 2 * Arg_0 + -2 * Arg_1), Arg_1)) + nat(2 * Arg_0 + max(min(-2 * Arg_3 + min(-4 + -4 * Arg_0 + 4 * Arg_3, 0), -2 * Arg_3), -2 * Arg_3)) + max(1, 7 + 6 * Arg_0 + -6 * Arg_3) + nat(-3 * Arg_3 + max(3 * Arg_1 + nat(6 + 6 * Arg_0 + -6 * Arg_1), 3 * Arg_1)) + max(2, 4 + 2 * Arg_0 + -2 * Arg_1) + nat(3 * Arg_0 + max(-3 * Arg_3, min(-3 * Arg_3 + min(-6 + -6 * Arg_0 + 6 * Arg_3, 0), -3 * Arg_3))))

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

(3) Loat Proof (FINISHED)


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



Initial linear ITS problem

   Start location: f0

      0: f69 -> f71 : [ 0>=1+free ], cost: 1

      1: f69 -> f71 : [], cost: 1

      2: f0 -> f12 : [], cost: 1

      3: f12 -> f15 : C'=0, [ A>=B ], cost: 1

     29: f12 -> f28 : [ B>=1+A ], cost: 1

      4: f15 -> f15 : D'=1+D, E'=free_1, F'=free_1, [ C>=free_1 && A>=D ], cost: 1

      5: f15 -> f15 : C'=free_2, D'=1+D, E'=free_2, F'=free_2, [ free_2>=1+C && A>=D ], cost: 1

     26: f15 -> f12 : B'=1+B, [ 0>=1+C && D>=1+A ], cost: 1

     27: f15 -> f12 : B'=1+B, [ C>=1 && D>=1+A ], cost: 1

     28: f15 -> f12 : B'=1+B, C'=0, [ D>=1+A && C==0 ], cost: 1

      6: f28 -> f30 : [ A>=D ], cost: 1

     25: f28 -> f82 : [ D>=1+A ], cost: 1

      7: f30 -> f33 : G'=free_3, [ D>=1+B ], cost: 1

     24: f30 -> f42 : C'=0, [ B>=D ], cost: 1

      8: f33 -> f33 : G'=free_4, H'=1+H, [ B>=1+H ], cost: 1

     23: f33 -> f30 : B'=1+B, [ H>=B ], cost: 1

      9: f42 -> f45 : G'=free_5, [ A>=B ], cost: 1

     20: f42 -> f59 : [ B>=1+A && K>=1+D ], cost: 1

     21: f42 -> f59 : [ B>=1+A && D>=1+K ], cost: 1

     22: f42 -> f69 : K'=D, [ B>=1+A && D==K ], cost: 1

     10: f45 -> f45 : G'=free_6, H'=1+H, [ D>=1+H ], cost: 1

     18: f45 -> f42 : B'=1+B, Q'=free_10, J'=free_11, [ C>=1+free_10 && H>=D ], cost: 1

     19: f45 -> f42 : B'=1+B, C'=free_12, Q'=free_12, J'=free_13, K'=B, [ free_12>=C && H>=D ], cost: 1

     11: f59 -> f59 : H'=1+H, Q'=free_7, [ A>=H ], cost: 1

     17: f59 -> f69 : [ H>=1+A ], cost: 1

     12: f71 -> f73 : Q'=free_8, [ A>=1+D ], cost: 1

     13: f71 -> f73 : Q'=free_9, [ D>=1+A ], cost: 1

     15: f71 -> f28 : D'=1+A, [ A==D ], cost: 1

     14: f73 -> f73 : B'=1+B, [ A>=B ], cost: 1

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



Removed unreachable and leaf rules:

   Start location: f0

      0: f69 -> f71 : [ 0>=1+free ], cost: 1

      1: f69 -> f71 : [], cost: 1

      2: f0 -> f12 : [], cost: 1

      3: f12 -> f15 : C'=0, [ A>=B ], cost: 1

     29: f12 -> f28 : [ B>=1+A ], cost: 1

      4: f15 -> f15 : D'=1+D, E'=free_1, F'=free_1, [ C>=free_1 && A>=D ], cost: 1

      5: f15 -> f15 : C'=free_2, D'=1+D, E'=free_2, F'=free_2, [ free_2>=1+C && A>=D ], cost: 1

     26: f15 -> f12 : B'=1+B, [ 0>=1+C && D>=1+A ], cost: 1

     27: f15 -> f12 : B'=1+B, [ C>=1 && D>=1+A ], cost: 1

     28: f15 -> f12 : B'=1+B, C'=0, [ D>=1+A && C==0 ], cost: 1

      6: f28 -> f30 : [ A>=D ], cost: 1

      7: f30 -> f33 : G'=free_3, [ D>=1+B ], cost: 1

     24: f30 -> f42 : C'=0, [ B>=D ], cost: 1

      8: f33 -> f33 : G'=free_4, H'=1+H, [ B>=1+H ], cost: 1

     23: f33 -> f30 : B'=1+B, [ H>=B ], cost: 1

      9: f42 -> f45 : G'=free_5, [ A>=B ], cost: 1

     20: f42 -> f59 : [ B>=1+A && K>=1+D ], cost: 1

     21: f42 -> f59 : [ B>=1+A && D>=1+K ], cost: 1

     22: f42 -> f69 : K'=D, [ B>=1+A && D==K ], cost: 1

     10: f45 -> f45 : G'=free_6, H'=1+H, [ D>=1+H ], cost: 1

     18: f45 -> f42 : B'=1+B, Q'=free_10, J'=free_11, [ C>=1+free_10 && H>=D ], cost: 1

     19: f45 -> f42 : B'=1+B, C'=free_12, Q'=free_12, J'=free_13, K'=B, [ free_12>=C && H>=D ], cost: 1

     11: f59 -> f59 : H'=1+H, Q'=free_7, [ A>=H ], cost: 1

     17: f59 -> f69 : [ H>=1+A ], cost: 1

     12: f71 -> f73 : Q'=free_8, [ A>=1+D ], cost: 1

     13: f71 -> f73 : Q'=free_9, [ D>=1+A ], cost: 1

     15: f71 -> f28 : D'=1+A, [ A==D ], cost: 1

     14: f73 -> f73 : B'=1+B, [ A>=B ], cost: 1

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



Simplified all rules, resulting in:

   Start location: f0

      1: f69 -> f71 : [], cost: 1

      2: f0 -> f12 : [], cost: 1

      3: f12 -> f15 : C'=0, [ A>=B ], cost: 1

     29: f12 -> f28 : [ B>=1+A ], cost: 1

      4: f15 -> f15 : D'=1+D, E'=free_1, F'=free_1, [ C>=free_1 && A>=D ], cost: 1

      5: f15 -> f15 : C'=free_2, D'=1+D, E'=free_2, F'=free_2, [ free_2>=1+C && A>=D ], cost: 1

     26: f15 -> f12 : B'=1+B, [ 0>=1+C && D>=1+A ], cost: 1

     27: f15 -> f12 : B'=1+B, [ C>=1 && D>=1+A ], cost: 1

     28: f15 -> f12 : B'=1+B, C'=0, [ D>=1+A && C==0 ], cost: 1

      6: f28 -> f30 : [ A>=D ], cost: 1

      7: f30 -> f33 : G'=free_3, [ D>=1+B ], cost: 1

     24: f30 -> f42 : C'=0, [ B>=D ], cost: 1

      8: f33 -> f33 : G'=free_4, H'=1+H, [ B>=1+H ], cost: 1

     23: f33 -> f30 : B'=1+B, [ H>=B ], cost: 1

      9: f42 -> f45 : G'=free_5, [ A>=B ], cost: 1

     20: f42 -> f59 : [ B>=1+A && K>=1+D ], cost: 1

     21: f42 -> f59 : [ B>=1+A && D>=1+K ], cost: 1

     22: f42 -> f69 : K'=D, [ B>=1+A && D==K ], cost: 1

     10: f45 -> f45 : G'=free_6, H'=1+H, [ D>=1+H ], cost: 1

     18: f45 -> f42 : B'=1+B, Q'=free_10, J'=free_11, [ C>=1+free_10 && H>=D ], cost: 1

     19: f45 -> f42 : B'=1+B, C'=free_12, Q'=free_12, J'=free_13, K'=B, [ free_12>=C && H>=D ], cost: 1

     11: f59 -> f59 : H'=1+H, Q'=free_7, [ A>=H ], cost: 1

     17: f59 -> f69 : [ H>=1+A ], cost: 1

     12: f71 -> f73 : Q'=free_8, [ A>=1+D ], cost: 1

     13: f71 -> f73 : Q'=free_9, [ D>=1+A ], cost: 1

     15: f71 -> f28 : D'=1+A, [ A==D ], cost: 1

     14: f73 -> f73 : B'=1+B, [ A>=B ], cost: 1

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



### Simplification by acceleration and chaining ###



Accelerating simple loops of location 3.

   Accelerating the following rules:

      4: f15 -> f15 : D'=1+D, E'=free_1, F'=free_1, [ C>=free_1 && A>=D ], cost: 1

      5: f15 -> f15 : C'=free_2, D'=1+D, E'=free_2, F'=free_2, [ free_2>=1+C && A>=D ], cost: 1



   Accelerated rule 4 with metering function 1-D+A, yielding the new rule 30.

      During metering: Instantiating temporary variables by {free_2==1+C}

   Accelerated rule 5 with metering function 1-D+A, yielding the new rule 31.

   Removing the simple loops: 4 5.



Accelerating simple loops of location 6.

   Accelerating the following rules:

      8: f33 -> f33 : G'=free_4, H'=1+H, [ B>=1+H ], cost: 1



   Accelerated rule 8 with metering function -H+B, yielding the new rule 32.

   Removing the simple loops: 8.



Accelerating simple loops of location 8.

   Accelerating the following rules:

     10: f45 -> f45 : G'=free_6, H'=1+H, [ D>=1+H ], cost: 1



   Accelerated rule 10 with metering function D-H, yielding the new rule 33.

   Removing the simple loops: 10.



Accelerating simple loops of location 9.

   Accelerating the following rules:

     11: f59 -> f59 : H'=1+H, Q'=free_7, [ A>=H ], cost: 1



   Accelerated rule 11 with metering function 1+A-H, yielding the new rule 34.

   Removing the simple loops: 11.



Accelerating simple loops of location 11.

   Accelerating the following rules:

     14: f73 -> f73 : B'=1+B, [ A>=B ], cost: 1



   Accelerated rule 14 with metering function 1+A-B, yielding the new rule 35.

   Removing the simple loops: 14.



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

   Start location: f0

      1: f69 -> f71 : [], cost: 1

      2: f0 -> f12 : [], cost: 1

      3: f12 -> f15 : C'=0, [ A>=B ], cost: 1

     29: f12 -> f28 : [ B>=1+A ], cost: 1

     26: f15 -> f12 : B'=1+B, [ 0>=1+C && D>=1+A ], cost: 1

     27: f15 -> f12 : B'=1+B, [ C>=1 && D>=1+A ], cost: 1

     28: f15 -> f12 : B'=1+B, C'=0, [ D>=1+A && C==0 ], cost: 1

     30: f15 -> f15 : D'=1+A, E'=free_1, F'=free_1, [ C>=free_1 && A>=D ], cost: 1-D+A

     31: f15 -> f15 : C'=1+C-D+A, D'=1+A, E'=1+C-D+A, F'=1+C-D+A, [ A>=D ], cost: 1-D+A

      6: f28 -> f30 : [ A>=D ], cost: 1

      7: f30 -> f33 : G'=free_3, [ D>=1+B ], cost: 1

     24: f30 -> f42 : C'=0, [ B>=D ], cost: 1

     23: f33 -> f30 : B'=1+B, [ H>=B ], cost: 1

     32: f33 -> f33 : G'=free_4, H'=B, [ B>=1+H ], cost: -H+B

      9: f42 -> f45 : G'=free_5, [ A>=B ], cost: 1

     20: f42 -> f59 : [ B>=1+A && K>=1+D ], cost: 1

     21: f42 -> f59 : [ B>=1+A && D>=1+K ], cost: 1

     22: f42 -> f69 : K'=D, [ B>=1+A && D==K ], cost: 1

     18: f45 -> f42 : B'=1+B, Q'=free_10, J'=free_11, [ C>=1+free_10 && H>=D ], cost: 1

     19: f45 -> f42 : B'=1+B, C'=free_12, Q'=free_12, J'=free_13, K'=B, [ free_12>=C && H>=D ], cost: 1

     33: f45 -> f45 : G'=free_6, H'=D, [ D>=1+H ], cost: D-H

     17: f59 -> f69 : [ H>=1+A ], cost: 1

     34: f59 -> f59 : H'=1+A, Q'=free_7, [ A>=H ], cost: 1+A-H

     12: f71 -> f73 : Q'=free_8, [ A>=1+D ], cost: 1

     13: f71 -> f73 : Q'=free_9, [ D>=1+A ], cost: 1

     15: f71 -> f28 : D'=1+A, [ A==D ], cost: 1

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1

     35: f73 -> f73 : B'=1+A, [ A>=B ], cost: 1+A-B



Chained accelerated rules (with incoming rules):

   Start location: f0

      1: f69 -> f71 : [], cost: 1

      2: f0 -> f12 : [], cost: 1

      3: f12 -> f15 : C'=0, [ A>=B ], cost: 1

     29: f12 -> f28 : [ B>=1+A ], cost: 1

     36: f12 -> f15 : C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D ], cost: 2-D+A

     37: f12 -> f15 : C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D ], cost: 2-D+A

     26: f15 -> f12 : B'=1+B, [ 0>=1+C && D>=1+A ], cost: 1

     27: f15 -> f12 : B'=1+B, [ C>=1 && D>=1+A ], cost: 1

     28: f15 -> f12 : B'=1+B, C'=0, [ D>=1+A && C==0 ], cost: 1

      6: f28 -> f30 : [ A>=D ], cost: 1

      7: f30 -> f33 : G'=free_3, [ D>=1+B ], cost: 1

     24: f30 -> f42 : C'=0, [ B>=D ], cost: 1

     38: f30 -> f33 : G'=free_4, H'=B, [ D>=1+B && B>=1+H ], cost: 1-H+B

     23: f33 -> f30 : B'=1+B, [ H>=B ], cost: 1

      9: f42 -> f45 : G'=free_5, [ A>=B ], cost: 1

     20: f42 -> f59 : [ B>=1+A && K>=1+D ], cost: 1

     21: f42 -> f59 : [ B>=1+A && D>=1+K ], cost: 1

     22: f42 -> f69 : K'=D, [ B>=1+A && D==K ], cost: 1

     39: f42 -> f45 : G'=free_6, H'=D, [ A>=B && D>=1+H ], cost: 1+D-H

     40: f42 -> f59 : H'=1+A, Q'=free_7, [ B>=1+A && K>=1+D && A>=H ], cost: 2+A-H

     41: f42 -> f59 : H'=1+A, Q'=free_7, [ B>=1+A && D>=1+K && A>=H ], cost: 2+A-H

     18: f45 -> f42 : B'=1+B, Q'=free_10, J'=free_11, [ C>=1+free_10 && H>=D ], cost: 1

     19: f45 -> f42 : B'=1+B, C'=free_12, Q'=free_12, J'=free_13, K'=B, [ free_12>=C && H>=D ], cost: 1

     17: f59 -> f69 : [ H>=1+A ], cost: 1

     12: f71 -> f73 : Q'=free_8, [ A>=1+D ], cost: 1

     13: f71 -> f73 : Q'=free_9, [ D>=1+A ], cost: 1

     15: f71 -> f28 : D'=1+A, [ A==D ], cost: 1

     42: f71 -> f73 : B'=1+A, Q'=free_8, [ A>=1+D && A>=B ], cost: 2+A-B

     43: f71 -> f73 : B'=1+A, Q'=free_9, [ D>=1+A && A>=B ], cost: 2+A-B

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



Eliminated locations (on tree-shaped paths):

   Start location: f0

     59: f69 -> f73 : Q'=free_8, [ A>=1+D ], cost: 2

     60: f69 -> f73 : Q'=free_9, [ D>=1+A ], cost: 2

     61: f69 -> f28 : D'=1+A, [ A==D ], cost: 2

     62: f69 -> f73 : B'=1+A, Q'=free_8, [ A>=1+D && A>=B ], cost: 3+A-B

     63: f69 -> f73 : B'=1+A, Q'=free_9, [ D>=1+A && A>=B ], cost: 3+A-B

      2: f0 -> f12 : [], cost: 1

     29: f12 -> f28 : [ B>=1+A ], cost: 1

     44: f12 -> f12 : B'=1+B, C'=0, [ A>=B && D>=1+A ], cost: 2

     45: f12 -> f12 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     46: f12 -> f12 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D ], cost: 3-D+A

     47: f12 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 2-D+A

     48: f12 -> [18] : [ A>=B && A>=D ], cost: 2-D+A

      6: f28 -> f30 : [ A>=D ], cost: 1

     24: f30 -> f42 : C'=0, [ B>=D ], cost: 1

     49: f30 -> f30 : B'=1+B, G'=free_3, [ D>=1+B && H>=B ], cost: 2

     50: f30 -> f30 : B'=1+B, G'=free_4, H'=B, [ D>=1+B && B>=1+H ], cost: 2-H+B

     22: f42 -> f69 : K'=D, [ B>=1+A && D==K ], cost: 1

     51: f42 -> f42 : B'=1+B, G'=free_5, Q'=free_10, J'=free_11, [ A>=B && C>=1+free_10 && H>=D ], cost: 2

     52: f42 -> f42 : B'=1+B, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=B, [ A>=B && free_12>=C && H>=D ], cost: 2

     53: f42 -> f42 : B'=1+B, G'=free_6, H'=D, Q'=free_10, J'=free_11, [ A>=B && D>=1+H && C>=1+free_10 ], cost: 2+D-H

     54: f42 -> f42 : B'=1+B, C'=free_12, G'=free_6, H'=D, Q'=free_12, J'=free_13, K'=B, [ A>=B && D>=1+H && free_12>=C ], cost: 2+D-H

     55: f42 -> f69 : [ B>=1+A && K>=1+D && H>=1+A ], cost: 2

     56: f42 -> f69 : [ B>=1+A && D>=1+K && H>=1+A ], cost: 2

     57: f42 -> f69 : H'=1+A, Q'=free_7, [ B>=1+A && K>=1+D && A>=H ], cost: 3+A-H

     58: f42 -> f69 : H'=1+A, Q'=free_7, [ B>=1+A && D>=1+K && A>=H ], cost: 3+A-H

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



Accelerating simple loops of location 2.

   Accelerating the following rules:

     44: f12 -> f12 : B'=1+B, C'=0, [ A>=B && D>=1+A ], cost: 2

     45: f12 -> f12 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     46: f12 -> f12 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D ], cost: 3-D+A



   Accelerated rule 44 with metering function 1+A-B, yielding the new rule 64.

   Found no metering function for rule 45.

   Found no metering function for rule 46.

   Removing the simple loops: 44.



Accelerating simple loops of location 5.

   Accelerating the following rules:

     49: f30 -> f30 : B'=1+B, G'=free_3, [ D>=1+B && H>=B ], cost: 2

     50: f30 -> f30 : B'=1+B, G'=free_4, H'=B, [ D>=1+B && B>=1+H ], cost: 2-H+B



   Accelerated rule 49 with backward acceleration, yielding the new rule 65.

   Accelerated rule 49 with backward acceleration, yielding the new rule 66.

   Accelerated rule 50 with metering function D-B, yielding the new rule 67.

   Removing the simple loops: 49 50.



Accelerating simple loops of location 7.

   Accelerating the following rules:

     51: f42 -> f42 : B'=1+B, G'=free_5, Q'=free_10, J'=free_11, [ A>=B && C>=1+free_10 && H>=D ], cost: 2

     52: f42 -> f42 : B'=1+B, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=B, [ A>=B && free_12>=C && H>=D ], cost: 2

     53: f42 -> f42 : B'=1+B, G'=free_6, H'=D, Q'=free_10, J'=free_11, [ A>=B && D>=1+H && C>=1+free_10 ], cost: 2+D-H

     54: f42 -> f42 : B'=1+B, C'=free_12, G'=free_6, H'=D, Q'=free_12, J'=free_13, K'=B, [ A>=B && D>=1+H && free_12>=C ], cost: 2+D-H



   Accelerated rule 51 with metering function 1+A-B, yielding the new rule 68.

   Accelerated rule 52 with metering function 1+A-B, yielding the new rule 69.

   Found no metering function for rule 53.

   Found no metering function for rule 54.

   Removing the simple loops: 51 52.



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

   Start location: f0

     59: f69 -> f73 : Q'=free_8, [ A>=1+D ], cost: 2

     60: f69 -> f73 : Q'=free_9, [ D>=1+A ], cost: 2

     61: f69 -> f28 : D'=1+A, [ A==D ], cost: 2

     62: f69 -> f73 : B'=1+A, Q'=free_8, [ A>=1+D && A>=B ], cost: 3+A-B

     63: f69 -> f73 : B'=1+A, Q'=free_9, [ D>=1+A && A>=B ], cost: 3+A-B

      2: f0 -> f12 : [], cost: 1

     29: f12 -> f28 : [ B>=1+A ], cost: 1

     45: f12 -> f12 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     46: f12 -> f12 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D ], cost: 3-D+A

     47: f12 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 2-D+A

     48: f12 -> [18] : [ A>=B && A>=D ], cost: 2-D+A

     64: f12 -> f12 : B'=1+A, C'=0, [ A>=B && D>=1+A ], cost: 2+2*A-2*B

      6: f28 -> f30 : [ A>=D ], cost: 1

     24: f30 -> f42 : C'=0, [ B>=D ], cost: 1

     65: f30 -> f30 : B'=D, G'=free_3, [ D>=1+B && H>=B && H>=-1+D ], cost: 2*D-2*B

     66: f30 -> f30 : B'=1+H, G'=free_3, [ D>=1+B && H>=B && D>=1+H ], cost: 2+2*H-2*B

     67: f30 -> f30 : B'=D, G'=free_4, H'=-1+D, [ D>=1+B && B>=1+H ], cost: 3*D-3*B

     22: f42 -> f69 : K'=D, [ B>=1+A && D==K ], cost: 1

     53: f42 -> f42 : B'=1+B, G'=free_6, H'=D, Q'=free_10, J'=free_11, [ A>=B && D>=1+H && C>=1+free_10 ], cost: 2+D-H

     54: f42 -> f42 : B'=1+B, C'=free_12, G'=free_6, H'=D, Q'=free_12, J'=free_13, K'=B, [ A>=B && D>=1+H && free_12>=C ], cost: 2+D-H

     55: f42 -> f69 : [ B>=1+A && K>=1+D && H>=1+A ], cost: 2

     56: f42 -> f69 : [ B>=1+A && D>=1+K && H>=1+A ], cost: 2

     57: f42 -> f69 : H'=1+A, Q'=free_7, [ B>=1+A && K>=1+D && A>=H ], cost: 3+A-H

     58: f42 -> f69 : H'=1+A, Q'=free_7, [ B>=1+A && D>=1+K && A>=H ], cost: 3+A-H

     68: f42 -> f42 : B'=1+A, G'=free_5, Q'=free_10, J'=free_11, [ A>=B && C>=1+free_10 && H>=D ], cost: 2+2*A-2*B

     69: f42 -> f42 : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ A>=B && free_12>=C && H>=D ], cost: 2+2*A-2*B

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



Chained accelerated rules (with incoming rules):

   Start location: f0

     59: f69 -> f73 : Q'=free_8, [ A>=1+D ], cost: 2

     60: f69 -> f73 : Q'=free_9, [ D>=1+A ], cost: 2

     61: f69 -> f28 : D'=1+A, [ A==D ], cost: 2

     62: f69 -> f73 : B'=1+A, Q'=free_8, [ A>=1+D && A>=B ], cost: 3+A-B

     63: f69 -> f73 : B'=1+A, Q'=free_9, [ D>=1+A && A>=B ], cost: 3+A-B

      2: f0 -> f12 : [], cost: 1

     70: f0 -> f12 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     71: f0 -> f12 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D ], cost: 4-D+A

     72: f0 -> f12 : B'=1+A, C'=0, [ A>=B && D>=1+A ], cost: 3+2*A-2*B

     29: f12 -> f28 : [ B>=1+A ], cost: 1

     47: f12 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 2-D+A

     48: f12 -> [18] : [ A>=B && A>=D ], cost: 2-D+A

      6: f28 -> f30 : [ A>=D ], cost: 1

     73: f28 -> f30 : B'=D, G'=free_3, [ A>=D && D>=1+B && H>=B && H>=-1+D ], cost: 1+2*D-2*B

     74: f28 -> f30 : B'=1+H, G'=free_3, [ A>=D && D>=1+B && H>=B && D>=1+H ], cost: 3+2*H-2*B

     75: f28 -> f30 : B'=D, G'=free_4, H'=-1+D, [ A>=D && D>=1+B && B>=1+H ], cost: 1+3*D-3*B

     24: f30 -> f42 : C'=0, [ B>=D ], cost: 1

     76: f30 -> f42 : B'=1+B, C'=0, G'=free_6, H'=D, Q'=free_10, J'=free_11, [ B>=D && A>=B && D>=1+H && 0>=1+free_10 ], cost: 3+D-H

     77: f30 -> f42 : B'=1+B, C'=free_12, G'=free_6, H'=D, Q'=free_12, J'=free_13, K'=B, [ B>=D && A>=B && D>=1+H && free_12>=0 ], cost: 3+D-H

     78: f30 -> f42 : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D ], cost: 3+2*A-2*B

     79: f30 -> f42 : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D ], cost: 3+2*A-2*B

     22: f42 -> f69 : K'=D, [ B>=1+A && D==K ], cost: 1

     55: f42 -> f69 : [ B>=1+A && K>=1+D && H>=1+A ], cost: 2

     56: f42 -> f69 : [ B>=1+A && D>=1+K && H>=1+A ], cost: 2

     57: f42 -> f69 : H'=1+A, Q'=free_7, [ B>=1+A && K>=1+D && A>=H ], cost: 3+A-H

     58: f42 -> f69 : H'=1+A, Q'=free_7, [ B>=1+A && D>=1+K && A>=H ], cost: 3+A-H

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



Eliminated locations (on tree-shaped paths):

   Start location: f0

     80: f0 -> f28 : [ B>=1+A ], cost: 2

     81: f0 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     82: f0 -> [18] : [ A>=B && A>=D ], cost: 3-D+A

     83: f0 -> f28 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

     84: f0 -> f28 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

     85: f0 -> f28 : B'=1+A, C'=0, [ A>=B && D>=1+A ], cost: 4+2*A-2*B

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

     88: f0 -> [22] : [ A>=B && D>=1+A ], cost: 3+2*A-2*B

     89: f28 -> f42 : C'=0, [ A>=D && B>=D ], cost: 2

     90: f28 -> f42 : B'=1+B, C'=0, G'=free_6, H'=D, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && D>=1+H && 0>=1+free_10 ], cost: 4+D-H

     91: f28 -> f42 : B'=1+B, C'=free_12, G'=free_6, H'=D, Q'=free_12, J'=free_13, K'=B, [ A>=D && B>=D && A>=B && D>=1+H && free_12>=0 ], cost: 4+D-H

     92: f28 -> f42 : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

     93: f28 -> f42 : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ A>=D && B>=D && A>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

     94: f28 -> f42 : B'=D, C'=0, G'=free_3, [ A>=D && D>=1+B && H>=B && H>=-1+D ], cost: 2+2*D-2*B

     95: f28 -> f42 : B'=1+D, C'=0, G'=free_6, H'=D, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && H>=-1+D && D>=1+H && 0>=1+free_10 ], cost: 4+3*D-H-2*B

     96: f28 -> f42 : B'=1+D, C'=free_12, G'=free_6, H'=D, Q'=free_12, J'=free_13, K'=D, [ A>=D && D>=1+B && H>=B && H>=-1+D && D>=1+H && free_12>=0 ], cost: 4+3*D-H-2*B

     97: f28 -> f42 : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

     98: f28 -> f42 : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ A>=D && D>=1+B && H>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

     99: f28 -> f42 : B'=1+H, C'=0, G'=free_3, [ A>=D && D>=1+B && H>=B && D>=1+H && 1+H>=D ], cost: 4+2*H-2*B

    100: f28 -> f42 : B'=2+H, C'=0, G'=free_6, H'=D, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && D>=1+H && 1+H>=D && A>=1+H && 0>=1+free_10 ], cost: 6+D+H-2*B

    101: f28 -> f42 : B'=2+H, C'=free_12, G'=free_6, H'=D, Q'=free_12, J'=free_13, K'=1+H, [ A>=D && D>=1+B && H>=B && D>=1+H && 1+H>=D && A>=1+H && free_12>=0 ], cost: 6+D+H-2*B

    102: f28 -> f42 : B'=D, C'=0, G'=free_4, H'=-1+D, [ A>=D && D>=1+B && B>=1+H ], cost: 2+3*D-3*B

    103: f28 -> f42 : B'=1+D, C'=0, G'=free_6, H'=D, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && B>=1+H && 0>=1+free_10 ], cost: 5+3*D-3*B

    104: f28 -> f42 : B'=1+D, C'=free_12, G'=free_6, H'=D, Q'=free_12, J'=free_13, K'=D, [ A>=D && D>=1+B && B>=1+H && free_12>=0 ], cost: 5+3*D-3*B

    105: f28 -> [23] : [ A>=D && D>=1+B && H>=B && D>=1+H ], cost: 3+2*H-2*B

    106: f28 -> [23] : [ A>=D && D>=1+B && B>=1+H ], cost: 1+3*D-3*B

    107: f42 -> f73 : Q'=free_8, K'=D, [ B>=1+A && D==K && A>=1+D ], cost: 3

    108: f42 -> f73 : Q'=free_9, K'=D, [ B>=1+A && D==K && D>=1+A ], cost: 3

    109: f42 -> f28 : D'=1+A, K'=D, [ B>=1+A && D==K && A==D ], cost: 3

    110: f42 -> f73 : Q'=free_8, [ B>=1+A && K>=1+D && H>=1+A && A>=1+D ], cost: 4

    111: f42 -> f73 : Q'=free_9, [ B>=1+A && K>=1+D && H>=1+A && D>=1+A ], cost: 4

    112: f42 -> f28 : D'=1+A, [ B>=1+A && K>=1+D && H>=1+A && A==D ], cost: 4

    113: f42 -> f73 : Q'=free_8, [ B>=1+A && D>=1+K && H>=1+A && A>=1+D ], cost: 4

    114: f42 -> f73 : Q'=free_9, [ B>=1+A && D>=1+K && H>=1+A && D>=1+A ], cost: 4

    115: f42 -> f28 : D'=1+A, [ B>=1+A && D>=1+K && H>=1+A && A==D ], cost: 4

    116: f42 -> f73 : H'=1+A, Q'=free_8, [ B>=1+A && K>=1+D && A>=H && A>=1+D ], cost: 5+A-H

    117: f42 -> f73 : H'=1+A, Q'=free_9, [ B>=1+A && K>=1+D && A>=H && D>=1+A ], cost: 5+A-H

    118: f42 -> f28 : D'=1+A, H'=1+A, Q'=free_7, [ B>=1+A && K>=1+D && A>=H && A==D ], cost: 5+A-H

    119: f42 -> f73 : H'=1+A, Q'=free_8, [ B>=1+A && D>=1+K && A>=H && A>=1+D ], cost: 5+A-H

    120: f42 -> f73 : H'=1+A, Q'=free_9, [ B>=1+A && D>=1+K && A>=H && D>=1+A ], cost: 5+A-H

    121: f42 -> f28 : D'=1+A, H'=1+A, Q'=free_7, [ B>=1+A && D>=1+K && A>=H && A==D ], cost: 5+A-H

    122: f42 -> [24] : [ B>=1+A && K>=1+D && A>=H ], cost: 3+A-H

    123: f42 -> [24] : [ B>=1+A && D>=1+K && A>=H ], cost: 3+A-H

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



Applied pruning (of leafs and parallel rules):

   Start location: f0

     80: f0 -> f28 : [ B>=1+A ], cost: 2

     81: f0 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     82: f0 -> [18] : [ A>=B && A>=D ], cost: 3-D+A

     83: f0 -> f28 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

     84: f0 -> f28 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

     85: f0 -> f28 : B'=1+A, C'=0, [ A>=B && D>=1+A ], cost: 4+2*A-2*B

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

     88: f0 -> [22] : [ A>=B && D>=1+A ], cost: 3+2*A-2*B

     92: f28 -> f42 : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

     93: f28 -> f42 : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ A>=D && B>=D && A>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

     97: f28 -> f42 : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

     98: f28 -> f42 : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ A>=D && D>=1+B && H>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    104: f28 -> f42 : B'=1+D, C'=free_12, G'=free_6, H'=D, Q'=free_12, J'=free_13, K'=D, [ A>=D && D>=1+B && B>=1+H && free_12>=0 ], cost: 5+3*D-3*B

    105: f28 -> [23] : [ A>=D && D>=1+B && H>=B && D>=1+H ], cost: 3+2*H-2*B

    106: f28 -> [23] : [ A>=D && D>=1+B && B>=1+H ], cost: 1+3*D-3*B

    109: f42 -> f28 : D'=1+A, K'=D, [ B>=1+A && D==K && A==D ], cost: 3

    111: f42 -> f73 : Q'=free_9, [ B>=1+A && K>=1+D && H>=1+A && D>=1+A ], cost: 4

    112: f42 -> f28 : D'=1+A, [ B>=1+A && K>=1+D && H>=1+A && A==D ], cost: 4

    115: f42 -> f28 : D'=1+A, [ B>=1+A && D>=1+K && H>=1+A && A==D ], cost: 4

    116: f42 -> f73 : H'=1+A, Q'=free_8, [ B>=1+A && K>=1+D && A>=H && A>=1+D ], cost: 5+A-H

    117: f42 -> f73 : H'=1+A, Q'=free_9, [ B>=1+A && K>=1+D && A>=H && D>=1+A ], cost: 5+A-H

    118: f42 -> f28 : D'=1+A, H'=1+A, Q'=free_7, [ B>=1+A && K>=1+D && A>=H && A==D ], cost: 5+A-H

    119: f42 -> f73 : H'=1+A, Q'=free_8, [ B>=1+A && D>=1+K && A>=H && A>=1+D ], cost: 5+A-H

    120: f42 -> f73 : H'=1+A, Q'=free_9, [ B>=1+A && D>=1+K && A>=H && D>=1+A ], cost: 5+A-H

    121: f42 -> f28 : D'=1+A, H'=1+A, Q'=free_7, [ B>=1+A && D>=1+K && A>=H && A==D ], cost: 5+A-H

    122: f42 -> [24] : [ B>=1+A && K>=1+D && A>=H ], cost: 3+A-H

    123: f42 -> [24] : [ B>=1+A && D>=1+K && A>=H ], cost: 3+A-H

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



Eliminated locations (on tree-shaped paths):

   Start location: f0

     80: f0 -> f28 : [ B>=1+A ], cost: 2

     81: f0 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     82: f0 -> [18] : [ A>=B && A>=D ], cost: 3-D+A

     83: f0 -> f28 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

     84: f0 -> f28 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

     85: f0 -> f28 : B'=1+A, C'=0, [ A>=B && D>=1+A ], cost: 4+2*A-2*B

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

     88: f0 -> [22] : [ A>=B && D>=1+A ], cost: 3+2*A-2*B

    105: f28 -> [23] : [ A>=D && D>=1+B && H>=B && D>=1+H ], cost: 3+2*H-2*B

    106: f28 -> [23] : [ A>=D && D>=1+B && B>=1+H ], cost: 1+3*D-3*B

    124: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, K'=D, [ B>=D && A>=B && 0>=1+free_10 && H>=D && D==K && A==D ], cost: 7+2*A-2*B

    125: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && H>=1+A && A==D ], cost: 8+2*A-2*B

    126: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && H>=1+A && A==D ], cost: 8+2*A-2*B

    127: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    128: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, H'=1+A, Q'=free_7, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A==D ], cost: 9+3*A-H-2*B

    129: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    130: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, H'=1+A, Q'=free_7, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H && A==D ], cost: 9+3*A-H-2*B

    131: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    132: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H ], cost: 7+3*A-H-2*B

    133: f28 -> f28 : B'=1+A, C'=free_12, D'=1+A, G'=free_5, Q'=free_12, J'=free_13, K'=D, [ B>=D && A>=B && free_12>=0 && H>=D && D==A && A==D ], cost: 7+2*A-2*B

    134: f28 -> f73 : B'=1+A, C'=free_12, G'=free_5, H'=1+A, Q'=free_8, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 9+3*A-H-2*B

    135: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    136: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, K'=D, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D==K && A==D ], cost: 7+2*A-2*B

    137: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && H>=1+A && A==D ], cost: 8+2*A-2*B

    138: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D>=1+K && H>=1+A && A==D ], cost: 8+2*A-2*B

    139: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    140: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, H'=1+A, Q'=free_7, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A==D ], cost: 9+3*A-H-2*B

    141: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    142: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, H'=1+A, Q'=free_7, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H && A==D ], cost: 9+3*A-H-2*B

    143: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    144: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H ], cost: 7+3*A-H-2*B

    145: f28 -> f28 : B'=1+A, C'=free_12, D'=1+A, G'=free_5, Q'=free_12, J'=free_13, K'=D, [ D>=1+B && H>=B && free_12>=0 && H>=D && D==A && A==D ], cost: 7+2*A-2*B

    146: f28 -> f73 : B'=1+A, C'=free_12, G'=free_5, H'=1+A, Q'=free_8, J'=free_13, K'=A, [ D>=1+B && H>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 9+3*A-H-2*B

    147: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ D>=1+B && H>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    148: f28 -> f28 : B'=1+D, C'=free_12, D'=1+A, G'=free_6, H'=D, Q'=free_12, J'=free_13, K'=D, [ D>=1+B && B>=1+H && free_12>=0 && A==D ], cost: 8+3*D-3*B

    149: f28 -> [25] : [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    150: f28 -> [25] : [ A>=D && B>=D && A>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    151: f28 -> [25] : [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    152: f28 -> [25] : [ A>=D && D>=1+B && H>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    153: f28 -> [25] : [ A>=D && D>=1+B && B>=1+H && free_12>=0 ], cost: 5+3*D-3*B

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



Applied pruning (of leafs and parallel rules):

   Start location: f0

     80: f0 -> f28 : [ B>=1+A ], cost: 2

     81: f0 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     82: f0 -> [18] : [ A>=B && A>=D ], cost: 3-D+A

     83: f0 -> f28 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

     84: f0 -> f28 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

     85: f0 -> f28 : B'=1+A, C'=0, [ A>=B && D>=1+A ], cost: 4+2*A-2*B

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

     88: f0 -> [22] : [ A>=B && D>=1+A ], cost: 3+2*A-2*B

    105: f28 -> [23] : [ A>=D && D>=1+B && H>=B && D>=1+H ], cost: 3+2*H-2*B

    106: f28 -> [23] : [ A>=D && D>=1+B && B>=1+H ], cost: 1+3*D-3*B

    127: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    129: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    131: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    132: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H ], cost: 7+3*A-H-2*B

    134: f28 -> f73 : B'=1+A, C'=free_12, G'=free_5, H'=1+A, Q'=free_8, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 9+3*A-H-2*B

    135: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    136: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, K'=D, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D==K && A==D ], cost: 7+2*A-2*B

    137: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && H>=1+A && A==D ], cost: 8+2*A-2*B

    138: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D>=1+K && H>=1+A && A==D ], cost: 8+2*A-2*B

    139: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    140: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, H'=1+A, Q'=free_7, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A==D ], cost: 9+3*A-H-2*B

    141: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    143: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    147: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ D>=1+B && H>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    148: f28 -> f28 : B'=1+D, C'=free_12, D'=1+A, G'=free_6, H'=D, Q'=free_12, J'=free_13, K'=D, [ D>=1+B && B>=1+H && free_12>=0 && A==D ], cost: 8+3*D-3*B

    149: f28 -> [25] : [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    150: f28 -> [25] : [ A>=D && B>=D && A>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    151: f28 -> [25] : [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    152: f28 -> [25] : [ A>=D && D>=1+B && H>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    153: f28 -> [25] : [ A>=D && D>=1+B && B>=1+H && free_12>=0 ], cost: 5+3*D-3*B

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



Accelerating simple loops of location 4.

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

   Accelerating the following rules:

    136: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, K'=D, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D==K && A==D ], cost: 7+2*A-2*B

    137: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && H>=1+A && A==D ], cost: 8+2*A-2*B

    138: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D>=1+K && H>=1+A && A==D ], cost: 8+2*A-2*B

    140: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, H'=1+A, Q'=free_7, J'=free_11, [ D>=1+B && H>=B && H>=D && K>=1+D && A>=H && A==D ], cost: 9+3*A-H-2*B

    148: f28 -> f28 : B'=1+D, C'=free_12, D'=1+A, G'=free_6, H'=D, Q'=free_12, J'=free_13, K'=D, [ D>=1+B && B>=1+H && free_12>=0 && A==D ], cost: 8+3*D-3*B



   Accelerated rule 136 with metering function meter (where 2*meter==-2*D+A+K), yielding the new rule 154.

   Accelerated rule 137 with metering function -D+A, yielding the new rule 155.

   Accelerated rule 138 with metering function -D+A, yielding the new rule 156.

   Accelerated rule 140 with metering function D+A-2*H, yielding the new rule 157.

   Accelerated rule 148 with metering function -D+A, yielding the new rule 158.

   Removing the simple loops: 136 137 138 140 148.



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

   Start location: f0

     80: f0 -> f28 : [ B>=1+A ], cost: 2

     81: f0 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     82: f0 -> [18] : [ A>=B && A>=D ], cost: 3-D+A

     83: f0 -> f28 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

     84: f0 -> f28 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

     85: f0 -> f28 : B'=1+A, C'=0, [ A>=B && D>=1+A ], cost: 4+2*A-2*B

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

     88: f0 -> [22] : [ A>=B && D>=1+A ], cost: 3+2*A-2*B

    105: f28 -> [23] : [ A>=D && D>=1+B && H>=B && D>=1+H ], cost: 3+2*H-2*B

    106: f28 -> [23] : [ A>=D && D>=1+B && B>=1+H ], cost: 1+3*D-3*B

    127: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    129: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    131: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    132: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H ], cost: 7+3*A-H-2*B

    134: f28 -> f73 : B'=1+A, C'=free_12, G'=free_5, H'=1+A, Q'=free_8, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 9+3*A-H-2*B

    135: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    139: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    141: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    143: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    147: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ D>=1+B && H>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    149: f28 -> [25] : [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    150: f28 -> [25] : [ A>=D && B>=D && A>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    151: f28 -> [25] : [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    152: f28 -> [25] : [ A>=D && D>=1+B && H>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    153: f28 -> [25] : [ A>=D && D>=1+B && B>=1+H && free_12>=0 ], cost: 5+3*D-3*B

    154: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, K'=1+A, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D==K && A==D && 2*meter==-2*D+A+K && meter>=1 ], cost: 5*meter

    155: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && H>=1+A && A==D && -D+A>=1 ], cost: -6*D+6*A

    156: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, Q'=free_10, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D>=1+K && H>=1+A && A==D && -D+A>=1 ], cost: -6*D+6*A

    157: f28 -> f28 : B'=1+A, C'=0, D'=1+A, G'=free_5, H'=1+A, Q'=free_7, J'=free_11, [ D>=1+B && H>=B && H>=D && K>=1+D && A>=H && A==D && D+A-2*H>=1 ], cost: 6*D+6*A-12*H

    158: f28 -> f28 : B'=2+A, C'=free_12, D'=1+A, G'=free_6, H'=1+A, Q'=free_12, J'=free_13, K'=1+A, [ D>=1+B && B>=1+H && free_12>=0 && A==D && -D+A>=1 ], cost: -5*D+5*A

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



Chained accelerated rules (with incoming rules):

   Start location: f0

     80: f0 -> f28 : [ B>=1+A ], cost: 2

     81: f0 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     82: f0 -> [18] : [ A>=B && A>=D ], cost: 3-D+A

     83: f0 -> f28 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

     84: f0 -> f28 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

     85: f0 -> f28 : B'=1+A, C'=0, [ A>=B && D>=1+A ], cost: 4+2*A-2*B

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

     88: f0 -> [22] : [ A>=B && D>=1+A ], cost: 3+2*A-2*B

    105: f28 -> [23] : [ A>=D && D>=1+B && H>=B && D>=1+H ], cost: 3+2*H-2*B

    106: f28 -> [23] : [ A>=D && D>=1+B && B>=1+H ], cost: 1+3*D-3*B

    127: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    129: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    131: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    132: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H ], cost: 7+3*A-H-2*B

    134: f28 -> f73 : B'=1+A, C'=free_12, G'=free_5, H'=1+A, Q'=free_8, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 9+3*A-H-2*B

    135: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    139: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    141: f28 -> f73 : B'=1+A, C'=0, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 9+3*A-H-2*B

    143: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    147: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ D>=1+B && H>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    149: f28 -> [25] : [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    150: f28 -> [25] : [ A>=D && B>=D && A>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    151: f28 -> [25] : [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    152: f28 -> [25] : [ A>=D && D>=1+B && H>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    153: f28 -> [25] : [ A>=D && D>=1+B && B>=1+H && free_12>=0 ], cost: 5+3*D-3*B

     16: f73 -> f28 : D'=1+D, [ B>=1+A ], cost: 1



Eliminated locations (on tree-shaped paths):

   Start location: f0

     80: f0 -> f28 : [ B>=1+A ], cost: 2

     81: f0 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     82: f0 -> [18] : [ A>=B && A>=D ], cost: 3-D+A

     83: f0 -> f28 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

     84: f0 -> f28 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

     85: f0 -> f28 : B'=1+A, C'=0, [ A>=B && D>=1+A ], cost: 4+2*A-2*B

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

     88: f0 -> [22] : [ A>=B && D>=1+A ], cost: 3+2*A-2*B

    105: f28 -> [23] : [ A>=D && D>=1+B && H>=B && D>=1+H ], cost: 3+2*H-2*B

    106: f28 -> [23] : [ A>=D && D>=1+B && B>=1+H ], cost: 1+3*D-3*B

    131: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    132: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H ], cost: 7+3*A-H-2*B

    135: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    143: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    147: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ D>=1+B && H>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    149: f28 -> [25] : [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    150: f28 -> [25] : [ A>=D && B>=D && A>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    151: f28 -> [25] : [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    152: f28 -> [25] : [ A>=D && D>=1+B && H>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    153: f28 -> [25] : [ A>=D && D>=1+B && B>=1+H && free_12>=0 ], cost: 5+3*D-3*B

    159: f28 -> f28 : B'=1+A, C'=0, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 10+3*A-H-2*B

    160: f28 -> f28 : B'=1+A, C'=0, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 10+3*A-H-2*B

    161: f28 -> f28 : B'=1+A, C'=free_12, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 10+3*A-H-2*B

    162: f28 -> f28 : B'=1+A, C'=0, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 10+3*A-H-2*B

    163: f28 -> f28 : B'=1+A, C'=0, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 10+3*A-H-2*B



Accelerating simple loops of location 4.

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

   Accelerating the following rules:

    159: f28 -> f28 : B'=1+A, C'=0, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 10+3*A-H-2*B

    160: f28 -> f28 : B'=1+A, C'=0, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 10+3*A-H-2*B

    161: f28 -> f28 : B'=1+A, C'=free_12, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 10+3*A-H-2*B

    162: f28 -> f28 : B'=1+A, C'=0, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 10+3*A-H-2*B

    163: f28 -> f28 : B'=1+A, C'=0, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 10+3*A-H-2*B



   Found no metering function for rule 159.

   Found no metering function for rule 160.

   Found no metering function for rule 161.

   Accelerated rule 162 with NONTERM (after strengthening guard), yielding the new rule 164.

   Accelerated rule 163 with NONTERM (after strengthening guard), yielding the new rule 165.

   Removing the simple loops:.



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

   Start location: f0

     80: f0 -> f28 : [ B>=1+A ], cost: 2

     81: f0 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     82: f0 -> [18] : [ A>=B && A>=D ], cost: 3-D+A

     83: f0 -> f28 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

     84: f0 -> f28 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

     85: f0 -> f28 : B'=1+A, C'=0, [ A>=B && D>=1+A ], cost: 4+2*A-2*B

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

     88: f0 -> [22] : [ A>=B && D>=1+A ], cost: 3+2*A-2*B

    105: f28 -> [23] : [ A>=D && D>=1+B && H>=B && D>=1+H ], cost: 3+2*H-2*B

    106: f28 -> [23] : [ A>=D && D>=1+B && B>=1+H ], cost: 1+3*D-3*B

    131: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    132: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H ], cost: 7+3*A-H-2*B

    135: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    143: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    147: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ D>=1+B && H>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    149: f28 -> [25] : [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    150: f28 -> [25] : [ A>=D && B>=D && A>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    151: f28 -> [25] : [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    152: f28 -> [25] : [ A>=D && D>=1+B && H>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    153: f28 -> [25] : [ A>=D && D>=1+B && B>=1+H && free_12>=0 ], cost: 5+3*D-3*B

    159: f28 -> f28 : B'=1+A, C'=0, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 10+3*A-H-2*B

    160: f28 -> f28 : B'=1+A, C'=0, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ B>=D && A>=B && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 10+3*A-H-2*B

    161: f28 -> f28 : B'=1+A, C'=free_12, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 10+3*A-H-2*B

    162: f28 -> f28 : B'=1+A, C'=0, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && H>=D && K>=1+D && A>=H && A>=1+D ], cost: 10+3*A-H-2*B

    163: f28 -> f28 : B'=1+A, C'=0, D'=1+D, G'=free_5, H'=1+A, Q'=free_8, J'=free_11, [ D>=1+B && H>=B && H>=D && D>=1+K && A>=H && A>=1+D ], cost: 10+3*A-H-2*B

    164: f28 -> [27] : [ D>=1+B && H>=B && H>=D && K>=1+D && A>=H && A>=1+D && 1+D>=2+A && 10+3*A-H-2*B>=1 ], cost: INF

    165: f28 -> [27] : [ D>=1+B && H>=B && H>=D && D>=1+K && A>=H && A>=1+D && 1+D>=2+A && 10+3*A-H-2*B>=1 ], cost: INF



Chained accelerated rules (with incoming rules):

   Start location: f0

     80: f0 -> f28 : [ B>=1+A ], cost: 2

     81: f0 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     82: f0 -> [18] : [ A>=B && A>=D ], cost: 3-D+A

     83: f0 -> f28 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

     84: f0 -> f28 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

     85: f0 -> f28 : B'=1+A, C'=0, [ A>=B && D>=1+A ], cost: 4+2*A-2*B

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

     88: f0 -> [22] : [ A>=B && D>=1+A ], cost: 3+2*A-2*B

    105: f28 -> [23] : [ A>=D && D>=1+B && H>=B && D>=1+H ], cost: 3+2*H-2*B

    106: f28 -> [23] : [ A>=D && D>=1+B && B>=1+H ], cost: 1+3*D-3*B

    131: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    132: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H ], cost: 7+3*A-H-2*B

    135: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    143: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    147: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ D>=1+B && H>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    149: f28 -> [25] : [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    150: f28 -> [25] : [ A>=D && B>=D && A>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    151: f28 -> [25] : [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    152: f28 -> [25] : [ A>=D && D>=1+B && H>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    153: f28 -> [25] : [ A>=D && D>=1+B && B>=1+H && free_12>=0 ], cost: 5+3*D-3*B



Removed unreachable locations (and leaf rules with constant cost):

   Start location: f0

     80: f0 -> f28 : [ B>=1+A ], cost: 2

     81: f0 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     82: f0 -> [18] : [ A>=B && A>=D ], cost: 3-D+A

     83: f0 -> f28 : B'=1+B, C'=0, D'=1+A, E'=free_1, F'=free_1, [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

     84: f0 -> f28 : B'=1+B, C'=1-D+A, D'=1+A, E'=1-D+A, F'=1-D+A, [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

     85: f0 -> f28 : B'=1+A, C'=0, [ A>=B && D>=1+A ], cost: 4+2*A-2*B

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

     88: f0 -> [22] : [ A>=B && D>=1+A ], cost: 3+2*A-2*B

    105: f28 -> [23] : [ A>=D && D>=1+B && H>=B && D>=1+H ], cost: 3+2*H-2*B

    106: f28 -> [23] : [ A>=D && D>=1+B && B>=1+H ], cost: 1+3*D-3*B

    131: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    132: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D && D>=1+K && A>=H ], cost: 7+3*A-H-2*B

    135: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ B>=D && A>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    143: f28 -> [24] : B'=1+A, C'=0, G'=free_5, Q'=free_10, J'=free_11, [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D && K>=1+D && A>=H ], cost: 7+3*A-H-2*B

    147: f28 -> [24] : B'=1+A, C'=free_12, G'=free_5, Q'=free_12, J'=free_13, K'=A, [ D>=1+B && H>=B && free_12>=0 && H>=D && A>=1+D && A>=H ], cost: 7+3*A-H-2*B

    149: f28 -> [25] : [ A>=D && B>=D && A>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    150: f28 -> [25] : [ A>=D && B>=D && A>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    151: f28 -> [25] : [ A>=D && D>=1+B && H>=B && 0>=1+free_10 && H>=D ], cost: 4+2*A-2*B

    152: f28 -> [25] : [ A>=D && D>=1+B && H>=B && free_12>=0 && H>=D ], cost: 4+2*A-2*B

    153: f28 -> [25] : [ A>=D && D>=1+B && B>=1+H && free_12>=0 ], cost: 5+3*D-3*B



Eliminated locations (on tree-shaped paths):

   Start location: f0

     81: f0 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     82: f0 -> [18] : [ A>=B && A>=D ], cost: 3-D+A

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

     88: f0 -> [22] : [ A>=B && D>=1+A ], cost: 3+2*A-2*B

    166: f0 -> [28] : [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

    167: f0 -> [28] : [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

    168: f0 -> [28] : [ A>=B && D>=1+A ], cost: 4+2*A-2*B



Applied pruning (of leafs and parallel rules):

   Start location: f0

     81: f0 -> [18] : [ A>=B && 0>=free_1 && A>=D ], cost: 3-D+A

     82: f0 -> [18] : [ A>=B && A>=D ], cost: 3-D+A

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

     88: f0 -> [22] : [ A>=B && D>=1+A ], cost: 3+2*A-2*B

    166: f0 -> [28] : [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

    167: f0 -> [28] : [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

    168: f0 -> [28] : [ A>=B && D>=1+A ], cost: 4+2*A-2*B



### Computing asymptotic complexity ###



Fully simplified ITS problem

   Start location: f0

     86: f0 -> [22] : [ A>=B && 0>=free_1 && A>=D ], cost: 4-D+A

     87: f0 -> [22] : [ A>=B && A>=D ], cost: 4-D+A

    166: f0 -> [28] : [ A>=B && 0>=free_1 && A>=D && 1+B>=1+A ], cost: 5-D+A

    167: f0 -> [28] : [ A>=B && A>=D && 1+B>=1+A ], cost: 5-D+A

    168: f0 -> [28] : [ A>=B && D>=1+A ], cost: 4+2*A-2*B



Computing asymptotic complexity for rule 86

   Solved the limit problem by the following transformations:

      Created initial limit problem:

      4-D+A (+), 1-free_1 (+/+!), 1-D+A (+/+!), 1+A-B (+/+!) [not solved]



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

      resulting limit problem:

      1 (+/+!), 1-D+B (+/+!), 1-free_1 (+/+!), 4-D+B (+) [not solved]



      applying transformation rule (C) using substitution {free_1==0}

      resulting limit problem:

      1 (+/+!), 1-D+B (+/+!), 4-D+B (+) [not solved]



      applying transformation rule (C) using substitution {A==D}

      resulting limit problem:

      1 (+/+!), 1-D+B (+/+!), 4-D+B (+) [not solved]



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

      resulting limit problem:

      1-D+B (+/+!), 4-D+B (+) [not solved]



      removing all constraints (solved by SMT)

      resulting limit problem: [solved]



      applying transformation rule (C) using substitution {D==-n,B==0}

      resulting limit problem:

      [solved]



   Solution:

      D / -n

      A / 0

      B / 0

      free_1 / 0

   Resulting cost 4+n has complexity: Poly(n^1)



Found new complexity Poly(n^1).



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

   Complexity:  Poly(n^1)

   Cpx degree:  1

   Solved cost: 4+n

   Rule cost:   4-D+A

   Rule guard:  [ A>=B && 0>=free_1 && A>=D ]



WORST_CASE(Omega(n^1),?)


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

(4)
BOUNDS(n^1, INF)