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


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


WORST_CASE(?, O(n^1))
proof of /export/starexec/sandbox2/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(2, 103 + -1 * Arg_1 + -1 * Arg_3 + Arg_5) + max(11, 112 + -1 * Arg_1 + -1 * Arg_3 + Arg_5)).

(0) CpxIntTrs
(1) Koat2 Proof [FINISHED, 1653 ms]
(2) BOUNDS(1, max(2, 103 + -1 * Arg_1 + -1 * Arg_3 + Arg_5) + max(11, 112 + -1 * Arg_1 + -1 * Arg_3 + Arg_5))


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

(0)
Obligation:
Complexity Int TRS consisting of the following rules:
eval_exmini_start(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_bb0_in(v__0, v__01, v__02, v_i, v_j, v_k)) :|: TRUE
eval_exmini_bb0_in(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_0(v__0, v__01, v__02, v_i, v_j, v_k)) :|: TRUE
eval_exmini_0(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_1(v__0, v__01, v__02, v_i, v_j, v_k)) :|: TRUE
eval_exmini_1(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_2(v__0, v__01, v__02, v_i, v_j, v_k)) :|: TRUE
eval_exmini_2(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_3(v__0, v__01, v__02, v_i, v_j, v_k)) :|: TRUE
eval_exmini_3(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_4(v__0, v__01, v__02, v_i, v_j, v_k)) :|: TRUE
eval_exmini_4(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_5(v__0, v__01, v__02, v_i, v_j, v_k)) :|: TRUE
eval_exmini_5(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_6(v__0, v__01, v__02, v_i, v_j, v_k)) :|: TRUE
eval_exmini_6(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_7(v__0, v__01, v__02, v_i, v_j, v_k)) :|: TRUE
eval_exmini_7(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_bb1_in(v_i, v_j, v_k, v_i, v_j, v_k)) :|: TRUE
eval_exmini_bb1_in(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_bb2_in(v__0, v__01, v__02, v_i, v_j, v_k)) :|: v__0 <= 100 && v__01 <= v__02
eval_exmini_bb1_in(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_bb3_in(v__0, v__01, v__02, v_i, v_j, v_k)) :|: v__0 > 100
eval_exmini_bb1_in(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_bb3_in(v__0, v__01, v__02, v_i, v_j, v_k)) :|: v__01 > v__02
eval_exmini_bb2_in(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_bb1_in(v__01, v__0 + 1, v__02 - 1, v_i, v_j, v_k)) :|: TRUE
eval_exmini_bb3_in(v__0, v__01, v__02, v_i, v_j, v_k) -> Com_1(eval_exmini_stop(v__0, v__01, v__02, v_i, v_j, v_k)) :|: TRUE

The start-symbols are:[eval_exmini_start_6]


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

(1) Koat2 Proof (FINISHED)
YES( ?, 2+max([0, 101+Arg_5+-(Arg_3)-Arg_1])+max([11, 112+Arg_5+-(Arg_3)-Arg_1]) {O(n)})



Initial Complexity Problem:

  Start:  evalexministart  

  Program_Vars:  Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5  

  Temp_Vars:    

  Locations:  evalexmini0, evalexmini1, evalexmini2, evalexmini3, evalexmini4, evalexmini5, evalexmini6, evalexmini7, evalexminibb0in, evalexminibb1in, evalexminibb2in, evalexminibb3in, evalexministart, evalexministop  

  Transitions:

  2: evalexmini0->evalexmini1

  3: evalexmini1->evalexmini2

  4: evalexmini2->evalexmini3

  5: evalexmini3->evalexmini4

  6: evalexmini4->evalexmini5

  7: evalexmini5->evalexmini6

  8: evalexmini6->evalexmini7

  9: evalexmini7->evalexminibb1in

  1: evalexminibb0in->evalexmini0

  10: evalexminibb1in->evalexminibb2in

  11: evalexminibb1in->evalexminibb3in

  12: evalexminibb1in->evalexminibb3in

  13: evalexminibb2in->evalexminibb1in

  14: evalexminibb3in->evalexministop

  0: evalexministart->evalexminibb0in  



