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


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


WORST_CASE(?, O(n^1))
proof of /export/starexec/sandbox/benchmark/theBenchmark.koat
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, max(83, 83 + 4 * Arg_0) + nat(8 * Arg_0)).

(0) CpxIntTrs
(1) Koat2 Proof [FINISHED, 7276 ms]
(2) BOUNDS(1, max(83, 83 + 4 * Arg_0) + nat(8 * Arg_0))


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
start(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(stop(A, B, C, D, E, F, G, H, I, J, K, 0, M, N)) :|: 1 >= A && B >= C && B <= C && D >= E && D <= E && F >= G && F <= G && H >= I && H <= I && J >= K && J <= K && L >= M && L <= M && N >= A && N <= A
start(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(lbl53(A, B, C, 1, E, F, G, 0, I, 2, K, 0, M, N)) :|: A >= 2 && B >= C && B <= C && D >= E && D <= E && F >= G && F <= G && H >= I && H <= I && J >= K && J <= K && L >= M && L <= M && N >= A && N <= A
start(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(lbl53(A, B, C, 1, E, F, G, 1, I, 2, K, 0, M, N)) :|: A >= 2 && B >= C && B <= C && D >= E && D <= E && F >= G && F <= G && H >= I && H <= I && J >= K && J <= K && L >= M && L <= M && N >= A && N <= A
lbl91(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(lbl13(A, L, C, D, E, F, G, H, I, J, K, 1 + L, M, N)) :|: D >= H && D >= 1 && H + 1 >= D && A >= 1 + D && N >= A && N <= A && L + 1 >= D && L + 1 <= D && J >= A && J <= A
lbl53(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(lbl91(A, B, C, D, E, O, G, H, I, J, K, L, M, N)) :|: D >= H && D >= 1 && A >= 1 + D && H + 1 >= D && J >= A && J <= A && L + 1 >= D && L + 1 <= D && N >= A && N <= A
lbl53(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(lbl53(A, B, C, J, E, F, G, H, I, 1 + J, K, L, M, N)) :|: A >= J + 1 && D >= H && D >= 1 && A >= J && J >= 1 + D && H + 1 >= D && L + 1 >= D && L + 1 <= D && N >= A && N <= A
lbl53(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(lbl53(A, B, C, J, E, F, G, J, I, 1 + J, K, L, M, N)) :|: A >= J + 1 && D >= H && D >= 1 && A >= J && J >= 1 + D && H + 1 >= D && L + 1 >= D && L + 1 <= D && N >= A && N <= A
lbl13(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(stop(A, B, C, D, E, F, G, H, I, J, K, L, M, N)) :|: H + 2 >= A && A >= 2 && A >= 1 + H && L + 1 >= A && L + 1 <= A && B + 2 >= A && B + 2 <= A && D + 1 >= A && D + 1 <= A && N >= A && N <= A && J >= A && J <= A
lbl13(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(lbl53(A, B, C, 1 + L, E, F, G, L, I, 2 + L, K, L, M, N)) :|: A >= B + 3 && A >= B + 2 && H >= B && B >= 0 && B + 1 >= H && L >= B + 1 && L <= B + 1 && D >= B + 1 && D <= B + 1 && N >= A && N <= A && J >= A && J <= A
lbl13(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(lbl53(A, B, C, 1 + L, E, F, G, 1 + L, I, 2 + L, K, L, M, N)) :|: A >= B + 3 && A >= B + 2 && H >= B && B >= 0 && B + 1 >= H && L >= B + 1 && L <= B + 1 && D >= B + 1 && D <= B + 1 && N >= A && N <= A && J >= A && J <= A
start0(A, B, C, D, E, F, G, H, I, J, K, L, M, N) -> Com_1(start(A, C, C, E, E, G, G, I, I, K, K, M, M, A)) :|: TRUE

The start-symbols are:[start0_14]


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

(1) Koat2 Proof (FINISHED)
YES( ?, 83+2*(2*max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])) {O(n)})



Initial Complexity Problem:

  Start:  start0  

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

  Temp_Vars:  O  

  Locations:  lbl13, lbl53, lbl91, start, start0, stop  

  Transitions:

  8: lbl13->lbl53

  9: lbl13->lbl53

  7: lbl13->stop

  5: lbl53->lbl53

  6: lbl53->lbl53

  4: lbl53->lbl91

  3: lbl91->lbl13

  1: start->lbl53

  2: start->lbl53

  0: start->stop

  10: start0->start  



Timebounds: 

  Overall timebound: 83+2*(2*max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])) {O(n)}

  7: lbl13->stop: 1 {O(1)}

  8: lbl13->lbl53: 2*max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0]) {O(n)}

  9: lbl13->lbl53: 2*max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0]) {O(n)}

  4: lbl53->lbl91: 24 {O(1)}

  5: lbl53->lbl53: 6 {O(1)}

  6: lbl53->lbl53: 6 {O(1)}

  3: lbl91->lbl13: 42 {O(1)}

  0: start->stop: 1 {O(1)}

  1: start->lbl53: 1 {O(1)}

  2: start->lbl53: 1 {O(1)}

  10: start0->start: 1 {O(1)}



Costbounds:

  Overall costbound: 83+2*(2*max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])) {O(n)}

  7: lbl13->stop: 1 {O(1)}

  8: lbl13->lbl53: 2*max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0]) {O(n)}

  9: lbl13->lbl53: 2*max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0])+max([0, Arg_0]) {O(n)}

  4: lbl53->lbl91: 24 {O(1)}

  5: lbl53->lbl53: 6 {O(1)}

  6: lbl53->lbl53: 6 {O(1)}

  3: lbl91->lbl13: 42 {O(1)}

  0: start->stop: 1 {O(1)}

  1: start->lbl53: 1 {O(1)}

  2: start->lbl53: 1 {O(1)}

  10: start0->start: 1 {O(1)}



