NO

Initial ITS
Start location: __init
   0: f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1+arg1P0 <= 0 /\ arg2P0 > 0 /\ 2-arg2 == 0 /\ arg1P0 > 0 /\ 2-arg3P0 == 0 /\ -arg1+arg2P0 <= 0), cost: 1
   1: f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1 > 0 /\ 1-arg3P1 == 0 /\ -arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -arg1+arg2P1 <= 0 /\ 1-arg2 == 0 /\ arg2P1 > 0), cost: 1
   2: f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ arg1-arg2P2 >= 0 /\ arg1P2 > 0 /\ arg3-arg3P2 == 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2 <= 0 /\ arg2 > 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: 1
   3: f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg1 > 0 /\ arg1P3 > 0 /\ -arg1+arg2P3 <= 0 /\ -arg2+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg2 > 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0 /\ arg3-arg3P3 == 0), cost: 1
   4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1


Applied preprocessing
Original rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P0, arg3'=arg3P0, arg2'=arg2P0, (arg1 > 0 /\ -arg1+arg1P0 <= 0 /\ arg2P0 > 0 /\ 2-arg2 == 0 /\ arg1P0 > 0 /\ 2-arg3P0 == 0 /\ -arg1+arg2P0 <= 0), cost: 1
New rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (-arg1+arg1P0 <= 0 /\ arg2P0 > 0 /\ arg1P0 > 0 /\ -2+arg2 == 0 /\ -arg1+arg2P0 <= 0), cost: 1

Applied preprocessing
Original rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P1, arg3'=arg3P1, arg2'=arg2P1, (arg1 > 0 /\ 1-arg3P1 == 0 /\ -arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -arg1+arg2P1 <= 0 /\ 1-arg2 == 0 /\ arg2P1 > 0), cost: 1
New rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P1, arg3'=1, arg2'=arg2P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -arg1+arg2P1 <= 0 /\ -1+arg2 == 0 /\ arg2P1 > 0), cost: 1