Timebounds: 

  Overall timebound: 2+max([0, 101+Arg_5+-(Arg_3)-Arg_1])+max([11, 112+Arg_5+-(Arg_3)-Arg_1]) {O(n)}

  2: evalexmini0->evalexmini1: 1 {O(1)}

  3: evalexmini1->evalexmini2: 1 {O(1)}

  4: evalexmini2->evalexmini3: 1 {O(1)}

  5: evalexmini3->evalexmini4: 1 {O(1)}

  6: evalexmini4->evalexmini5: 1 {O(1)}

  7: evalexmini5->evalexmini6: 1 {O(1)}

  8: evalexmini6->evalexmini7: 1 {O(1)}

  9: evalexmini7->evalexminibb1in: 1 {O(1)}

  1: evalexminibb0in->evalexmini0: 1 {O(1)}

  10: evalexminibb1in->evalexminibb2in: max([0, 101+Arg_5+-(Arg_3)-Arg_1]) {O(n)}

  11: evalexminibb1in->evalexminibb3in: 1 {O(1)}

  12: evalexminibb1in->evalexminibb3in: 1 {O(1)}

  13: evalexminibb2in->evalexminibb1in: max([0, 101+Arg_5+-(Arg_3)-Arg_1]) {O(n)}

  14: evalexminibb3in->evalexministop: 1 {O(1)}

  0: evalexministart->evalexminibb0in: 1 {O(1)}



Costbounds:

  Overall costbound: 2+max([0, 101+Arg_5+-(Arg_3)-Arg_1])+max([11, 112+Arg_5+-(Arg_3)-Arg_1]) {O(n)}

  2: evalexmini0->evalexmini1: 1 {O(1)}

  3: evalexmini1->evalexmini2: 1 {O(1)}

  4: evalexmini2->evalexmini3: 1 {O(1)}

  5: evalexmini3->evalexmini4: 1 {O(1)}

  6: evalexmini4->evalexmini5: 1 {O(1)}

  7: evalexmini5->evalexmini6: 1 {O(1)}

  8: evalexmini6->evalexmini7: 1 {O(1)}

  9: evalexmini7->evalexminibb1in: 1 {O(1)}

  1: evalexminibb0in->evalexmini0: 1 {O(1)}

  10: evalexminibb1in->evalexminibb2in: max([0, 101+Arg_5+-(Arg_3)-Arg_1]) {O(n)}

  11: evalexminibb1in->evalexminibb3in: 1 {O(1)}

  12: evalexminibb1in->evalexminibb3in: 1 {O(1)}

  13: evalexminibb2in->evalexminibb1in: max([0, 101+Arg_5+-(Arg_3)-Arg_1]) {O(n)}

  14: evalexminibb3in->evalexministop: 1 {O(1)}

  0: evalexministart->evalexminibb0in: 1 {O(1)}



Sizebounds:

