NO

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

Initial linear ITS problem
   Start location: l4
      0: l0 -> l1 : A^0'=A^post_1, R^0'=R^post_1, dobreak^0'=dobreak^post_1, n^0'=n^post_1, [ n^0<=0 && R^1_1==0 && R^post_1==0 && dobreak^post_1==dobreak^post_1 && A^0==A^post_1 && n^0==n^post_1 ], cost: 1
      1: l0 -> l2 : A^0'=A^post_2, R^0'=R^post_2, dobreak^0'=dobreak^post_2, n^0'=n^post_2, [ 1<=n^0 && n^post_2==-1+n^0 && A^0==A^post_2 && R^0==R^post_2 && dobreak^0==dobreak^post_2 ], cost: 1
      3: l1 -> l0 : A^0'=A^post_4, R^0'=R^post_4, dobreak^0'=dobreak^post_4, n^0'=n^post_4, [ dobreak^0<=0 && A^1_1==1 && A^post_4==0 && R^0==R^post_4 && dobreak^0==dobreak^post_4 && n^0==n^post_4 ], cost: 1
      2: l2 -> l0 : A^0'=A^post_3, R^0'=R^post_3, dobreak^0'=dobreak^post_3, n^0'=n^post_3, [ A^0==A^post_3 && R^0==R^post_3 && dobreak^0==dobreak^post_3 && n^0==n^post_3 ], cost: 1
      4: l3 -> l1 : A^0'=A^post_5, R^0'=R^post_5, dobreak^0'=dobreak^post_5, n^0'=n^post_5, [ A^post_5==0 && R^post_5==0 && dobreak^post_5==dobreak^post_5 && n^post_5==n^post_5 ], cost: 1
      5: l4 -> l3 : A^0'=A^post_6, R^0'=R^post_6, dobreak^0'=dobreak^post_6, n^0'=n^post_6, [ A^0==A^post_6 && R^0==R^post_6 && dobreak^0==dobreak^post_6 && n^0==n^post_6 ], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      5: l4 -> l3 : A^0'=A^post_6, R^0'=R^post_6, dobreak^0'=dobreak^post_6, n^0'=n^post_6, [ A^0==A^post_6 && R^0==R^post_6 && dobreak^0==dobreak^post_6 && n^0==n^post_6 ], cost: 1

