NO

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

Initial linear ITS problem
   Start location: [0]
      0: [0] -> [1] : [ x>=-1 && y>=-10 ], cost: 1
      1: [1] -> [2] : [ x>=1 && y>=-10 ], cost: 1
      3: [1] -> [3] : [ x<1 ], cost: 1
      4: [1] -> [3] : [ y<-10 ], cost: 1
      2: [2] -> [1] : x'=1+y, z'=x*y, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
      0: [0] -> [1] : [ x>=-1 && y>=-10 ], cost: 1

Removed unreachable and leaf rules:
   Start location: [0]
      0: [0] -> [1] : [ x>=-1 && y>=-10 ], cost: 1
      1: [1] -> [2] : [ x>=1 && y>=-10 ], cost: 1
      2: [2] -> [1] : x'=1+y, z'=x*y, [], cost: 1

### Simplification by acceleration and chaining ###

Eliminated locations (on linear paths):
   Start location: [0]
      0: [0] -> [1] : [ x>=-1 && y>=-10 ], cost: 1
      5: [1] -> [1] : x'=1+y, z'=x*y, [ x>=1 && y>=-10 ], cost: 2

Accelerating simple loops of location 1.
   Accelerating the following rules:
      5: [1] -> [1] : x'=1+y, z'=x*y, [ x>=1 && y>=-10 ], cost: 2

[test] deduced pseudo-invariant -1+x-y<=0, also trying 1-x+y<=-1
   Accelerated rule 5 with non-termination, yielding the new rule 6.
   Accelerated rule 5 with non-termination, yielding the new rule 7.
   Accelerated rule 5 with backward acceleration, yielding the new rule 8.
[accelerate] Nesting with 0 inner and 1 outer candidates
   Also removing duplicate rules: 7.

Accelerated all simple loops using metering functions (where possible):
   Start location: [0]
      0: [0] -> [1] : [ x>=-1 && y>=-10 ], cost: 1
      5: [1] -> [1] : x'=1+y, z'=x*y, [ x>=1 && y>=-10 ], cost: 2
      6: [1] -> [4] : [ x>=1 && 1+y>=1 ], cost: NONTERM
      8: [1] -> [4] : [ x>=1 && y>=-10 && -1+x-y<=0 ], cost: NONTERM

Chained accelerated rules (with incoming rules):
   Start location: [0]
      0: [0] -> [1] : [ x>=-1 && y>=-10 ], cost: 1
      9: [0] -> [1] : x'=1+y, z'=x*y, [ x>=-1 && y>=-10 && x>=1 && y>=-10 ], cost: 3
     10: [0] -> [4] : [ x>=-1 && y>=-10 && x>=1 && 1+y>=1 ], cost: NONTERM
     11: [0] -> [4] : [ x>=-1 && y>=-10 && x>=1 && y>=-10 && -1+x-y<=0 ], cost: NONTERM

Removed unreachable locations (and leaf rules with constant cost):
   Start location: [0]
     10: [0] -> [4] : [ x>=-1 && y>=-10 && x>=1 && 1+y>=1 ], cost: NONTERM
     11: [0] -> [4] : [ x>=-1 && y>=-10 && x>=1 && y>=-10 && -1+x-y<=0 ], cost: NONTERM

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: [0]
     10: [0] -> [4] : [ x>=-1 && y>=-10 && x>=1 && 1+y>=1 ], cost: NONTERM
     11: [0] -> [4] : [ x>=-1 && y>=-10 && x>=1 && y>=-10 && -1+x-y<=0 ], cost: NONTERM

Computing asymptotic complexity for rule 10
   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:  [ x>=-1 && y>=-10 && x>=1 && 1+y>=1 ]

NO