`Lower:

  2: evalexmini0->evalexmini1, Arg_0: Arg_0 {O(n)}

  2: evalexmini0->evalexmini1, Arg_1: Arg_1 {O(n)}

  2: evalexmini0->evalexmini1, Arg_2: Arg_2 {O(n)}

  2: evalexmini0->evalexmini1, Arg_3: Arg_3 {O(n)}

  2: evalexmini0->evalexmini1, Arg_4: Arg_4 {O(n)}

  2: evalexmini0->evalexmini1, Arg_5: Arg_5 {O(n)}

  3: evalexmini1->evalexmini2, Arg_0: Arg_0 {O(n)}

  3: evalexmini1->evalexmini2, Arg_1: Arg_1 {O(n)}

  3: evalexmini1->evalexmini2, Arg_2: Arg_2 {O(n)}

  3: evalexmini1->evalexmini2, Arg_3: Arg_3 {O(n)}

  3: evalexmini1->evalexmini2, Arg_4: Arg_4 {O(n)}

  3: evalexmini1->evalexmini2, Arg_5: Arg_5 {O(n)}

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

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

  4: evalexmini2->evalexmini3, Arg_2: Arg_2 {O(n)}

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

  4: evalexmini2->evalexmini3, Arg_4: Arg_4 {O(n)}

  4: evalexmini2->evalexmini3, Arg_5: Arg_5 {O(n)}

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

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

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

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

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

  5: evalexmini3->evalexmini4, Arg_5: Arg_5 {O(n)}

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

  6: evalexmini4->evalexmini5, Arg_1: Arg_1 {O(n)}

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

  6: evalexmini4->evalexmini5, Arg_3: Arg_3 {O(n)}

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

  6: evalexmini4->evalexmini5, Arg_5: Arg_5 {O(n)}

  7: evalexmini5->evalexmini6, Arg_0: Arg_0 {O(n)}

  7: evalexmini5->evalexmini6, Arg_1: Arg_1 {O(n)}

  7: evalexmini5->evalexmini6, Arg_2: Arg_2 {O(n)}

  7: evalexmini5->evalexmini6, Arg_3: Arg_3 {O(n)}

  7: evalexmini5->evalexmini6, Arg_4: Arg_4 {O(n)}

  7: evalexmini5->evalexmini6, Arg_5: Arg_5 {O(n)}

  8: evalexmini6->evalexmini7, Arg_0: Arg_0 {O(n)}

  8: evalexmini6->evalexmini7, Arg_1: Arg_1 {O(n)}

  8: evalexmini6->evalexmini7, Arg_2: Arg_2 {O(n)}

  8: evalexmini6->evalexmini7, Arg_3: Arg_3 {O(n)}

  8: evalexmini6->evalexmini7, Arg_4: Arg_4 {O(n)}

  8: evalexmini6->evalexmini7, Arg_5: Arg_5 {O(n)}

  9: evalexmini7->evalexminibb1in, Arg_0: Arg_1 {O(n)}

  9: evalexmini7->evalexminibb1in, Arg_1: Arg_1 {O(n)}

  9: evalexmini7->evalexminibb1in, Arg_2: Arg_3 {O(n)}

  9: evalexmini7->evalexminibb1in, Arg_3: Arg_3 {O(n)}

  9: evalexmini7->evalexminibb1in, Arg_4: Arg_5 {O(n)}

  9: evalexmini7->evalexminibb1in, Arg_5: Arg_5 {O(n)}

  1: evalexminibb0in->evalexmini0, Arg_0: Arg_0 {O(n)}

  1: evalexminibb0in->evalexmini0, Arg_1: Arg_1 {O(n)}

  1: evalexminibb0in->evalexmini0, Arg_2: Arg_2 {O(n)}

  1: evalexminibb0in->evalexmini0, Arg_3: Arg_3 {O(n)}

  1: evalexminibb0in->evalexmini0, Arg_4: Arg_4 {O(n)}

  1: evalexminibb0in->evalexmini0, Arg_5: Arg_5 {O(n)}

  10: evalexminibb1in->evalexminibb2in, Arg_0: min([Arg_3, Arg_1]) {O(n)}

  10: evalexminibb1in->evalexminibb2in, Arg_1: Arg_1 {O(n)}

  10: evalexminibb1in->evalexminibb2in, Arg_2: min([Arg_3, Arg_1]) {O(n)}

  10: evalexminibb1in->evalexminibb2in, Arg_3: Arg_3 {O(n)}

  10: evalexminibb1in->evalexminibb2in, Arg_4: Arg_5-max([0, 101+Arg_5+-(Arg_3)-Arg_1]) {O(n)}

  10: evalexminibb1in->evalexminibb2in, Arg_5: Arg_5 {O(n)}

  11: evalexminibb1in->evalexminibb3in, Arg_0: 101 {O(1)}

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

  11: evalexminibb1in->evalexminibb3in, Arg_2: min([Arg_3, min([Arg_3, Arg_1])]) {O(n)}

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

  11: evalexminibb1in->evalexminibb3in, Arg_4: min([Arg_5, -(-(Arg_5)+max([0, 101+Arg_5+-(Arg_3)-Arg_1]))]) {O(n)}

  11: evalexminibb1in->evalexminibb3in, Arg_5: Arg_5 {O(n)}

  12: evalexminibb1in->evalexminibb3in, Arg_0: min([Arg_1, min([Arg_3, Arg_1])]) {O(n)}

  12: evalexminibb1in->evalexminibb3in, Arg_1: Arg_1 {O(n)}

  12: evalexminibb1in->evalexminibb3in, Arg_2: min([Arg_3, min([Arg_3, Arg_1])]) {O(n)}

  12: evalexminibb1in->evalexminibb3in, Arg_3: Arg_3 {O(n)}

  12: evalexminibb1in->evalexminibb3in, Arg_4: min([Arg_5, -(-(Arg_5)+max([0, 101+Arg_5+-(Arg_3)-Arg_1]))]) {O(n)}

  12: evalexminibb1in->evalexminibb3in, Arg_5: Arg_5 {O(n)}

  13: evalexminibb2in->evalexminibb1in, Arg_0: min([Arg_3, Arg_1]) {O(n)}

  13: evalexminibb2in->evalexminibb1in, Arg_1: Arg_1 {O(n)}

  13: evalexminibb2in->evalexminibb1in, Arg_2: min([Arg_3, Arg_1]) {O(n)}

  13: evalexminibb2in->evalexminibb1in, Arg_3: Arg_3 {O(n)}

  13: evalexminibb2in->evalexminibb1in, Arg_4: Arg_5-max([0, 101+Arg_5+-(Arg_3)-Arg_1]) {O(n)}

  13: evalexminibb2in->evalexminibb1in, Arg_5: Arg_5 {O(n)}

  14: evalexminibb3in->evalexministop, Arg_0: min([101, min([Arg_3, Arg_1])]) {O(n)}

  14: evalexminibb3in->evalexministop, Arg_1: Arg_1 {O(n)}

  14: evalexminibb3in->evalexministop, Arg_2: min([Arg_3, min([Arg_3, Arg_1])]) {O(n)}

  14: evalexminibb3in->evalexministop, Arg_3: Arg_3 {O(n)}

  14: evalexminibb3in->evalexministop, Arg_4: min([Arg_5, -(-(Arg_5)+max([0, 101+Arg_5+-(Arg_3)-Arg_1]))]) {O(n)}

  14: evalexminibb3in->evalexministop, Arg_5: Arg_5 {O(n)}

  0: evalexministart->evalexminibb0in, Arg_0: Arg_0 {O(n)}

  0: evalexministart->evalexminibb0in, Arg_1: Arg_1 {O(n)}

  0: evalexministart->evalexminibb0in, Arg_2: Arg_2 {O(n)}

  0: evalexministart->evalexminibb0in, Arg_3: Arg_3 {O(n)}

  0: evalexministart->evalexminibb0in, Arg_4: Arg_4 {O(n)}

  0: evalexministart->evalexminibb0in, Arg_5: Arg_5 {O(n)}

`Upper:

  2: evalexmini0->evalexmini1, Arg_0: Arg_0 {O(n)}

  2: evalexmini0->evalexmini1, Arg_1: Arg_1 {O(n)}

  2: evalexmini0->evalexmini1, Arg_2: Arg_2 {O(n)}

  2: evalexmini0->evalexmini1, Arg_3: Arg_3 {O(n)}

  2: evalexmini0->evalexmini1, Arg_4: Arg_4 {O(n)}

  2: evalexmini0->evalexmini1, Arg_5: Arg_5 {O(n)}

  3: evalexmini1->evalexmini2, Arg_0: Arg_0 {O(n)}

  3: evalexmini1->evalexmini2, Arg_1: Arg_1 {O(n)}

  3: evalexmini1->evalexmini2, Arg_2: Arg_2 {O(n)}

  3: evalexmini1->evalexmini2, Arg_3: Arg_3 {O(n)}

  3: evalexmini1->evalexmini2, Arg_4: Arg_4 {O(n)}

  3: evalexmini1->evalexmini2, Arg_5: Arg_5 {O(n)}

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

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

  4: evalexmini2->evalexmini3, Arg_2: Arg_2 {O(n)}

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

  4: evalexmini2->evalexmini3, Arg_4: Arg_4 {O(n)}

  4: evalexmini2->evalexmini3, Arg_5: Arg_5 {O(n)}

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

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

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

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

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

  5: evalexmini3->evalexmini4, Arg_5: Arg_5 {O(n)}

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

  6: evalexmini4->evalexmini5, Arg_1: Arg_1 {O(n)}

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

  6: evalexmini4->evalexmini5, Arg_3: Arg_3 {O(n)}

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

  6: evalexmini4->evalexmini5, Arg_5: Arg_5 {O(n)}

  7: evalexmini5->evalexmini6, Arg_0: Arg_0 {O(n)}

  7: evalexmini5->evalexmini6, Arg_1: Arg_1 {O(n)}

  7: evalexmini5->evalexmini6, Arg_2: Arg_2 {O(n)}

  7: evalexmini5->evalexmini6, Arg_3: Arg_3 {O(n)}

  7: evalexmini5->evalexmini6, Arg_4: Arg_4 {O(n)}

  7: evalexmini5->evalexmini6, Arg_5: Arg_5 {O(n)}

  8: evalexmini6->evalexmini7, Arg_0: Arg_0 {O(n)}

  8: evalexmini6->evalexmini7, Arg_1: Arg_1 {O(n)}

  8: evalexmini6->evalexmini7, Arg_2: Arg_2 {O(n)}

  8: evalexmini6->evalexmini7, Arg_3: Arg_3 {O(n)}

  8: evalexmini6->evalexmini7, Arg_4: Arg_4 {O(n)}

  8: evalexmini6->evalexmini7, Arg_5: Arg_5 {O(n)}

  9: evalexmini7->evalexminibb1in, Arg_0: Arg_1 {O(n)}

  9: evalexmini7->evalexminibb1in, Arg_1: Arg_1 {O(n)}

  9: evalexmini7->evalexminibb1in, Arg_2: Arg_3 {O(n)}

  9: evalexmini7->evalexminibb1in, Arg_3: Arg_3 {O(n)}

  9: evalexmini7->evalexminibb1in, Arg_4: Arg_5 {O(n)}

  9: evalexmini7->evalexminibb1in, Arg_5: Arg_5 {O(n)}

  1: evalexminibb0in->evalexmini0, Arg_0: Arg_0 {O(n)}

  1: evalexminibb0in->evalexmini0, Arg_1: Arg_1 {O(n)}

  1: evalexminibb0in->evalexmini0, Arg_2: Arg_2 {O(n)}

  1: evalexminibb0in->evalexmini0, Arg_3: Arg_3 {O(n)}

  1: evalexminibb0in->evalexmini0, Arg_4: Arg_4 {O(n)}

  1: evalexminibb0in->evalexmini0, Arg_5: Arg_5 {O(n)}

  10: evalexminibb1in->evalexminibb2in, Arg_0: 100 {O(1)}

  10: evalexminibb1in->evalexminibb2in, Arg_1: Arg_1 {O(n)}

  10: evalexminibb1in->evalexminibb2in, Arg_2: max([101, Arg_3]) {O(n)}

  10: evalexminibb1in->evalexminibb2in, Arg_3: Arg_3 {O(n)}

  10: evalexminibb1in->evalexminibb2in, Arg_4: Arg_5 {O(n)}

  10: evalexminibb1in->evalexminibb2in, Arg_5: Arg_5 {O(n)}

  11: evalexminibb1in->evalexminibb3in, Arg_0: max([101, max([Arg_1, Arg_3])]) {O(n)}

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

  11: evalexminibb1in->evalexminibb3in, Arg_2: max([101, Arg_3]) {O(n)}

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

  11: evalexminibb1in->evalexminibb3in, Arg_4: Arg_5 {O(n)}

  11: evalexminibb1in->evalexminibb3in, Arg_5: Arg_5 {O(n)}

  12: evalexminibb1in->evalexminibb3in, Arg_0: max([101, max([Arg_1, Arg_3])]) {O(n)}

  12: evalexminibb1in->evalexminibb3in, Arg_1: Arg_1 {O(n)}

  12: evalexminibb1in->evalexminibb3in, Arg_2: max([101, Arg_3]) {O(n)}

  12: evalexminibb1in->evalexminibb3in, Arg_3: Arg_3 {O(n)}

  12: evalexminibb1in->evalexminibb3in, Arg_4: Arg_5 {O(n)}

  12: evalexminibb1in->evalexminibb3in, Arg_5: Arg_5 {O(n)}

  13: evalexminibb2in->evalexminibb1in, Arg_0: max([101, Arg_3]) {O(n)}

  13: evalexminibb2in->evalexminibb1in, Arg_1: Arg_1 {O(n)}

  13: evalexminibb2in->evalexminibb1in, Arg_2: 101 {O(1)}

  13: evalexminibb2in->evalexminibb1in, Arg_3: Arg_3 {O(n)}

  13: evalexminibb2in->evalexminibb1in, Arg_4: Arg_5 {O(n)}

  13: evalexminibb2in->evalexminibb1in, Arg_5: Arg_5 {O(n)}

  14: evalexminibb3in->evalexministop, Arg_0: max([101, max([Arg_1, Arg_3])]) {O(n)}

  14: evalexminibb3in->evalexministop, Arg_1: Arg_1 {O(n)}

  14: evalexminibb3in->evalexministop, Arg_2: max([101, Arg_3]) {O(n)}

  14: evalexminibb3in->evalexministop, Arg_3: Arg_3 {O(n)}

  14: evalexminibb3in->evalexministop, Arg_4: Arg_5 {O(n)}

  14: evalexminibb3in->evalexministop, Arg_5: Arg_5 {O(n)}

  0: evalexministart->evalexminibb0in, Arg_0: Arg_0 {O(n)}

  0: evalexministart->evalexminibb0in, Arg_1: Arg_1 {O(n)}

  0: evalexministart->evalexminibb0in, Arg_2: Arg_2 {O(n)}

  0: evalexministart->evalexminibb0in, Arg_3: Arg_3 {O(n)}

  0: evalexministart->evalexminibb0in, Arg_4: Arg_4 {O(n)}

  0: evalexministart->evalexminibb0in, Arg_5: Arg_5 {O(n)}


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

(2)
BOUNDS(1, max(2, 103 + -1 * Arg_1 + -1 * Arg_3 + Arg_5) + max(11, 112 + -1 * Arg_1 + -1 * Arg_3 + Arg_5))