Applied preprocessing
Original rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg3'=arg3P2, arg2'=arg2P2, (arg1 > 0 /\ arg1-arg2P2 >= 0 /\ arg1P2 > 0 /\ arg3-arg3P2 == 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2 <= 0 /\ arg2 > 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: 1
New rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (arg1-arg2P2 >= 0 /\ arg1P2 > 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2 <= 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: 1

Applied preprocessing
Original rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg3'=arg3P3, arg2'=arg2P3, (arg1 > 0 /\ arg1P3 > 0 /\ -arg1+arg2P3 <= 0 /\ -arg2+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg2 > 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0 /\ arg3-arg3P3 == 0), cost: 1
New rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg2'=arg2P3, (arg1P3 > 0 /\ -arg1+arg2P3 <= 0 /\ -arg2+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0), cost: 1

Simplified rules
Start location: __init
   5: f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (-arg1+arg1P0 <= 0 /\ arg2P0 > 0 /\ arg1P0 > 0 /\ -2+arg2 == 0 /\ -arg1+arg2P0 <= 0), cost: 1
   6: f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P1, arg3'=1, arg2'=arg2P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -arg1+arg2P1 <= 0 /\ -1+arg2 == 0 /\ arg2P1 > 0), cost: 1
   7: f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (arg1-arg2P2 >= 0 /\ arg1P2 > 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2 <= 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: 1
   8: f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg2'=arg2P3, (arg1P3 > 0 /\ -arg1+arg2P3 <= 0 /\ -arg2+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0), cost: 1
   4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1


Applied acceleration
Original rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (arg1-arg2P2 >= 0 /\ arg1P2 > 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2 <= 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: 1
New rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (-1+n1 >= 0 /\ arg1P2 > 0 /\ arg2-arg2P2 >= 0 /\ arg1-arg1P2 >= 0 /\ arg2P2 > 0 /\ ((arg1P2-arg2P2 >= 0 /\ arg1-arg1P2 >= 0) \/ (arg1-arg2P2 >= 0 /\ arg1P2-arg2P2 >= 0)) /\ ((-arg1P2+arg2 >= 0 /\ -arg1P2+arg2P2 >= 0) \/ (arg2-arg2P2 >= 0 /\ -arg1P2+arg2P2 >= 0))), cost: n1

Applied unrolling
Original rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (arg1-arg2P2 >= 0 /\ arg1P2 > 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2 <= 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: 1
New rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (0 <= 0 /\ 0 >= 0 /\ arg1-arg2P2 >= 0 /\ arg1P2 > 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2 <= 0 /\ arg1P2-arg2P2 <= 0 /\ arg1P2-arg2P2 >= 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: 2

Applied non-termination processor
Original rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (0 <= 0 /\ 0 >= 0 /\ arg1-arg2P2 >= 0 /\ arg1P2 > 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2 <= 0 /\ arg1P2-arg2P2 <= 0 /\ arg1P2-arg2P2 >= 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: 2
New rule:
f151_0_main_InvokeMethod -> [3] : (0 <= 0 /\ 0 >= 0 /\ arg1-arg2P2 >= 0 /\ arg1P2 > 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2 <= 0 /\ arg1P2-arg2P2 <= 0 /\ arg1P2-arg2P2 >= 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: NONTERM

Applied acceleration
Original rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg2'=arg2P3, (arg1P3 > 0 /\ -arg1+arg2P3 <= 0 /\ -arg2+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0), cost: 1
New rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg2'=arg2P3, (arg2-arg2P3 >= 0 /\ arg1P3 > 0 /\ -1+n3 >= 0 /\ arg2P3 > 0 /\ arg1-arg1P3 >= 0 /\ ((arg2-arg2P3 >= 0 /\ -arg1P3+arg2P3 >= 0) \/ (-arg1P3+arg2P3 >= 0 /\ -arg1P3+arg2 >= 0)) /\ ((arg1P3-arg2P3 >= 0 /\ arg1-arg2P3 >= 0) \/ (arg1P3-arg2P3 >= 0 /\ arg1-arg1P3 >= 0))), cost: n3

Applied unrolling
Original rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg2'=arg2P3, (arg1P3 > 0 /\ -arg1+arg2P3 <= 0 /\ -arg2+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0), cost: 1
New rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg2'=arg2P3, (0 <= 0 /\ arg1P3-arg2P3 <= 0 /\ arg1P3 > 0 /\ -arg1+arg2P3 <= 0 /\ -arg1P3+arg2P3 <= 0 /\ -arg2+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0), cost: 2

Applied non-termination processor
Original rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg2'=arg2P3, (0 <= 0 /\ arg1P3-arg2P3 <= 0 /\ arg1P3 > 0 /\ -arg1+arg2P3 <= 0 /\ -arg1P3+arg2P3 <= 0 /\ -arg2+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0), cost: 2
New rule:
f151_0_main_InvokeMethod -> [3] : (0 <= 0 /\ arg1P3-arg2P3 <= 0 /\ arg1P3 > 0 /\ -arg1+arg2P3 <= 0 /\ -arg1P3+arg2P3 <= 0 /\ -arg2+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0), cost: NONTERM

Applied simplification
Original rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (-1+n1 >= 0 /\ arg1P2 > 0 /\ arg2-arg2P2 >= 0 /\ arg1-arg1P2 >= 0 /\ arg2P2 > 0 /\ ((arg1P2-arg2P2 >= 0 /\ arg1-arg1P2 >= 0) \/ (arg1-arg2P2 >= 0 /\ arg1P2-arg2P2 >= 0)) /\ ((-arg1P2+arg2 >= 0 /\ -arg1P2+arg2P2 >= 0) \/ (arg2-arg2P2 >= 0 /\ -arg1P2+arg2P2 >= 0))), cost: n1
New rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (-1+n1 >= 0 /\ arg1-arg2P2 >= 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2P2 >= 0 /\ -arg1P2+arg2P2 >= 0 /\ arg2P2 > 0), cost: n1

Applied simplification
Original rule:
f151_0_main_InvokeMethod -> [3] : (0 <= 0 /\ 0 >= 0 /\ arg1-arg2P2 >= 0 /\ arg1P2 > 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2 <= 0 /\ arg1P2-arg2P2 <= 0 /\ arg1P2-arg2P2 >= 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: NONTERM
New rule:
f151_0_main_InvokeMethod -> [3] : (arg1P2-arg2 <= 0 /\ arg1P2-arg2P2 <= 0 /\ arg1P2-arg2P2 >= 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: NONTERM

Applied simplification
Original rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg2'=arg2P3, (arg2-arg2P3 >= 0 /\ arg1P3 > 0 /\ -1+n3 >= 0 /\ arg2P3 > 0 /\ arg1-arg1P3 >= 0 /\ ((arg2-arg2P3 >= 0 /\ -arg1P3+arg2P3 >= 0) \/ (-arg1P3+arg2P3 >= 0 /\ -arg1P3+arg2 >= 0)) /\ ((arg1P3-arg2P3 >= 0 /\ arg1-arg2P3 >= 0) \/ (arg1P3-arg2P3 >= 0 /\ arg1-arg1P3 >= 0))), cost: n3
New rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg2'=arg2P3, (arg1P3-arg2P3 >= 0 /\ -arg1P3+arg2P3 >= 0 /\ -1+n3 >= 0 /\ arg2P3 > 0 /\ arg1-arg1P3 >= 0 /\ -arg1P3+arg2 >= 0), cost: n3

Applied simplification
Original rule:
f151_0_main_InvokeMethod -> [3] : (0 <= 0 /\ arg1P3-arg2P3 <= 0 /\ arg1P3 > 0 /\ -arg1+arg2P3 <= 0 /\ -arg1P3+arg2P3 <= 0 /\ -arg2+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0), cost: NONTERM
New rule:
f151_0_main_InvokeMethod -> [3] : (arg1P3-arg2P3 <= 0 /\ -arg1P3+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0), cost: NONTERM

Applied deletion
Removed the following rules: 7 8

Accelerated simple loops
Start location: __init
   5: f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (-arg1+arg1P0 <= 0 /\ arg2P0 > 0 /\ arg1P0 > 0 /\ -2+arg2 == 0 /\ -arg1+arg2P0 <= 0), cost: 1
   6: f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P1, arg3'=1, arg2'=arg2P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -arg1+arg2P1 <= 0 /\ -1+arg2 == 0 /\ arg2P1 > 0), cost: 1
  13: f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (-1+n1 >= 0 /\ arg1-arg2P2 >= 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2P2 >= 0 /\ -arg1P2+arg2P2 >= 0 /\ arg2P2 > 0), cost: n1
  14: f151_0_main_InvokeMethod -> [3] : (arg1P2-arg2 <= 0 /\ arg1P2-arg2P2 <= 0 /\ arg1P2-arg2P2 >= 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: NONTERM
  15: f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg2'=arg2P3, (arg1P3-arg2P3 >= 0 /\ -arg1P3+arg2P3 >= 0 /\ -1+n3 >= 0 /\ arg2P3 > 0 /\ arg1-arg1P3 >= 0 /\ -arg1P3+arg2 >= 0), cost: n3
  16: f151_0_main_InvokeMethod -> [3] : (arg1P3-arg2P3 <= 0 /\ -arg1P3+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0), cost: NONTERM
   4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1


Applied chaining
First rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (-arg1+arg1P0 <= 0 /\ arg2P0 > 0 /\ arg1P0 > 0 /\ -2+arg2 == 0 /\ -arg1+arg2P0 <= 0), cost: 1
Second rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (-1+n1 >= 0 /\ arg1-arg2P2 >= 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2P2 >= 0 /\ -arg1P2+arg2P2 >= 0 /\ arg2P2 > 0), cost: n1
New rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg2P2, arg3'=2, arg2'=arg2P2, (-1+n1 >= 0 /\ -arg1+arg2P2 <= 0 /\ -2+arg2 == 0 /\ arg2P2 > 0), cost: 1+n1

Applied chaining
First rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P1, arg3'=1, arg2'=arg2P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -arg1+arg2P1 <= 0 /\ -1+arg2 == 0 /\ arg2P1 > 0), cost: 1
Second rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P2, arg2'=arg2P2, (-1+n1 >= 0 /\ arg1-arg2P2 >= 0 /\ arg2-arg2P2 >= 0 /\ arg1P2-arg2P2 >= 0 /\ -arg1P2+arg2P2 >= 0 /\ arg2P2 > 0), cost: n1
New rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg2P2, arg3'=1, arg2'=arg2P2, (-1+n1 >= 0 /\ -arg1+arg2P2 <= 0 /\ -1+arg2 == 0 /\ arg2P2 > 0), cost: 1+n1

Applied chaining
First rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (-arg1+arg1P0 <= 0 /\ arg2P0 > 0 /\ arg1P0 > 0 /\ -2+arg2 == 0 /\ -arg1+arg2P0 <= 0), cost: 1
Second rule:
f151_0_main_InvokeMethod -> [3] : (arg1P2-arg2 <= 0 /\ arg1P2-arg2P2 <= 0 /\ arg1P2-arg2P2 >= 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: NONTERM
New rule:
f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -2+arg2 == 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P1, arg3'=1, arg2'=arg2P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -arg1+arg2P1 <= 0 /\ -1+arg2 == 0 /\ arg2P1 > 0), cost: 1
Second rule:
f151_0_main_InvokeMethod -> [3] : (arg1P2-arg2 <= 0 /\ arg1P2-arg2P2 <= 0 /\ arg1P2-arg2P2 >= 0 /\ arg2P2 > 0 /\ -arg1+arg1P2 <= 0), cost: NONTERM
New rule:
f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -1+arg2 == 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (-arg1+arg1P0 <= 0 /\ arg2P0 > 0 /\ arg1P0 > 0 /\ -2+arg2 == 0 /\ -arg1+arg2P0 <= 0), cost: 1
Second rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg2'=arg2P3, (arg1P3-arg2P3 >= 0 /\ -arg1P3+arg2P3 >= 0 /\ -1+n3 >= 0 /\ arg2P3 > 0 /\ arg1-arg1P3 >= 0 /\ -arg1P3+arg2 >= 0), cost: n3
New rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg2P3, arg3'=2, arg2'=arg2P3, (-arg1+arg2P3 <= 0 /\ -2+arg2 == 0 /\ -1+n3 >= 0 /\ arg2P3 > 0), cost: 1+n3

Applied chaining
First rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P1, arg3'=1, arg2'=arg2P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -arg1+arg2P1 <= 0 /\ -1+arg2 == 0 /\ arg2P1 > 0), cost: 1
Second rule:
f151_0_main_InvokeMethod -> f151_0_main_InvokeMethod : arg1'=arg1P3, arg2'=arg2P3, (arg1P3-arg2P3 >= 0 /\ -arg1P3+arg2P3 >= 0 /\ -1+n3 >= 0 /\ arg2P3 > 0 /\ arg1-arg1P3 >= 0 /\ -arg1P3+arg2 >= 0), cost: n3
New rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg2P3, arg3'=1, arg2'=arg2P3, (-arg1+arg2P3 <= 0 /\ -1+arg2 == 0 /\ -1+n3 >= 0 /\ arg2P3 > 0), cost: 1+n3

Applied chaining
First rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (-arg1+arg1P0 <= 0 /\ arg2P0 > 0 /\ arg1P0 > 0 /\ -2+arg2 == 0 /\ -arg1+arg2P0 <= 0), cost: 1
Second rule:
f151_0_main_InvokeMethod -> [3] : (arg1P3-arg2P3 <= 0 /\ -arg1P3+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0), cost: NONTERM
New rule:
f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -2+arg2 == 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P1, arg3'=1, arg2'=arg2P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -arg1+arg2P1 <= 0 /\ -1+arg2 == 0 /\ arg2P1 > 0), cost: 1
Second rule:
f151_0_main_InvokeMethod -> [3] : (arg1P3-arg2P3 <= 0 /\ -arg1P3+arg2P3 <= 0 /\ -arg1+arg1P3 <= 0 /\ arg1P3-arg2 <= 0 /\ arg2P3 > 0), cost: NONTERM
New rule:
f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -1+arg2 == 0), cost: NONTERM

Applied deletion
Removed the following rules: 13 14 15 16

Chained accelerated rules with incoming rules
Start location: __init
   5: f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P0, arg3'=2, arg2'=arg2P0, (-arg1+arg1P0 <= 0 /\ arg2P0 > 0 /\ arg1P0 > 0 /\ -2+arg2 == 0 /\ -arg1+arg2P0 <= 0), cost: 1
   6: f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg1P1, arg3'=1, arg2'=arg2P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -arg1+arg2P1 <= 0 /\ -1+arg2 == 0 /\ arg2P1 > 0), cost: 1
  17: f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg2P2, arg3'=2, arg2'=arg2P2, (-1+n1 >= 0 /\ -arg1+arg2P2 <= 0 /\ -2+arg2 == 0 /\ arg2P2 > 0), cost: 1+n1
  18: f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg2P2, arg3'=1, arg2'=arg2P2, (-1+n1 >= 0 /\ -arg1+arg2P2 <= 0 /\ -1+arg2 == 0 /\ arg2P2 > 0), cost: 1+n1
  19: f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -2+arg2 == 0), cost: NONTERM
  20: f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -1+arg2 == 0), cost: NONTERM
  21: f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg2P3, arg3'=2, arg2'=arg2P3, (-arg1+arg2P3 <= 0 /\ -2+arg2 == 0 /\ -1+n3 >= 0 /\ arg2P3 > 0), cost: 1+n3
  22: f1_0_main_ConstantStackPush -> f151_0_main_InvokeMethod : arg1'=arg2P3, arg3'=1, arg2'=arg2P3, (-arg1+arg2P3 <= 0 /\ -1+arg2 == 0 /\ -1+n3 >= 0 /\ arg2P3 > 0), cost: 1+n3
  23: f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -2+arg2 == 0), cost: NONTERM
  24: f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -1+arg2 == 0), cost: NONTERM
   4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1


