WORST_CASE(Omega(1),?)

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f80_0_create_LE : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 && -1+arg2==arg2P_1 && 0==arg3P_1 && arg2==arg4P_1 ], cost: 1
      1: f80_0_create_LE -> f108_0_main_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg2<1 && arg3>0 && arg2P_2>arg3 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg4==arg3P_2 ], cost: 1
      2: f80_0_create_LE -> f108_0_main_ArrayAccess : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg2<1 && arg1>0 && arg1P_3>0 && 1==arg2P_3 && arg4==arg3P_3 ], cost: 1
      3: f80_0_create_LE -> f80_0_create_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4<=arg1 && arg2>0 && arg1>0 && arg1P_4>0 && -1+arg2==arg2P_4 && arg4==arg4P_4 ], cost: 1
      4: f108_0_main_ArrayAccess -> f147_0_get_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3>0 && x23_1>-1 && arg1>0 && -1+x23_1==arg1P_5 && arg2==arg2P_5 ], cost: 1
      5: f147_0_get_LE -> f147_0_get_LE : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2>-1 && x27_1>0 && x27_1<arg2 && arg1>0 && x27_1<arg2P_6 && -1+arg1==arg1P_6 ], cost: 1
      6: f147_0_get_LE -> f147_0_get_LE : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && x30_1<arg2 && arg2>-1 && -1+arg1==arg1P_7 && 1==arg2P_7 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f80_0_create_LE : arg1'=arg1P_1, arg2'=-1+arg2, arg3'=0, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f80_0_create_LE -> f108_0_main_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg4, arg4'=arg4P_2, [ arg2<1 && arg3>0 && arg2P_2>arg3 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f80_0_create_LE -> f108_0_main_ArrayAccess : arg1'=arg1P_3, arg2'=1, arg3'=arg4, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg2<1 && arg1>0 && arg1P_3>0 ], cost: 1
      3: f80_0_create_LE -> f80_0_create_LE : arg1'=arg1P_4, arg2'=-1+arg2, arg3'=arg3P_4, [ arg1P_4<=arg1 && arg2>0 && arg1>0 && arg1P_4>0 ], cost: 1
      4: f108_0_main_ArrayAccess -> f147_0_get_LE : arg1'=-1+x23_1, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3>0 && x23_1>-1 && arg1>0 ], cost: 1
      5: f147_0_get_LE -> f147_0_get_LE : arg1'=-1+arg1, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1>0 && 1<=-1+arg2 && 1<=-1+arg2P_6 ], cost: 1
      6: f147_0_get_LE -> f147_0_get_LE : arg1'=-1+arg1, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 1.
   Accelerating the following rules:
      3: f80_0_create_LE -> f80_0_create_LE : arg1'=arg1P_4, arg2'=-1+arg2, arg3'=arg3P_4, [ arg1P_4<=arg1 && arg2>0 && arg1>0 && arg1P_4>0 ], cost: 1

   Accelerated rule 3 with backward acceleration, yielding the new rule 8.
[accelerate] Nesting with 1 inner and 1 outer candidates
   Removing the simple loops: 3.

Accelerating simple loops of location 3.
   Accelerating the following rules:
      5: f147_0_get_LE -> f147_0_get_LE : arg1'=-1+arg1, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1>0 && 1<=-1+arg2 && 1<=-1+arg2P_6 ], cost: 1
      6: f147_0_get_LE -> f147_0_get_LE : arg1'=-1+arg1, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1

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

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f80_0_create_LE : arg1'=arg1P_1, arg2'=-1+arg2, arg3'=0, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
      1: f80_0_create_LE -> f108_0_main_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg4, arg4'=arg4P_2, [ arg2<1 && arg3>0 && arg2P_2>arg3 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f80_0_create_LE -> f108_0_main_ArrayAccess : arg1'=arg1P_3, arg2'=1, arg3'=arg4, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg2<1 && arg1>0 && arg1P_3>0 ], cost: 1
      8: f80_0_create_LE -> f80_0_create_LE : arg1'=arg1P_4, arg2'=0, arg3'=arg3P_4, [ arg1P_4<=arg1 && arg1>0 && arg1P_4>0 && arg2>=1 ], cost: arg2
      4: f108_0_main_ArrayAccess -> f147_0_get_LE : arg1'=-1+x23_1, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3>0 && x23_1>-1 && arg1>0 ], cost: 1
      9: f147_0_get_LE -> f147_0_get_LE : arg1'=0, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ 1<=-1+arg2 && 1<=-1+arg2P_6 && arg1>=1 ], cost: arg1
     10: f147_0_get_LE -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2>-1 && arg1>=1 ], cost: arg1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f80_0_create_LE : arg1'=arg1P_1, arg2'=-1+arg2, arg3'=0, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
     11: f1_0_main_Load -> f80_0_create_LE : arg1'=arg1P_4, arg2'=0, arg3'=arg3P_4, arg4'=arg2, [ arg1>0 && arg1P_4>0 && -1+arg2>=1 && arg1P_4<=arg1 ], cost: arg2
      1: f80_0_create_LE -> f108_0_main_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg4, arg4'=arg4P_2, [ arg2<1 && arg3>0 && arg2P_2>arg3 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f80_0_create_LE -> f108_0_main_ArrayAccess : arg1'=arg1P_3, arg2'=1, arg3'=arg4, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg2<1 && arg1>0 && arg1P_3>0 ], cost: 1
      4: f108_0_main_ArrayAccess -> f147_0_get_LE : arg1'=-1+x23_1, arg3'=arg3P_5, arg4'=arg4P_5, [ arg3>0 && x23_1>-1 && arg1>0 ], cost: 1
     12: f108_0_main_ArrayAccess -> f147_0_get_LE : arg1'=0, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg3>0 && arg1>0 && 1<=-1+arg2 && 1<=-1+arg2P_6 && -1+x23_1>=1 ], cost: x23_1
     13: f108_0_main_ArrayAccess -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3>0 && arg1>0 && arg2>-1 && -1+x23_1>=1 ], cost: x23_1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [], cost: 1

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
      0: f1_0_main_Load -> f80_0_create_LE : arg1'=arg1P_1, arg2'=-1+arg2, arg3'=0, arg4'=arg2, [ arg1P_1<=arg1 && arg2>-1 && arg1>0 && arg1P_1>0 ], cost: 1
     11: f1_0_main_Load -> f80_0_create_LE : arg1'=arg1P_4, arg2'=0, arg3'=arg3P_4, arg4'=arg2, [ arg1>0 && arg1P_4>0 && -1+arg2>=1 && arg1P_4<=arg1 ], cost: arg2
      1: f80_0_create_LE -> f108_0_main_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg4, arg4'=arg4P_2, [ arg2<1 && arg3>0 && arg2P_2>arg3 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1
      2: f80_0_create_LE -> f108_0_main_ArrayAccess : arg1'=arg1P_3, arg2'=1, arg3'=arg4, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg2<1 && arg1>0 && arg1P_3>0 ], cost: 1
     12: f108_0_main_ArrayAccess -> f147_0_get_LE : arg1'=0, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg3>0 && arg1>0 && 1<=-1+arg2 && 1<=-1+arg2P_6 && -1+x23_1>=1 ], cost: x23_1
     13: f108_0_main_ArrayAccess -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg3>0 && arg1>0 && arg2>-1 && -1+x23_1>=1 ], cost: x23_1
      7: __init -> f1_0_main_Load : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     16: f80_0_create_LE -> f147_0_get_LE : arg1'=0, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg2<1 && arg3>0 && arg2P_2>arg3 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg4>0 && 1<=-1+arg2P_2 && 1<=-1+arg2P_6 && -1+x23_1>=1 ], cost: 1+x23_1
     17: f80_0_create_LE -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg2<1 && arg3>0 && arg2P_2>arg3 && arg1P_2<=arg1 && arg1>0 && arg1P_2>0 && arg4>0 && arg2P_2>-1 && -1+x23_1>=1 ], cost: 1+x23_1
     18: f80_0_create_LE -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>=arg1P_3 && arg2<1 && arg1>0 && arg1P_3>0 && arg4>0 && -1+x23_1>=1 ], cost: 1+x23_1
     14: __init -> f80_0_create_LE : arg1'=arg1P_1, arg2'=-1+arg2P_8, arg3'=0, arg4'=arg2P_8, [ arg1P_1<=arg1P_8 && arg2P_8>-1 && arg1P_8>0 && arg1P_1>0 ], cost: 2
     15: __init -> f80_0_create_LE : arg1'=arg1P_4, arg2'=0, arg3'=arg3P_4, arg4'=arg2P_8, [ arg1P_8>0 && arg1P_4>0 && -1+arg2P_8>=1 && arg1P_4<=arg1P_8 ], cost: 1+arg2P_8