Simplified all rules, resulting in:
   Start location: l4
      0: l0 -> l1 : R^0'=0, dobreak^0'=dobreak^post_1, [ n^0<=0 ], cost: 1
      1: l0 -> l2 : n^0'=-1+n^0, [ 1<=n^0 ], cost: 1
      3: l1 -> l0 : A^0'=0, [ dobreak^0<=0 ], cost: 1
      2: l2 -> l0 : [], cost: 1
      4: l3 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_5, n^0'=n^post_5, [], cost: 1
      5: l4 -> l3 : [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: l4
      0: l0 -> l1 : R^0'=0, dobreak^0'=dobreak^post_1, [ n^0<=0 ], cost: 1
      7: l0 -> l0 : n^0'=-1+n^0, [ 1<=n^0 ], cost: 2
      3: l1 -> l0 : A^0'=0, [ dobreak^0<=0 ], cost: 1
      6: l4 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_5, n^0'=n^post_5, [], cost: 2

Accelerating simple loops of location 0.
   Accelerating the following rules:
      7: l0 -> l0 : n^0'=-1+n^0, [ 1<=n^0 ], cost: 2

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

Accelerated all simple loops using metering functions (where possible):
   Start location: l4
      0: l0 -> l1 : R^0'=0, dobreak^0'=dobreak^post_1, [ n^0<=0 ], cost: 1
      8: l0 -> l0 : n^0'=0, [ n^0>=0 ], cost: 2*n^0
      3: l1 -> l0 : A^0'=0, [ dobreak^0<=0 ], cost: 1
      6: l4 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_5, n^0'=n^post_5, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l4
      0: l0 -> l1 : R^0'=0, dobreak^0'=dobreak^post_1, [ n^0<=0 ], cost: 1
      3: l1 -> l0 : A^0'=0, [ dobreak^0<=0 ], cost: 1
      9: l1 -> l0 : A^0'=0, n^0'=0, [ dobreak^0<=0 && n^0>=0 ], cost: 1+2*n^0
      6: l4 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_5, n^0'=n^post_5, [], cost: 2

Eliminated locations (on tree-shaped paths):
   Start location: l4
     10: l1 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_1, [ dobreak^0<=0 && n^0<=0 ], cost: 2
     11: l1 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_1, n^0'=0, [ dobreak^0<=0 && n^0>=0 ], cost: 2+2*n^0
      6: l4 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_5, n^0'=n^post_5, [], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
     10: l1 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_1, [ dobreak^0<=0 && n^0<=0 ], cost: 2
     11: l1 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_1, n^0'=0, [ dobreak^0<=0 && n^0>=0 ], cost: 2+2*n^0

[test] deduced pseudo-invariant -dobreak^0+dobreak^post_1<=0, also trying dobreak^0-dobreak^post_1<=-1
   Accelerated rule 10 with non-termination, yielding the new rule 12.
   Accelerated rule 10 with non-termination, yielding the new rule 13.
   Accelerated rule 10 with backward acceleration, yielding the new rule 14.
[test] deduced pseudo-invariant -dobreak^0+dobreak^post_1<=0, also trying dobreak^0-dobreak^post_1<=-1
   Accelerated rule 11 with non-termination, yielding the new rule 15.
   Accelerated rule 11 with non-termination, yielding the new rule 16.
   Accelerated rule 11 with backward acceleration, yielding the new rule 17.
[accelerate] Nesting with 0 inner and 2 outer candidates
   Also removing duplicate rules: 13 16.

Accelerated all simple loops using metering functions (where possible):
   Start location: l4
     10: l1 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_1, [ dobreak^0<=0 && n^0<=0 ], cost: 2
     11: l1 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_1, n^0'=0, [ dobreak^0<=0 && n^0>=0 ], cost: 2+2*n^0
     12: l1 -> [6] : [ dobreak^0<=0 && n^0<=0 && dobreak^post_1<=0 ], cost: NONTERM
     14: l1 -> [6] : [ dobreak^0<=0 && n^0<=0 && -dobreak^0+dobreak^post_1<=0 ], cost: NONTERM
     15: l1 -> [6] : [ dobreak^0<=0 && n^0>=0 && dobreak^post_1<=0 ], cost: NONTERM
     17: l1 -> [6] : [ dobreak^0<=0 && n^0>=0 && -dobreak^0+dobreak^post_1<=0 ], cost: NONTERM
      6: l4 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_5, n^0'=n^post_5, [], cost: 2

Chained accelerated rules (with incoming rules):
   Start location: l4
      6: l4 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_5, n^0'=n^post_5, [], cost: 2
     18: l4 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_1, n^0'=n^post_5, [ n^post_5<=0 ], cost: 4
     19: l4 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_1, n^0'=0, [ n^post_5>=0 ], cost: 4+2*n^post_5
     20: l4 -> [6] : [], cost: NONTERM
     21: l4 -> [6] : [], cost: NONTERM
     22: l4 -> [6] : [], cost: NONTERM
     23: l4 -> [6] : [], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: l4
     19: l4 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_1, n^0'=0, [ n^post_5>=0 ], cost: 4+2*n^post_5
     20: l4 -> [6] : [], cost: NONTERM
     21: l4 -> [6] : [], cost: NONTERM
     22: l4 -> [6] : [], cost: NONTERM
     23: l4 -> [6] : [], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: l4
     19: l4 -> l1 : A^0'=0, R^0'=0, dobreak^0'=dobreak^post_1, n^0'=0, [ n^post_5>=0 ], cost: 4+2*n^post_5
     23: l4 -> [6] : [], cost: NONTERM

Computing asymptotic complexity for rule 23
   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:  []

NO