WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f96_0_random_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg1P_1<=arg1 && arg2>0 && arg1>0 && arg1P_1>0 && 0==arg2P_1 ], cost: 1
      1: f1_0_main_Load -> f96_0_random_GT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg2P_2>-1 && arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      4: f1_0_main_Load -> f167_0_log_LT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ arg1>0 && 0==arg2 && 0==arg1P_5 && 0==arg2P_5 && 0==arg3P_5 ], cost: 1
      2: f96_0_random_GT -> f154_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg1>=arg1P_3 && x7_1>1 && arg1>0 && arg1P_3>0 && arg2==arg2P_3 && 0==arg3P_3 ], cost: 1
      3: f96_0_random_GT -> f154_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ x11_1>1 && arg3P_4>-1 && arg1P_4<=arg1 && arg1>0 && arg1P_4>0 && arg2==arg2P_4 ], cost: 1
      5: f96_0_random_GT -> f167_0_log_LT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [ arg1>0 && 0==arg1P_6 && arg2==arg2P_6 && 0==arg3P_6 ], cost: 1
      6: f154_0_main_InvokeMethod -> f167_0_log_LT : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, [ arg1>0 && x19_1>1 && arg3==arg1P_7 && arg2==arg2P_7 && arg3==arg3P_7 ], cost: 1
      7: f167_0_log_LT -> f167_0_log_LT\' : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, [ arg2>1 && arg1>1 && arg2>x28_1 && arg1<=arg2 && arg1==arg3 && arg1==arg1P_8 && arg2==arg2P_8 && arg1==arg3P_8 ], cost: 1
      8: f167_0_log_LT\' -> f167_0_log_LT : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, [ arg2>1 && arg1>1 && arg1<=arg2 && arg2>arg2P_9 && arg1>arg2-arg2P_9*arg1 && arg2-arg2P_9*arg1>=0 && arg1==arg3 && arg1==arg1P_9 && arg1==arg3P_9 ], cost: 1
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f96_0_random_GT : arg1'=arg1P_1, arg2'=0, arg3'=arg3P_1, [ arg1P_1<=arg1 && arg2>0 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f1_0_main_Load -> f96_0_random_GT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg2P_2>-1 && arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      4: f1_0_main_Load -> f167_0_log_LT : arg1'=0, arg2'=0, arg3'=0, [ arg1>0 && 0==arg2 ], cost: 1
      2: f96_0_random_GT -> f154_0_main_InvokeMethod : arg1'=arg1P_3, arg3'=0, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 ], cost: 1
      3: f96_0_random_GT -> f154_0_main_InvokeMethod : arg1'=arg1P_4, arg3'=arg3P_4, [ arg3P_4>-1 && arg1P_4<=arg1 && arg1>0 && arg1P_4>0 ], cost: 1
      5: f96_0_random_GT -> f167_0_log_LT : arg1'=0, arg3'=0, [ arg1>0 ], cost: 1
      6: f154_0_main_InvokeMethod -> f167_0_log_LT : arg1'=arg3, [ arg1>0 ], cost: 1
      7: f167_0_log_LT -> f167_0_log_LT\' : arg3'=arg1, [ arg1>1 && arg1<=arg2 && arg1==arg3 ], cost: 1
      8: f167_0_log_LT\' -> f167_0_log_LT : arg2'=arg2P_9, arg3'=arg1, [ arg1<=arg2 && arg2>arg2P_9 && arg1>arg2-arg2P_9*arg1 && arg2-arg2P_9*arg1>=0 && arg1==arg3 ], cost: 1
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
      0: f1_0_main_Load -> f96_0_random_GT : arg1'=arg1P_1, arg2'=0, arg3'=arg3P_1, [ arg1P_1<=arg1 && arg2>0 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f1_0_main_Load -> f96_0_random_GT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg2P_2>-1 && arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      4: f1_0_main_Load -> f167_0_log_LT : arg1'=0, arg2'=0, arg3'=0, [ arg1>0 && 0==arg2 ], cost: 1
      2: f96_0_random_GT -> f154_0_main_InvokeMethod : arg1'=arg1P_3, arg3'=0, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 ], cost: 1
      3: f96_0_random_GT -> f154_0_main_InvokeMethod : arg1'=arg1P_4, arg3'=arg3P_4, [ arg3P_4>-1 && arg1P_4<=arg1 && arg1>0 && arg1P_4>0 ], cost: 1
      5: f96_0_random_GT -> f167_0_log_LT : arg1'=0, arg3'=0, [ arg1>0 ], cost: 1
      6: f154_0_main_InvokeMethod -> f167_0_log_LT : arg1'=arg3, [ arg1>0 ], cost: 1
     10: f167_0_log_LT -> f167_0_log_LT : arg2'=arg2P_9, arg3'=arg1, [ arg1>1 && arg1<=arg2 && arg1==arg3 && arg2>arg2P_9 && arg1>arg2-arg2P_9*arg1 && arg2-arg2P_9*arg1>=0 ], cost: 2
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 1