Removed unreachable locations and irrelevant leafs
Start location: __init
  19: f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -2+arg2 == 0), cost: NONTERM
  20: f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -1+arg2 == 0), cost: NONTERM
  23: f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -2+arg2 == 0), cost: NONTERM
  24: f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -1+arg2 == 0), cost: NONTERM
   4: __init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1


Eliminating location f1_0_main_ConstantStackPush by chaining:

Applied chaining
First rule:
__init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1
Second rule:
f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -2+arg2 == 0), cost: NONTERM
New rule:
__init -> [3] : (-1+arg1P4 >= 0 /\ -2+arg2P4 == 0), cost: NONTERM

Applied chaining
First rule:
__init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1
Second rule:
f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -1+arg2 == 0), cost: NONTERM
New rule:
__init -> [3] : (-1+arg2P4 == 0 /\ -1+arg1P4 >= 0), cost: NONTERM

Applied chaining
First rule:
__init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1
Second rule:
f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -2+arg2 == 0), cost: NONTERM
New rule:
__init -> [3] : (-1+arg1P4 >= 0 /\ -2+arg2P4 == 0), cost: NONTERM

Applied chaining
First rule:
__init -> f1_0_main_ConstantStackPush : arg1'=arg1P4, arg3'=arg3P4, arg2'=arg2P4, TRUE, cost: 1
Second rule:
f1_0_main_ConstantStackPush -> [3] : (-1+arg1 >= 0 /\ -1+arg2 == 0), cost: NONTERM
New rule:
__init -> [3] : (-1+arg2P4 == 0 /\ -1+arg1P4 >= 0), cost: NONTERM

Applied deletion
Removed the following rules: 4 19 20 23 24

Eliminated locations on tree-shaped paths
Start location: __init
  25: __init -> [3] : (-1+arg1P4 >= 0 /\ -2+arg2P4 == 0), cost: NONTERM
  26: __init -> [3] : (-1+arg2P4 == 0 /\ -1+arg1P4 >= 0), cost: NONTERM
  27: __init -> [3] : (-1+arg1P4 >= 0 /\ -2+arg2P4 == 0), cost: NONTERM
  28: __init -> [3] : (-1+arg2P4 == 0 /\ -1+arg1P4 >= 0), cost: NONTERM


Removed duplicate rules (ignoring updates)
Start location: __init
  27: __init -> [3] : (-1+arg1P4 >= 0 /\ -2+arg2P4 == 0), cost: NONTERM
  28: __init -> [3] : (-1+arg2P4 == 0 /\ -1+arg1P4 >= 0), cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 27 via SMT.

Proved the following lower bound
Complexity:  Nonterm
Cpx degree: Nonterm

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  (-1+arg1P4 >= 0 /\ -2+arg2P4 == 0)