NO

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

Initial linear ITS problem
   Start location: l7
      0: l0 -> l1 : __const_10^0'=__const_10^post_1, __const_5^0'=__const_5^post_1, i^0'=i^post_1, j^0'=j^post_1, [ j^post_1==i^0 && __const_10^0==__const_10^post_1 && __const_5^0==__const_5^post_1 && i^0==i^post_1 ], cost: 1
      1: l1 -> l2 : __const_10^0'=__const_10^post_2, __const_5^0'=__const_5^post_2, i^0'=i^post_2, j^0'=j^post_2, [ i^post_2==1+i^0 && __const_10^0==__const_10^post_2 && __const_5^0==__const_5^post_2 && j^0==j^post_2 ], cost: 1
      7: l2 -> l4 : __const_10^0'=__const_10^post_8, __const_5^0'=__const_5^post_8, i^0'=i^post_8, j^0'=j^post_8, [ __const_10^0==__const_10^post_8 && __const_5^0==__const_5^post_8 && i^0==i^post_8 && j^0==j^post_8 ], cost: 1
      2: l3 -> l0 : __const_10^0'=__const_10^post_3, __const_5^0'=__const_5^post_3, i^0'=i^post_3, j^0'=j^post_3, [ 1+__const_5^0<=i^0 && __const_10^0==__const_10^post_3 && __const_5^0==__const_5^post_3 && i^0==i^post_3 && j^0==j^post_3 ], cost: 1
      3: l3 -> l0 : __const_10^0'=__const_10^post_4, __const_5^0'=__const_5^post_4, i^0'=i^post_4, j^0'=j^post_4, [ 1+i^0<=__const_5^0 && __const_10^0==__const_10^post_4 && __const_5^0==__const_5^post_4 && i^0==i^post_4 && j^0==j^post_4 ], cost: 1
      4: l3 -> l1 : __const_10^0'=__const_10^post_5, __const_5^0'=__const_5^post_5, i^0'=i^post_5, j^0'=j^post_5, [ i^0<=__const_5^0 && __const_5^0<=i^0 && i^post_5==i^post_5 && __const_10^0==__const_10^post_5 && __const_5^0==__const_5^post_5 && j^0==j^post_5 ], cost: 1
      5: l4 -> l5 : __const_10^0'=__const_10^post_6, __const_5^0'=__const_5^post_6, i^0'=i^post_6, j^0'=j^post_6, [ __const_10^0<=i^0 && __const_10^0==__const_10^post_6 && __const_5^0==__const_5^post_6 && i^0==i^post_6 && j^0==j^post_6 ], cost: 1
      6: l4 -> l3 : __const_10^0'=__const_10^post_7, __const_5^0'=__const_5^post_7, i^0'=i^post_7, j^0'=j^post_7, [ 1+i^0<=__const_10^0 && __const_10^0==__const_10^post_7 && __const_5^0==__const_5^post_7 && i^0==i^post_7 && j^0==j^post_7 ], cost: 1
      8: l6 -> l2 : __const_10^0'=__const_10^post_9, __const_5^0'=__const_5^post_9, i^0'=i^post_9, j^0'=j^post_9, [ i^post_9==0 && __const_10^0==__const_10^post_9 && __const_5^0==__const_5^post_9 && j^0==j^post_9 ], cost: 1
      9: l7 -> l6 : __const_10^0'=__const_10^post_10, __const_5^0'=__const_5^post_10, i^0'=i^post_10, j^0'=j^post_10, [ __const_10^0==__const_10^post_10 && __const_5^0==__const_5^post_10 && i^0==i^post_10 && j^0==j^post_10 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      9: l7 -> l6 : __const_10^0'=__const_10^post_10, __const_5^0'=__const_5^post_10, i^0'=i^post_10, j^0'=j^post_10, [ __const_10^0==__const_10^post_10 && __const_5^0==__const_5^post_10 && i^0==i^post_10 && j^0==j^post_10 ], cost: 1

Removed unreachable and leaf rules:
   Start location: l7
      0: l0 -> l1 : __const_10^0'=__const_10^post_1, __const_5^0'=__const_5^post_1, i^0'=i^post_1, j^0'=j^post_1, [ j^post_1==i^0 && __const_10^0==__const_10^post_1 && __const_5^0==__const_5^post_1 && i^0==i^post_1 ], cost: 1
      1: l1 -> l2 : __const_10^0'=__const_10^post_2, __const_5^0'=__const_5^post_2, i^0'=i^post_2, j^0'=j^post_2, [ i^post_2==1+i^0 && __const_10^0==__const_10^post_2 && __const_5^0==__const_5^post_2 && j^0==j^post_2 ], cost: 1
      7: l2 -> l4 : __const_10^0'=__const_10^post_8, __const_5^0'=__const_5^post_8, i^0'=i^post_8, j^0'=j^post_8, [ __const_10^0==__const_10^post_8 && __const_5^0==__const_5^post_8 && i^0==i^post_8 && j^0==j^post_8 ], cost: 1
      2: l3 -> l0 : __const_10^0'=__const_10^post_3, __const_5^0'=__const_5^post_3, i^0'=i^post_3, j^0'=j^post_3, [ 1+__const_5^0<=i^0 && __const_10^0==__const_10^post_3 && __const_5^0==__const_5^post_3 && i^0==i^post_3 && j^0==j^post_3 ], cost: 1
      3: l3 -> l0 : __const_10^0'=__const_10^post_4, __const_5^0'=__const_5^post_4, i^0'=i^post_4, j^0'=j^post_4, [ 1+i^0<=__const_5^0 && __const_10^0==__const_10^post_4 && __const_5^0==__const_5^post_4 && i^0==i^post_4 && j^0==j^post_4 ], cost: 1
      4: l3 -> l1 : __const_10^0'=__const_10^post_5, __const_5^0'=__const_5^post_5, i^0'=i^post_5, j^0'=j^post_5, [ i^0<=__const_5^0 && __const_5^0<=i^0 && i^post_5==i^post_5 && __const_10^0==__const_10^post_5 && __const_5^0==__const_5^post_5 && j^0==j^post_5 ], cost: 1
      6: l4 -> l3 : __const_10^0'=__const_10^post_7, __const_5^0'=__const_5^post_7, i^0'=i^post_7, j^0'=j^post_7, [ 1+i^0<=__const_10^0 && __const_10^0==__const_10^post_7 && __const_5^0==__const_5^post_7 && i^0==i^post_7 && j^0==j^post_7 ], cost: 1
      8: l6 -> l2 : __const_10^0'=__const_10^post_9, __const_5^0'=__const_5^post_9, i^0'=i^post_9, j^0'=j^post_9, [ i^post_9==0 && __const_10^0==__const_10^post_9 && __const_5^0==__const_5^post_9 && j^0==j^post_9 ], cost: 1
      9: l7 -> l6 : __const_10^0'=__const_10^post_10, __const_5^0'=__const_5^post_10, i^0'=i^post_10, j^0'=j^post_10, [ __const_10^0==__const_10^post_10 && __const_5^0==__const_5^post_10 && i^0==i^post_10 && j^0==j^post_10 ], cost: 1

Simplified all rules, resulting in:
   Start location: l7
      0: l0 -> l1 : j^0'=i^0, [], cost: 1
      1: l1 -> l2 : i^0'=1+i^0, [], cost: 1
      7: l2 -> l4 : [], cost: 1
      2: l3 -> l0 : [ 1+__const_5^0<=i^0 ], cost: 1
      3: l3 -> l0 : [ 1+i^0<=__const_5^0 ], cost: 1
      4: l3 -> l1 : i^0'=i^post_5, [ i^0-__const_5^0==0 ], cost: 1
      6: l4 -> l3 : [ 1+i^0<=__const_10^0 ], cost: 1
      8: l6 -> l2 : i^0'=0, [], cost: 1
      9: l7 -> l6 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l7
      0: l0 -> l1 : j^0'=i^0, [], cost: 1
      1: l1 -> l2 : i^0'=1+i^0, [], cost: 1
     11: l2 -> l3 : [ 1+i^0<=__const_10^0 ], cost: 2
      2: l3 -> l0 : [ 1+__const_5^0<=i^0 ], cost: 1
      3: l3 -> l0 : [ 1+i^0<=__const_5^0 ], cost: 1
      4: l3 -> l1 : i^0'=i^post_5, [ i^0-__const_5^0==0 ], cost: 1
     10: l7 -> l2 : i^0'=0, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l7
      0: l0 -> l1 : j^0'=i^0, [], cost: 1
      1: l1 -> l2 : i^0'=1+i^0, [], cost: 1
     12: l2 -> l0 : [ 1+i^0<=__const_10^0 && 1+__const_5^0<=i^0 ], cost: 3
     13: l2 -> l0 : [ 1+i^0<=__const_10^0 && 1+i^0<=__const_5^0 ], cost: 3
     14: l2 -> l1 : i^0'=i^post_5, [ 1+i^0<=__const_10^0 && i^0-__const_5^0==0 ], cost: 3
     10: l7 -> l2 : i^0'=0, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l7
     17: l2 -> l2 : i^0'=1+i^post_5, [ 1+i^0<=__const_10^0 && i^0-__const_5^0==0 ], cost: 4
     18: l2 -> l2 : i^0'=1+i^0, j^0'=i^0, [ 1+i^0<=__const_10^0 && 1+__const_5^0<=i^0 ], cost: 5
     19: l2 -> l2 : i^0'=1+i^0, j^0'=i^0, [ 1+i^0<=__const_10^0 && 1+i^0<=__const_5^0 ], cost: 5
     10: l7 -> l2 : i^0'=0, [], cost: 2

Accelerating simple loops of location 2.
   Accelerating the following rules:
     17: l2 -> l2 : i^0'=1+i^post_5, [ 1+i^0<=__const_10^0 && i^0-__const_5^0==0 ], cost: 4
     18: l2 -> l2 : i^0'=1+i^0, j^0'=i^0, [ 1+i^0<=__const_10^0 && 1+__const_5^0<=i^0 ], cost: 5
     19: l2 -> l2 : i^0'=1+i^0, j^0'=i^0, [ 1+i^0<=__const_10^0 && 1+i^0<=__const_5^0 ], cost: 5

   Accelerated rule 17 with NONTERM (after strengthening guard), yielding the new rule 20.
   Accelerated rule 18 with metering function -i^0+__const_10^0, yielding the new rule 21.
   Found no metering function for rule 19.
   Removing the simple loops: 18.

Accelerated all simple loops using metering functions (where possible):
   Start location: l7
     17: l2 -> l2 : i^0'=1+i^post_5, [ 1+i^0<=__const_10^0 && i^0-__const_5^0==0 ], cost: 4
     19: l2 -> l2 : i^0'=1+i^0, j^0'=i^0, [ 1+i^0<=__const_10^0 && 1+i^0<=__const_5^0 ], cost: 5
     20: l2 -> [8] : [ 1+i^0<=__const_10^0 && i^0-__const_5^0==0 && 2+i^post_5<=__const_10^0 && 1+i^post_5-__const_5^0==0 ], cost: NONTERM
     21: l2 -> l2 : i^0'=__const_10^0, j^0'=-1+__const_10^0, [ 1+i^0<=__const_10^0 && 1+__const_5^0<=i^0 ], cost: -5*i^0+5*__const_10^0
     10: l7 -> l2 : i^0'=0, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l7
     10: l7 -> l2 : i^0'=0, [], cost: 2
     22: l7 -> l2 : i^0'=1+i^post_5, [ 1<=__const_10^0 && -__const_5^0==0 ], cost: 6
     23: l7 -> l2 : i^0'=1, j^0'=0, [ 1<=__const_10^0 && 1<=__const_5^0 ], cost: 7
     24: l7 -> [8] : i^0'=0, [ 1<=__const_10^0 && -__const_5^0==0 && 1+__const_5^0<=__const_10^0 ], cost: NONTERM
     25: l7 -> l2 : i^0'=__const_10^0, j^0'=-1+__const_10^0, [ 1<=__const_10^0 && 1+__const_5^0<=0 ], cost: 2+5*__const_10^0

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l7
     24: l7 -> [8] : i^0'=0, [ 1<=__const_10^0 && -__const_5^0==0 && 1+__const_5^0<=__const_10^0 ], cost: NONTERM
     25: l7 -> l2 : i^0'=__const_10^0, j^0'=-1+__const_10^0, [ 1<=__const_10^0 && 1+__const_5^0<=0 ], cost: 2+5*__const_10^0

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l7
     24: l7 -> [8] : i^0'=0, [ 1<=__const_10^0 && -__const_5^0==0 && 1+__const_5^0<=__const_10^0 ], cost: NONTERM
     25: l7 -> l2 : i^0'=__const_10^0, j^0'=-1+__const_10^0, [ 1<=__const_10^0 && 1+__const_5^0<=0 ], cost: 2+5*__const_10^0

Computing asymptotic complexity for rule 24
   Guard is satisfiable, yielding nontermination
   Resulting cost NONTERM has complexity: Nonterm

Found new complexity Nonterm.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Nonterm
   Cpx degree:  Nonterm
   Solved cost: NONTERM
   Rule cost:   NONTERM
   Rule guard:  [ 1<=__const_10^0 && -__const_5^0==0 ]

NO