Accelerating simple loops of location 3.
   Accelerating the following rules:
     10: f167_0_log_LT -> f167_0_log_LT : arg2'=arg2P_9, arg3'=arg1, [ arg1>1 && arg1<=arg2 && arg1==arg3 && arg2>arg2P_9 && arg1>arg2-arg2P_9*arg1 && arg2-arg2P_9*arg1>=0 ], cost: 2

   Failed to prove monotonicity of the guard of rule 10.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f96_0_random_GT : arg1'=arg1P_1, arg2'=0, arg3'=arg3P_1, [ arg1P_1<=arg1 && arg2>0 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f1_0_main_Load -> f96_0_random_GT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg2P_2>-1 && arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      4: f1_0_main_Load -> f167_0_log_LT : arg1'=0, arg2'=0, arg3'=0, [ arg1>0 && 0==arg2 ], cost: 1
      2: f96_0_random_GT -> f154_0_main_InvokeMethod : arg1'=arg1P_3, arg3'=0, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 ], cost: 1
      3: f96_0_random_GT -> f154_0_main_InvokeMethod : arg1'=arg1P_4, arg3'=arg3P_4, [ arg3P_4>-1 && arg1P_4<=arg1 && arg1>0 && arg1P_4>0 ], cost: 1
      5: f96_0_random_GT -> f167_0_log_LT : arg1'=0, arg3'=0, [ arg1>0 ], cost: 1
      6: f154_0_main_InvokeMethod -> f167_0_log_LT : arg1'=arg3, [ arg1>0 ], cost: 1
     10: f167_0_log_LT -> f167_0_log_LT : arg2'=arg2P_9, arg3'=arg1, [ arg1>1 && arg1<=arg2 && arg1==arg3 && arg2>arg2P_9 && arg1>arg2-arg2P_9*arg1 && arg2-arg2P_9*arg1>=0 ], cost: 2
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f96_0_random_GT : arg1'=arg1P_1, arg2'=0, arg3'=arg3P_1, [ arg1P_1<=arg1 && arg2>0 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f1_0_main_Load -> f96_0_random_GT : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg2P_2>-1 && arg2>0 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      4: f1_0_main_Load -> f167_0_log_LT : arg1'=0, arg2'=0, arg3'=0, [ arg1>0 && 0==arg2 ], cost: 1
      2: f96_0_random_GT -> f154_0_main_InvokeMethod : arg1'=arg1P_3, arg3'=0, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 ], cost: 1
      3: f96_0_random_GT -> f154_0_main_InvokeMethod : arg1'=arg1P_4, arg3'=arg3P_4, [ arg3P_4>-1 && arg1P_4<=arg1 && arg1>0 && arg1P_4>0 ], cost: 1
      5: f96_0_random_GT -> f167_0_log_LT : arg1'=0, arg3'=0, [ arg1>0 ], cost: 1
      6: f154_0_main_InvokeMethod -> f167_0_log_LT : arg1'=arg3, [ arg1>0 ], cost: 1
     11: f154_0_main_InvokeMethod -> f167_0_log_LT : arg1'=arg3, arg2'=arg2P_9, [ arg1>0 && arg3>1 && arg3<=arg2 && arg2>arg2P_9 && arg3>arg2-arg3*arg2P_9 && arg2-arg3*arg2P_9>=0 ], cost: 3
      9: __init -> f1_0_main_Load : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     <empty>

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     <empty>

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Constant
   Cpx degree:  0
   Solved cost: 1
   Rule cost:   1
   Rule guard:  []

WORST_CASE(Omega(1),?)