Eliminated locations (on tree-shaped paths):
   Start location: __init
     19: __init -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_1<=arg1P_8 && arg1P_8>0 && arg1P_1>0 && arg1P_1>=arg1P_3 && -1+arg2P_8<1 && arg1P_3>0 && arg2P_8>0 && -1+x23_1>=1 ], cost: 3+x23_1
     20: __init -> f147_0_get_LE : arg1'=0, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1P_8>0 && arg1P_4>0 && -1+arg2P_8>=1 && arg1P_4<=arg1P_8 && arg3P_4>0 && arg2P_2>arg3P_4 && arg1P_2<=arg1P_4 && arg1P_2>0 && 1<=-1+arg2P_2 && 1<=-1+arg2P_6 && -1+x23_1>=1 ], cost: 2+x23_1+arg2P_8
     21: __init -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_8>0 && arg1P_4>0 && -1+arg2P_8>=1 && arg1P_4<=arg1P_8 && arg3P_4>0 && arg2P_2>arg3P_4 && arg1P_2<=arg1P_4 && arg1P_2>0 && arg2P_2>-1 && -1+x23_1>=1 ], cost: 2+x23_1+arg2P_8
     22: __init -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_8>0 && arg1P_4>0 && -1+arg2P_8>=1 && arg1P_4<=arg1P_8 && arg1P_4>=arg1P_3 && arg1P_3>0 && -1+x23_1>=1 ], cost: 2+x23_1+arg2P_8

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     19: __init -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_1<=arg1P_8 && arg1P_8>0 && arg1P_1>0 && arg1P_1>=arg1P_3 && -1+arg2P_8<1 && arg1P_3>0 && arg2P_8>0 && -1+x23_1>=1 ], cost: 3+x23_1
     20: __init -> f147_0_get_LE : arg1'=0, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1P_8>0 && arg1P_4>0 && -1+arg2P_8>=1 && arg1P_4<=arg1P_8 && arg3P_4>0 && arg2P_2>arg3P_4 && arg1P_2<=arg1P_4 && arg1P_2>0 && 1<=-1+arg2P_2 && 1<=-1+arg2P_6 && -1+x23_1>=1 ], cost: 2+x23_1+arg2P_8
     21: __init -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_8>0 && arg1P_4>0 && -1+arg2P_8>=1 && arg1P_4<=arg1P_8 && arg3P_4>0 && arg2P_2>arg3P_4 && arg1P_2<=arg1P_4 && arg1P_2>0 && arg2P_2>-1 && -1+x23_1>=1 ], cost: 2+x23_1+arg2P_8
     22: __init -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_8>0 && arg1P_4>0 && -1+arg2P_8>=1 && arg1P_4<=arg1P_8 && arg1P_4>=arg1P_3 && arg1P_3>0 && -1+x23_1>=1 ], cost: 2+x23_1+arg2P_8

