WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f213_0_main_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg2>-1 && arg3P_1>-1 && arg1P_1>-1 && arg1>0 ], cost: 1
      1: f213_0_main_GT -> f252_0_main_LE : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, [ arg3<arg2 && arg1==arg1P_2 && arg2==arg2P_2 && arg3==arg3P_2 ], cost: 1
      2: f213_0_main_GT -> f252_0_main_LE : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, [ arg2<=arg3 && arg1>arg3 && arg1==arg1P_3 && arg2==arg2P_3 && arg3==arg3P_3 ], cost: 1
      3: f252_0_main_LE -> f213_0_main_GT : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, [ arg3<arg2 && arg1==arg1P_4 && -1+arg2==arg2P_4 && arg3==arg3P_4 ], cost: 1
      4: f252_0_main_LE -> f213_0_main_GT : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, [ arg3>=arg2 && arg3>=arg1 && arg1==arg1P_5 && arg2==arg2P_5 && arg3==arg3P_5 ], cost: 1
      5: f252_0_main_LE -> f213_0_main_GT : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, [ arg3>=arg2 && arg3<arg1 && -1+arg1==arg1P_6 && arg2==arg2P_6 && arg3==arg3P_6 ], cost: 1
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f213_0_main_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg2>-1 && arg3P_1>-1 && arg1P_1>-1 && arg1>0 ], cost: 1
      1: f213_0_main_GT -> f252_0_main_LE : [ arg3<arg2 ], cost: 1
      2: f213_0_main_GT -> f252_0_main_LE : [ arg2<=arg3 && arg1>arg3 ], cost: 1
      3: f252_0_main_LE -> f213_0_main_GT : arg2'=-1+arg2, [ arg3<arg2 ], cost: 1
      4: f252_0_main_LE -> f213_0_main_GT : [ arg3>=arg2 && arg3>=arg1 ], cost: 1
      5: f252_0_main_LE -> f213_0_main_GT : arg1'=-1+arg1, [ arg3>=arg2 && arg3<arg1 ], cost: 1
      6: __init -> f1_0_main_Load : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: __init
      1: f213_0_main_GT -> f252_0_main_LE : [ arg3<arg2 ], cost: 1
      2: f213_0_main_GT -> f252_0_main_LE : [ arg2<=arg3 && arg1>arg3 ], cost: 1
      3: f252_0_main_LE -> f213_0_main_GT : arg2'=-1+arg2, [ arg3<arg2 ], cost: 1
      4: f252_0_main_LE -> f213_0_main_GT : [ arg3>=arg2 && arg3>=arg1 ], cost: 1
      5: f252_0_main_LE -> f213_0_main_GT : arg1'=-1+arg1, [ arg3>=arg2 && arg3<arg1 ], cost: 1
      7: __init -> f213_0_main_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg2P_7>-1 && arg3P_1>-1 && arg1P_1>-1 && arg1P_7>0 ], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: __init
      8: f213_0_main_GT -> f213_0_main_GT : arg2'=-1+arg2, [ arg3<arg2 ], cost: 2
      9: f213_0_main_GT -> f213_0_main_GT : arg1'=-1+arg1, [ arg2<=arg3 && arg1>arg3 ], cost: 2
      7: __init -> f213_0_main_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg2P_7>-1 && arg3P_1>-1 && arg1P_1>-1 && arg1P_7>0 ], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
      8: f213_0_main_GT -> f213_0_main_GT : arg2'=-1+arg2, [ arg3<arg2 ], cost: 2
      9: f213_0_main_GT -> f213_0_main_GT : arg1'=-1+arg1, [ arg2<=arg3 && arg1>arg3 ], cost: 2

   Accelerated rule 8 with backward acceleration, yielding the new rule 10.
   Accelerated rule 9 with backward acceleration, yielding the new rule 11.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Removing the simple loops: 8 9.

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     10: f213_0_main_GT -> f213_0_main_GT : arg2'=arg3, [ arg2-arg3>=0 ], cost: 2*arg2-2*arg3
     11: f213_0_main_GT -> f213_0_main_GT : arg1'=arg3, [ arg2<=arg3 && -arg3+arg1>=0 ], cost: -2*arg3+2*arg1
      7: __init -> f213_0_main_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg2P_7>-1 && arg3P_1>-1 && arg1P_1>-1 && arg1P_7>0 ], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: __init
      7: __init -> f213_0_main_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg2P_7>-1 && arg3P_1>-1 && arg1P_1>-1 && arg1P_7>0 ], cost: 2
     12: __init -> f213_0_main_GT : arg1'=arg1P_1, arg2'=arg3P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg3P_1>-1 && arg1P_1>-1 && -arg3P_1+arg2P_1>=0 ], cost: 2-2*arg3P_1+2*arg2P_1
     13: __init -> f213_0_main_GT : arg1'=arg3P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg3P_1>-1 && arg1P_1>-1 && arg2P_1<=arg3P_1 && -arg3P_1+arg1P_1>=0 ], cost: 2-2*arg3P_1+2*arg1P_1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     12: __init -> f213_0_main_GT : arg1'=arg1P_1, arg2'=arg3P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg3P_1>-1 && arg1P_1>-1 && -arg3P_1+arg2P_1>=0 ], cost: 2-2*arg3P_1+2*arg2P_1
     13: __init -> f213_0_main_GT : arg1'=arg3P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg3P_1>-1 && arg1P_1>-1 && arg2P_1<=arg3P_1 && -arg3P_1+arg1P_1>=0 ], cost: 2-2*arg3P_1+2*arg1P_1

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     12: __init -> f213_0_main_GT : arg1'=arg1P_1, arg2'=arg3P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg3P_1>-1 && arg1P_1>-1 && -arg3P_1+arg2P_1>=0 ], cost: 2-2*arg3P_1+2*arg2P_1
     13: __init -> f213_0_main_GT : arg1'=arg3P_1, arg2'=arg2P_1, arg3'=arg3P_1, [ arg2P_1>-1 && arg3P_1>-1 && arg1P_1>-1 && arg2P_1<=arg3P_1 && -arg3P_1+arg1P_1>=0 ], cost: 2-2*arg3P_1+2*arg1P_1

Computing asymptotic complexity for rule 12
   Simplified the guard:
     12: __init -> f213_0_main_GT : arg1'=arg1P_1, arg2'=arg3P_1, arg3'=arg3P_1, [ arg3P_1>-1 && arg1P_1>-1 && -arg3P_1+arg2P_1>=0 ], cost: 2-2*arg3P_1+2*arg2P_1
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 13
   Resulting cost 0 has complexity: Unknown

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),?)