Sizebounds:

`Lower:

  7: lbl13->stop, Arg_0: 2 {O(1)}

  7: lbl13->stop, Arg_1: 0 {O(1)}

  7: lbl13->stop, Arg_2: Arg_2 {O(n)}

  7: lbl13->stop, Arg_3: 1 {O(1)}

  7: lbl13->stop, Arg_4: Arg_4 {O(n)}

  7: lbl13->stop, Arg_6: Arg_6 {O(n)}

  7: lbl13->stop, Arg_7: 0 {O(1)}

  7: lbl13->stop, Arg_8: Arg_8 {O(n)}

  7: lbl13->stop, Arg_9: 2 {O(1)}

  7: lbl13->stop, Arg_10: Arg_10 {O(n)}

  7: lbl13->stop, Arg_11: 1 {O(1)}

  7: lbl13->stop, Arg_12: Arg_12 {O(n)}

  7: lbl13->stop, Arg_13: 2 {O(1)}

  8: lbl13->lbl53, Arg_0: 3 {O(1)}

  8: lbl13->lbl53, Arg_1: 0 {O(1)}

  8: lbl13->lbl53, Arg_2: Arg_2 {O(n)}

  8: lbl13->lbl53, Arg_3: 2 {O(1)}

  8: lbl13->lbl53, Arg_4: Arg_4 {O(n)}

  8: lbl13->lbl53, Arg_6: Arg_6 {O(n)}

  8: lbl13->lbl53, Arg_7: 1 {O(1)}

  8: lbl13->lbl53, Arg_8: Arg_8 {O(n)}

  8: lbl13->lbl53, Arg_9: 3 {O(1)}

  8: lbl13->lbl53, Arg_10: Arg_10 {O(n)}

  8: lbl13->lbl53, Arg_11: 1 {O(1)}

  8: lbl13->lbl53, Arg_12: Arg_12 {O(n)}

  8: lbl13->lbl53, Arg_13: 3 {O(1)}

  9: lbl13->lbl53, Arg_0: 3 {O(1)}

  9: lbl13->lbl53, Arg_1: 0 {O(1)}

  9: lbl13->lbl53, Arg_2: Arg_2 {O(n)}

  9: lbl13->lbl53, Arg_3: 2 {O(1)}

  9: lbl13->lbl53, Arg_4: Arg_4 {O(n)}

  9: lbl13->lbl53, Arg_6: Arg_6 {O(n)}

  9: lbl13->lbl53, Arg_7: 2 {O(1)}

  9: lbl13->lbl53, Arg_8: Arg_8 {O(n)}

  9: lbl13->lbl53, Arg_9: 3 {O(1)}

  9: lbl13->lbl53, Arg_10: Arg_10 {O(n)}

  9: lbl13->lbl53, Arg_11: 1 {O(1)}

  9: lbl13->lbl53, Arg_12: Arg_12 {O(n)}

  9: lbl13->lbl53, Arg_13: 3 {O(1)}

  4: lbl53->lbl91, Arg_0: 2 {O(1)}

  4: lbl53->lbl91, Arg_1: min([0, Arg_2]) {O(n)}

  4: lbl53->lbl91, Arg_2: Arg_2 {O(n)}

  4: lbl53->lbl91, Arg_3: 1 {O(1)}

  4: lbl53->lbl91, Arg_4: Arg_4 {O(n)}

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

  4: lbl53->lbl91, Arg_7: 0 {O(1)}

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

  4: lbl53->lbl91, Arg_9: 2 {O(1)}

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

  4: lbl53->lbl91, Arg_11: 0 {O(1)}

  4: lbl53->lbl91, Arg_12: Arg_12 {O(n)}

  4: lbl53->lbl91, Arg_13: 2 {O(1)}

  5: lbl53->lbl53, Arg_0: 3 {O(1)}

  5: lbl53->lbl53, Arg_1: min([0, Arg_2]) {O(n)}

  5: lbl53->lbl53, Arg_2: Arg_2 {O(n)}

  5: lbl53->lbl53, Arg_3: 2 {O(1)}

  5: lbl53->lbl53, Arg_4: Arg_4 {O(n)}

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

  5: lbl53->lbl53, Arg_7: 0 {O(1)}

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

  5: lbl53->lbl53, Arg_9: 3 {O(1)}

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

  5: lbl53->lbl53, Arg_11: 0 {O(1)}

  5: lbl53->lbl53, Arg_12: Arg_12 {O(n)}

  5: lbl53->lbl53, Arg_13: 3 {O(1)}

  6: lbl53->lbl53, Arg_0: 3 {O(1)}

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

  6: lbl53->lbl53, Arg_2: Arg_2 {O(n)}

  6: lbl53->lbl53, Arg_3: 2 {O(1)}

  6: lbl53->lbl53, Arg_4: Arg_4 {O(n)}

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

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

  6: lbl53->lbl53, Arg_8: Arg_8 {O(n)}

  6: lbl53->lbl53, Arg_9: 3 {O(1)}

  6: lbl53->lbl53, Arg_10: Arg_10 {O(n)}

  6: lbl53->lbl53, Arg_11: 0 {O(1)}

  6: lbl53->lbl53, Arg_12: Arg_12 {O(n)}

  6: lbl53->lbl53, Arg_13: 3 {O(1)}

  3: lbl91->lbl13, Arg_0: 2 {O(1)}

  3: lbl91->lbl13, Arg_1: 0 {O(1)}

  3: lbl91->lbl13, Arg_2: Arg_2 {O(n)}

  3: lbl91->lbl13, Arg_3: 1 {O(1)}

  3: lbl91->lbl13, Arg_4: Arg_4 {O(n)}

  3: lbl91->lbl13, Arg_6: Arg_6 {O(n)}

  3: lbl91->lbl13, Arg_7: 0 {O(1)}

  3: lbl91->lbl13, Arg_8: Arg_8 {O(n)}

  3: lbl91->lbl13, Arg_9: 2 {O(1)}

  3: lbl91->lbl13, Arg_10: Arg_10 {O(n)}

  3: lbl91->lbl13, Arg_11: 1 {O(1)}

  3: lbl91->lbl13, Arg_12: Arg_12 {O(n)}

  3: lbl91->lbl13, Arg_13: 2 {O(1)}

  0: start->stop, Arg_0: Arg_0 {O(n)}

  0: start->stop, Arg_1: Arg_2 {O(n)}

  0: start->stop, Arg_2: Arg_2 {O(n)}

  0: start->stop, Arg_3: Arg_4 {O(n)}

  0: start->stop, Arg_4: Arg_4 {O(n)}

  0: start->stop, Arg_5: Arg_6 {O(n)}

  0: start->stop, Arg_6: Arg_6 {O(n)}

  0: start->stop, Arg_7: Arg_8 {O(n)}

  0: start->stop, Arg_8: Arg_8 {O(n)}

  0: start->stop, Arg_9: Arg_10 {O(n)}

  0: start->stop, Arg_10: Arg_10 {O(n)}

  0: start->stop, Arg_11: 0 {O(1)}

  0: start->stop, Arg_12: Arg_12 {O(n)}

  0: start->stop, Arg_13: Arg_0 {O(n)}

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

  1: start->lbl53, Arg_1: Arg_2 {O(n)}

  1: start->lbl53, Arg_2: Arg_2 {O(n)}

  1: start->lbl53, Arg_3: 1 {O(1)}

  1: start->lbl53, Arg_4: Arg_4 {O(n)}

  1: start->lbl53, Arg_5: Arg_6 {O(n)}

  1: start->lbl53, Arg_6: Arg_6 {O(n)}

  1: start->lbl53, Arg_7: 0 {O(1)}

  1: start->lbl53, Arg_8: Arg_8 {O(n)}

  1: start->lbl53, Arg_9: 2 {O(1)}

  1: start->lbl53, Arg_10: Arg_10 {O(n)}

  1: start->lbl53, Arg_11: 0 {O(1)}

  1: start->lbl53, Arg_12: Arg_12 {O(n)}

  1: start->lbl53, Arg_13: 2 {O(1)}

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

  2: start->lbl53, Arg_1: Arg_2 {O(n)}

  2: start->lbl53, Arg_2: Arg_2 {O(n)}

  2: start->lbl53, Arg_3: 1 {O(1)}

  2: start->lbl53, Arg_4: Arg_4 {O(n)}

  2: start->lbl53, Arg_5: Arg_6 {O(n)}

  2: start->lbl53, Arg_6: Arg_6 {O(n)}

  2: start->lbl53, Arg_7: 1 {O(1)}

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

  2: start->lbl53, Arg_9: 2 {O(1)}

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

  2: start->lbl53, Arg_11: 0 {O(1)}

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

  2: start->lbl53, Arg_13: 2 {O(1)}

  10: start0->start, Arg_0: Arg_0 {O(n)}

  10: start0->start, Arg_1: Arg_2 {O(n)}

  10: start0->start, Arg_2: Arg_2 {O(n)}

  10: start0->start, Arg_3: Arg_4 {O(n)}

  10: start0->start, Arg_4: Arg_4 {O(n)}

  10: start0->start, Arg_5: Arg_6 {O(n)}

  10: start0->start, Arg_6: Arg_6 {O(n)}

  10: start0->start, Arg_7: Arg_8 {O(n)}

  10: start0->start, Arg_8: Arg_8 {O(n)}

  10: start0->start, Arg_9: Arg_10 {O(n)}

  10: start0->start, Arg_10: Arg_10 {O(n)}

  10: start0->start, Arg_11: Arg_12 {O(n)}

  10: start0->start, Arg_12: Arg_12 {O(n)}

  10: start0->start, Arg_13: Arg_0 {O(n)}

`Upper:

  7: lbl13->stop, Arg_0: Arg_0 {O(n)}

  7: lbl13->stop, Arg_1: 42 {O(1)}

  7: lbl13->stop, Arg_2: Arg_2 {O(n)}

  7: lbl13->stop, Arg_3: 43 {O(1)}

  7: lbl13->stop, Arg_4: Arg_4 {O(n)}

  7: lbl13->stop, Arg_6: Arg_6 {O(n)}

  7: lbl13->stop, Arg_7: 43 {O(1)}

  7: lbl13->stop, Arg_8: Arg_8 {O(n)}

  7: lbl13->stop, Arg_9: 44 {O(1)}

  7: lbl13->stop, Arg_10: Arg_10 {O(n)}

  7: lbl13->stop, Arg_11: 42 {O(1)}

  7: lbl13->stop, Arg_12: Arg_12 {O(n)}

  7: lbl13->stop, Arg_13: Arg_0 {O(n)}

  8: lbl13->lbl53, Arg_0: Arg_0 {O(n)}

  8: lbl13->lbl53, Arg_1: 42 {O(1)}

  8: lbl13->lbl53, Arg_2: Arg_2 {O(n)}

  8: lbl13->lbl53, Arg_3: 43 {O(1)}

  8: lbl13->lbl53, Arg_4: Arg_4 {O(n)}

  8: lbl13->lbl53, Arg_6: Arg_6 {O(n)}

  8: lbl13->lbl53, Arg_7: 42 {O(1)}

  8: lbl13->lbl53, Arg_8: Arg_8 {O(n)}

  8: lbl13->lbl53, Arg_9: 44 {O(1)}

  8: lbl13->lbl53, Arg_10: Arg_10 {O(n)}

  8: lbl13->lbl53, Arg_11: 42 {O(1)}

  8: lbl13->lbl53, Arg_12: Arg_12 {O(n)}

  8: lbl13->lbl53, Arg_13: Arg_0 {O(n)}

  9: lbl13->lbl53, Arg_0: Arg_0 {O(n)}

  9: lbl13->lbl53, Arg_1: 42 {O(1)}

  9: lbl13->lbl53, Arg_2: Arg_2 {O(n)}

  9: lbl13->lbl53, Arg_3: 43 {O(1)}

  9: lbl13->lbl53, Arg_4: Arg_4 {O(n)}

  9: lbl13->lbl53, Arg_6: Arg_6 {O(n)}

  9: lbl13->lbl53, Arg_7: 43 {O(1)}

  9: lbl13->lbl53, Arg_8: Arg_8 {O(n)}

  9: lbl13->lbl53, Arg_9: 44 {O(1)}

  9: lbl13->lbl53, Arg_10: Arg_10 {O(n)}

  9: lbl13->lbl53, Arg_11: 42 {O(1)}

  9: lbl13->lbl53, Arg_12: Arg_12 {O(n)}

  9: lbl13->lbl53, Arg_13: Arg_0 {O(n)}

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

  4: lbl53->lbl91, Arg_1: max([42, Arg_2]) {O(n)}

  4: lbl53->lbl91, Arg_2: Arg_2 {O(n)}

  4: lbl53->lbl91, Arg_3: 43 {O(1)}

  4: lbl53->lbl91, Arg_4: Arg_4 {O(n)}

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

  4: lbl53->lbl91, Arg_7: 43 {O(1)}

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

  4: lbl53->lbl91, Arg_9: 44 {O(1)}

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

  4: lbl53->lbl91, Arg_11: 42 {O(1)}

  4: lbl53->lbl91, Arg_12: Arg_12 {O(n)}

  4: lbl53->lbl91, Arg_13: Arg_0 {O(n)}

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

  5: lbl53->lbl53, Arg_1: max([42, Arg_2]) {O(n)}

  5: lbl53->lbl53, Arg_2: Arg_2 {O(n)}

  5: lbl53->lbl53, Arg_3: 44 {O(1)}

  5: lbl53->lbl53, Arg_4: Arg_4 {O(n)}

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

  5: lbl53->lbl53, Arg_7: 43 {O(1)}

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

  5: lbl53->lbl53, Arg_9: 45 {O(1)}

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

  5: lbl53->lbl53, Arg_11: 42 {O(1)}

  5: lbl53->lbl53, Arg_12: Arg_12 {O(n)}

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

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

  6: lbl53->lbl53, Arg_1: max([42, Arg_2]) {O(n)}

  6: lbl53->lbl53, Arg_2: Arg_2 {O(n)}

  6: lbl53->lbl53, Arg_3: 44 {O(1)}

  6: lbl53->lbl53, Arg_4: Arg_4 {O(n)}

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

  6: lbl53->lbl53, Arg_7: 44 {O(1)}

  6: lbl53->lbl53, Arg_8: Arg_8 {O(n)}

  6: lbl53->lbl53, Arg_9: 45 {O(1)}

  6: lbl53->lbl53, Arg_10: Arg_10 {O(n)}

  6: lbl53->lbl53, Arg_11: 42 {O(1)}

  6: lbl53->lbl53, Arg_12: Arg_12 {O(n)}

  6: lbl53->lbl53, Arg_13: Arg_0 {O(n)}

  3: lbl91->lbl13, Arg_0: Arg_0 {O(n)}

  3: lbl91->lbl13, Arg_1: 42 {O(1)}

  3: lbl91->lbl13, Arg_2: Arg_2 {O(n)}

  3: lbl91->lbl13, Arg_3: 43 {O(1)}

  3: lbl91->lbl13, Arg_4: Arg_4 {O(n)}

  3: lbl91->lbl13, Arg_6: Arg_6 {O(n)}

  3: lbl91->lbl13, Arg_7: 43 {O(1)}

  3: lbl91->lbl13, Arg_8: Arg_8 {O(n)}

  3: lbl91->lbl13, Arg_9: 44 {O(1)}

  3: lbl91->lbl13, Arg_10: Arg_10 {O(n)}

  3: lbl91->lbl13, Arg_11: 42 {O(1)}

  3: lbl91->lbl13, Arg_12: Arg_12 {O(n)}

  3: lbl91->lbl13, Arg_13: Arg_0 {O(n)}

  0: start->stop, Arg_0: 1 {O(1)}

  0: start->stop, Arg_1: Arg_2 {O(n)}

  0: start->stop, Arg_2: Arg_2 {O(n)}

  0: start->stop, Arg_3: Arg_4 {O(n)}

  0: start->stop, Arg_4: Arg_4 {O(n)}

  0: start->stop, Arg_5: Arg_6 {O(n)}

  0: start->stop, Arg_6: Arg_6 {O(n)}

  0: start->stop, Arg_7: Arg_8 {O(n)}

  0: start->stop, Arg_8: Arg_8 {O(n)}

  0: start->stop, Arg_9: Arg_10 {O(n)}

  0: start->stop, Arg_10: Arg_10 {O(n)}

  0: start->stop, Arg_11: 0 {O(1)}

  0: start->stop, Arg_12: Arg_12 {O(n)}

  0: start->stop, Arg_13: 1 {O(1)}

  1: start->lbl53, Arg_0: Arg_0 {O(n)}

  1: start->lbl53, Arg_1: Arg_2 {O(n)}

  1: start->lbl53, Arg_2: Arg_2 {O(n)}

  1: start->lbl53, Arg_3: 1 {O(1)}

  1: start->lbl53, Arg_4: Arg_4 {O(n)}

  1: start->lbl53, Arg_5: Arg_6 {O(n)}

  1: start->lbl53, Arg_6: Arg_6 {O(n)}

  1: start->lbl53, Arg_7: 0 {O(1)}

  1: start->lbl53, Arg_8: Arg_8 {O(n)}

  1: start->lbl53, Arg_9: 2 {O(1)}

  1: start->lbl53, Arg_10: Arg_10 {O(n)}

  1: start->lbl53, Arg_11: 0 {O(1)}

  1: start->lbl53, Arg_12: Arg_12 {O(n)}

  1: start->lbl53, Arg_13: Arg_0 {O(n)}

  2: start->lbl53, Arg_0: Arg_0 {O(n)}

  2: start->lbl53, Arg_1: Arg_2 {O(n)}

  2: start->lbl53, Arg_2: Arg_2 {O(n)}

  2: start->lbl53, Arg_3: 1 {O(1)}

  2: start->lbl53, Arg_4: Arg_4 {O(n)}

  2: start->lbl53, Arg_5: Arg_6 {O(n)}

  2: start->lbl53, Arg_6: Arg_6 {O(n)}

  2: start->lbl53, Arg_7: 1 {O(1)}

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

  2: start->lbl53, Arg_9: 2 {O(1)}

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

  2: start->lbl53, Arg_11: 0 {O(1)}

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

  2: start->lbl53, Arg_13: Arg_0 {O(n)}

  10: start0->start, Arg_0: Arg_0 {O(n)}

  10: start0->start, Arg_1: Arg_2 {O(n)}

  10: start0->start, Arg_2: Arg_2 {O(n)}

  10: start0->start, Arg_3: Arg_4 {O(n)}

  10: start0->start, Arg_4: Arg_4 {O(n)}

  10: start0->start, Arg_5: Arg_6 {O(n)}

  10: start0->start, Arg_6: Arg_6 {O(n)}

  10: start0->start, Arg_7: Arg_8 {O(n)}

  10: start0->start, Arg_8: Arg_8 {O(n)}

  10: start0->start, Arg_9: Arg_10 {O(n)}

  10: start0->start, Arg_10: Arg_10 {O(n)}

  10: start0->start, Arg_11: Arg_12 {O(n)}

  10: start0->start, Arg_12: Arg_12 {O(n)}

  10: start0->start, Arg_13: Arg_0 {O(n)}


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

(2)
BOUNDS(1, max(83, 83 + 4 * Arg_0) + nat(8 * Arg_0))