Computing asymptotic complexity for rule 22
   Simplified the guard:
     22: __init -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ -1+arg2P_8>=1 && arg1P_4<=arg1P_8 && arg1P_4>=arg1P_3 && arg1P_3>0 && -1+x23_1>=1 ], cost: 2+x23_1+arg2P_8
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 19
   Simplified the guard:
     19: __init -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_1<=arg1P_8 && arg1P_8>0 && arg1P_1>=arg1P_3 && -1+arg2P_8<1 && arg1P_3>0 && arg2P_8>0 && -1+x23_1>=1 ], cost: 3+x23_1
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 21
   Simplified the guard:
     21: __init -> f147_0_get_LE : arg1'=0, arg2'=1, arg3'=arg3P_7, arg4'=arg4P_7, [ -1+arg2P_8>=1 && arg1P_4<=arg1P_8 && arg3P_4>0 && arg2P_2>arg3P_4 && arg1P_2<=arg1P_4 && arg1P_2>0 && -1+x23_1>=1 ], cost: 2+x23_1+arg2P_8
   Resulting cost 0 has complexity: Unknown

Computing asymptotic complexity for rule 20
   Simplified the guard:
     20: __init -> f147_0_get_LE : arg1'=0, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ -1+arg2P_8>=1 && arg1P_4<=arg1P_8 && arg3P_4>0 && arg2P_2>arg3P_4 && arg1P_2<=arg1P_4 && arg1P_2>0 && 1<=-1+arg2P_6 && -1+x23_1>=1 ], cost: 2+x23_1+arg2P_8
   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),?)