NO

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ arg1 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
   1: f1_0_main_Load -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (-arg1+arg1P1 <= 0 /\ arg1 > 0 /\ arg1P1 > 0 /\ -2+arg2P1 > 0), cost: 1
   4: f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1-arg4P4 == 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1
  11: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0 /\ -1+arg1 > 0), cost: 1
  12: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ -2+arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0), cost: 1
   3: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (x140 > 0 /\ -2+arg2 > 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
   2: f456_0_createTree_Return -> f1795_0_main_InvokeMethod : arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, (arg1P2 > 0 /\ -arg2+arg2P2 <= 0 /\ -2+arg2 > 0 /\ -2+arg2P2 > 0 /\ 2-arg2+arg3 <= 0 /\ -arg1P2+arg1 >= 0 /\ arg1 > 0 /\ -arg3P2+arg3 == 0 /\ 2+arg1P2-arg2 <= 0), cost: 1
   5: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (-2+arg1 > 0 /\ 1+arg4-arg4P5 == 0 /\ -2+arg1P5 > 0 /\ arg2P5 > 0 /\ -2+arg2 > 0 /\ 2-arg2+arg2P5 <= 0 /\ -1+arg3-arg3P5 == 0 /\ -arg1+arg1P5 <= 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1
   6: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, (-2+arg1 > 0 /\ -2+arg1P6 > 0 /\ arg2P6 > 0 /\ -2+arg2 > 0 /\ 2-arg2+arg2P6 <= 0 /\ x360 > 0 /\ 1+arg4-arg4P6 == 0 /\ -1+arg3-arg3P6 == 0 /\ arg3 > 0 /\ -arg1+arg1P6 <= 0 /\ 1+arg4 > 0), cost: 1
   7: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=arg4P7, arg1'=arg1P7, arg3'=arg3P7, (x430 > 0 /\ -2+arg1 > 0 /\ -2+arg2P7 > 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ 1+arg4-arg4P7 == 0 /\ arg3 > 0 /\ -1-arg3P7+arg3 == 0 /\ 1+arg4 > 0), cost: 1
   8: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=arg4P8, arg1'=arg1P8, arg3'=arg3P8, (-2+arg1 > 0 /\ 1-arg4P8+arg4 == 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ arg3 > 0 /\ -1-arg3P8+arg3 == 0 /\ 1+arg4 > 0), cost: 1
   9: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=arg4P9, arg1'=arg1P9, arg3'=arg3P9, (-2+arg1 > 0 /\ -2+arg1P9-arg1 <= 0 /\ -4+arg2P9 > 0 /\ -2+arg2 > 0 /\ 1-arg4P9+arg4 == 0 /\ -1-arg3P9+arg3 == 0 /\ -2-arg2+arg1P9 <= 0 /\ -4+arg1P9 > 0 /\ -2+arg2P9-arg1 <= 0 /\ arg3 > 0 /\ -2+arg2P9-arg2 <= 0 /\ 1+arg4 > 0), cost: 1
  10: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P10, (-2+arg1 > 0 /\ -2-arg2+arg2P10 <= 0 /\ -4+arg2P10 > 0 /\ -2+arg2 > 0 /\ -2+arg2P10-arg1 <= 0 /\ -2+arg1P10-arg1 <= 0 /\ 1+arg4-arg4P10 == 0 /\ arg3 > 0 /\ -1-arg3P10+arg3 == 0 /\ -2-arg2+arg1P10 <= 0 /\ -4+arg1P10 > 0 /\ x620 > 0 /\ 1+arg4 > 0), cost: 1
  13: __init -> f1_0_main_Load : arg2'=arg2P13, arg4'=arg4P13, arg1'=arg1P13, arg3'=arg3P13, TRUE, cost: 1


Removed unreachable rules and leafs
Start location: __init
   0: f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ arg1 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
   1: f1_0_main_Load -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (-arg1+arg1P1 <= 0 /\ arg1 > 0 /\ arg1P1 > 0 /\ -2+arg2P1 > 0), cost: 1
   4: f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1-arg4P4 == 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1
  11: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0 /\ -1+arg1 > 0), cost: 1
  12: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ -2+arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0), cost: 1
   3: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (x140 > 0 /\ -2+arg2 > 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
   5: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (-2+arg1 > 0 /\ 1+arg4-arg4P5 == 0 /\ -2+arg1P5 > 0 /\ arg2P5 > 0 /\ -2+arg2 > 0 /\ 2-arg2+arg2P5 <= 0 /\ -1+arg3-arg3P5 == 0 /\ -arg1+arg1P5 <= 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1
   6: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, (-2+arg1 > 0 /\ -2+arg1P6 > 0 /\ arg2P6 > 0 /\ -2+arg2 > 0 /\ 2-arg2+arg2P6 <= 0 /\ x360 > 0 /\ 1+arg4-arg4P6 == 0 /\ -1+arg3-arg3P6 == 0 /\ arg3 > 0 /\ -arg1+arg1P6 <= 0 /\ 1+arg4 > 0), cost: 1
   7: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=arg4P7, arg1'=arg1P7, arg3'=arg3P7, (x430 > 0 /\ -2+arg1 > 0 /\ -2+arg2P7 > 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ 1+arg4-arg4P7 == 0 /\ arg3 > 0 /\ -1-arg3P7+arg3 == 0 /\ 1+arg4 > 0), cost: 1
   8: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=arg4P8, arg1'=arg1P8, arg3'=arg3P8, (-2+arg1 > 0 /\ 1-arg4P8+arg4 == 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ arg3 > 0 /\ -1-arg3P8+arg3 == 0 /\ 1+arg4 > 0), cost: 1
   9: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=arg4P9, arg1'=arg1P9, arg3'=arg3P9, (-2+arg1 > 0 /\ -2+arg1P9-arg1 <= 0 /\ -4+arg2P9 > 0 /\ -2+arg2 > 0 /\ 1-arg4P9+arg4 == 0 /\ -1-arg3P9+arg3 == 0 /\ -2-arg2+arg1P9 <= 0 /\ -4+arg1P9 > 0 /\ -2+arg2P9-arg1 <= 0 /\ arg3 > 0 /\ -2+arg2P9-arg2 <= 0 /\ 1+arg4 > 0), cost: 1
  10: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P10, (-2+arg1 > 0 /\ -2-arg2+arg2P10 <= 0 /\ -4+arg2P10 > 0 /\ -2+arg2 > 0 /\ -2+arg2P10-arg1 <= 0 /\ -2+arg1P10-arg1 <= 0 /\ 1+arg4-arg4P10 == 0 /\ arg3 > 0 /\ -1-arg3P10+arg3 == 0 /\ -2-arg2+arg1P10 <= 0 /\ -4+arg1P10 > 0 /\ x620 > 0 /\ 1+arg4 > 0), cost: 1
  13: __init -> f1_0_main_Load : arg2'=arg2P13, arg4'=arg4P13, arg1'=arg1P13, arg3'=arg3P13, TRUE, cost: 1


Applied preprocessing
Original rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ arg1 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
New rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1

Applied preprocessing
Original rule:
f1_0_main_Load -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (-arg1+arg1P1 <= 0 /\ arg1 > 0 /\ arg1P1 > 0 /\ -2+arg2P1 > 0), cost: 1
New rule:
f1_0_main_Load -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -2+arg2P1 > 0), cost: 1

Applied preprocessing
Original rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (x140 > 0 /\ -2+arg2 > 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
New rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1

Applied preprocessing
Original rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1-arg4P4 == 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1
New rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=1, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1+arg2 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1

Applied preprocessing
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (-2+arg1 > 0 /\ 1+arg4-arg4P5 == 0 /\ -2+arg1P5 > 0 /\ arg2P5 > 0 /\ -2+arg2 > 0 /\ 2-arg2+arg2P5 <= 0 /\ -1+arg3-arg3P5 == 0 /\ -arg1+arg1P5 <= 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P5, arg4'=1+arg4, arg1'=arg1P5, arg3'=-1+arg3, (-2+arg1P5 > 0 /\ arg2P5 > 0 /\ 2-arg2+arg2P5 <= 0 /\ -arg1+arg1P5 <= 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1

Applied preprocessing
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, (-2+arg1 > 0 /\ -2+arg1P6 > 0 /\ arg2P6 > 0 /\ -2+arg2 > 0 /\ 2-arg2+arg2P6 <= 0 /\ x360 > 0 /\ 1+arg4-arg4P6 == 0 /\ -1+arg3-arg3P6 == 0 /\ arg3 > 0 /\ -arg1+arg1P6 <= 0 /\ 1+arg4 > 0), cost: 1
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P6, arg4'=1+arg4, arg1'=arg1P6, arg3'=-1+arg3, (-2+arg1P6 > 0 /\ arg2P6 > 0 /\ 2-arg2+arg2P6 <= 0 /\ arg3 > 0 /\ -arg1+arg1P6 <= 0 /\ 1+arg4 > 0), cost: 1

Applied preprocessing
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=arg4P7, arg1'=arg1P7, arg3'=arg3P7, (x430 > 0 /\ -2+arg1 > 0 /\ -2+arg2P7 > 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ 1+arg4-arg4P7 == 0 /\ arg3 > 0 /\ -1-arg3P7+arg3 == 0 /\ 1+arg4 > 0), cost: 1
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=1+arg4, arg1'=arg1P7, arg3'=-1+arg3, (-2+arg1 > 0 /\ -2+arg2P7 > 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1

Applied preprocessing
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=arg4P8, arg1'=arg1P8, arg3'=arg3P8, (-2+arg1 > 0 /\ 1-arg4P8+arg4 == 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ arg3 > 0 /\ -1-arg3P8+arg3 == 0 /\ 1+arg4 > 0), cost: 1
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=1+arg4, arg1'=arg1P8, arg3'=-1+arg3, (-2+arg1 > 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1

Applied preprocessing
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=arg4P9, arg1'=arg1P9, arg3'=arg3P9, (-2+arg1 > 0 /\ -2+arg1P9-arg1 <= 0 /\ -4+arg2P9 > 0 /\ -2+arg2 > 0 /\ 1-arg4P9+arg4 == 0 /\ -1-arg3P9+arg3 == 0 /\ -2-arg2+arg1P9 <= 0 /\ -4+arg1P9 > 0 /\ -2+arg2P9-arg1 <= 0 /\ arg3 > 0 /\ -2+arg2P9-arg2 <= 0 /\ 1+arg4 > 0), cost: 1
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=1+arg4, arg1'=arg1P9, arg3'=-1+arg3, (-2+arg1P9-arg1 <= 0 /\ -4+arg2P9 > 0 /\ -2-arg2+arg1P9 <= 0 /\ -4+arg1P9 > 0 /\ -2+arg2P9-arg1 <= 0 /\ arg3 > 0 /\ -2+arg2P9-arg2 <= 0 /\ 1+arg4 > 0), cost: 1

Applied preprocessing
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P10, (-2+arg1 > 0 /\ -2-arg2+arg2P10 <= 0 /\ -4+arg2P10 > 0 /\ -2+arg2 > 0 /\ -2+arg2P10-arg1 <= 0 /\ -2+arg1P10-arg1 <= 0 /\ 1+arg4-arg4P10 == 0 /\ arg3 > 0 /\ -1-arg3P10+arg3 == 0 /\ -2-arg2+arg1P10 <= 0 /\ -4+arg1P10 > 0 /\ x620 > 0 /\ 1+arg4 > 0), cost: 1
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=1+arg4, arg1'=arg1P10, arg3'=-1+arg3, (-2-arg2+arg2P10 <= 0 /\ -4+arg2P10 > 0 /\ -2+arg2P10-arg1 <= 0 /\ -2+arg1P10-arg1 <= 0 /\ arg3 > 0 /\ -2-arg2+arg1P10 <= 0 /\ -4+arg1P10 > 0 /\ 1+arg4 > 0), cost: 1

Applied preprocessing
Original rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0 /\ -1+arg1 > 0), cost: 1
New rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 1

Simplified rules
Start location: __init
  14: f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
  15: f1_0_main_Load -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -2+arg2P1 > 0), cost: 1
  17: f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=1, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1+arg2 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1
  12: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ -2+arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0), cost: 1
  24: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 1
  16: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
  18: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P5, arg4'=1+arg4, arg1'=arg1P5, arg3'=-1+arg3, (-2+arg1P5 > 0 /\ arg2P5 > 0 /\ 2-arg2+arg2P5 <= 0 /\ -arg1+arg1P5 <= 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1
  19: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P6, arg4'=1+arg4, arg1'=arg1P6, arg3'=-1+arg3, (-2+arg1P6 > 0 /\ arg2P6 > 0 /\ 2-arg2+arg2P6 <= 0 /\ arg3 > 0 /\ -arg1+arg1P6 <= 0 /\ 1+arg4 > 0), cost: 1
  20: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=1+arg4, arg1'=arg1P7, arg3'=-1+arg3, (-2+arg1 > 0 /\ -2+arg2P7 > 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1
  21: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=1+arg4, arg1'=arg1P8, arg3'=-1+arg3, (-2+arg1 > 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1
  22: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=1+arg4, arg1'=arg1P9, arg3'=-1+arg3, (-2+arg1P9-arg1 <= 0 /\ -4+arg2P9 > 0 /\ -2-arg2+arg1P9 <= 0 /\ -4+arg1P9 > 0 /\ -2+arg2P9-arg1 <= 0 /\ arg3 > 0 /\ -2+arg2P9-arg2 <= 0 /\ 1+arg4 > 0), cost: 1
  23: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=1+arg4, arg1'=arg1P10, arg3'=-1+arg3, (-2-arg2+arg2P10 <= 0 /\ -4+arg2P10 > 0 /\ -2+arg2P10-arg1 <= 0 /\ -2+arg1P10-arg1 <= 0 /\ arg3 > 0 /\ -2-arg2+arg1P10 <= 0 /\ -4+arg1P10 > 0 /\ 1+arg4 > 0), cost: 1
  13: __init -> f1_0_main_Load : arg2'=arg2P13, arg4'=arg4P13, arg1'=arg1P13, arg3'=arg3P13, TRUE, cost: 1


Applied acceleration
Original rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ -2+arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0), cost: 1
New rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -1+n >= 0), cost: n
Sub-proof via acceration calculus written to file:///tmp/tmpnam_cjgMmM.txt

Applied nonterm
Original rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ -2+arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0), cost: 1
New rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -arg1P12+arg1 <= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_OfnAFk.txt

Applied chaining
First rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ -2+arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0), cost: 1
New rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0 /\ 5-arg1 <= 0), cost: 2

Applied acceleration
Original rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0 /\ 5-arg1 <= 0), cost: 2
New rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-5+arg1P12 >= 0 /\ -1+n1 >= 0 /\ -2+arg1P12 > 0 /\ -arg1P12+arg1 >= 0), cost: 2*n1
Sub-proof via acceration calculus written to file:///tmp/tmpnam_KNjCKB.txt

Applied nonterm
Original rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0 /\ 5-arg1 <= 0), cost: 2
New rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1P12 > 0 /\ -arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_gLkfJH.txt

Applied chaining
First rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ -2+arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1P12 > 0 /\ -arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (0 <= 0 /\ 0 >= 0 /\ -5+arg1P12 >= 0 /\ -2+arg1 > 0 /\ -2+arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0), cost: NONTERM

Applied chaining
First rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ -2+arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 1
New rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (-2+arg1 > 0 /\ -arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 2

Applied acceleration
Original rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (-2+arg1 > 0 /\ -arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 2
New rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (arg1-arg1P11 >= 0 /\ -1+n2 >= 0 /\ -2+arg1P11 > 0 /\ 1+arg1P11 > 0), cost: 2*n2
Sub-proof via acceration calculus written to file:///tmp/tmpnam_LIkmnG.txt

Applied nonterm
Original rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (-2+arg1 > 0 /\ -arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 2
New rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0 /\ 1+arg1P11 > 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_jDlDFF.txt

Applied chaining
First rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0 /\ 1+arg1P11 > 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (0 <= 0 /\ 0 >= 0 /\ 2-arg1+arg1P11 <= 0 /\ -2+arg1P11 > 0 /\ 1+arg1P11 > 0), cost: NONTERM

Applied chaining
First rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -1+n >= 0), cost: n
New rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0 /\ 5-arg1 <= 0 /\ -1+n >= 0), cost: 1+n

Applied acceleration
Original rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0 /\ 5-arg1 <= 0 /\ -1+n >= 0), cost: 1+n
New rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-5+arg1P12 >= 0 /\ -2+arg1P12 > 0 /\ -arg1P12+arg1 >= 0 /\ -1+n3 >= 0 /\ -1+n >= 0), cost: n3+n*n3
Sub-proof via acceration calculus written to file:///tmp/tmpnam_eAaLLd.txt

Applied nonterm
Original rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0 /\ 5-arg1 <= 0 /\ -1+n >= 0), cost: 1+n
New rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1P12 > 0 /\ -arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0 /\ -1+n >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_edKGBG.txt

Applied chaining
First rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -1+n >= 0), cost: n
Second rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1P12 > 0 /\ -arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (0 <= 0 /\ 0 >= 0 /\ -5+arg1P12 >= 0 /\ -2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -1+n >= 0), cost: NONTERM

Applied chaining
First rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -1+n >= 0), cost: n
Second rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 1
New rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (-2+arg1 > 0 /\ -arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0 /\ -1+n >= 0), cost: 1+n

Applied acceleration
Original rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (-2+arg1 > 0 /\ -arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0 /\ -1+n >= 0), cost: 1+n
New rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (arg1-arg1P11 >= 0 /\ -1+n4 >= 0 /\ -2+arg1P11 > 0 /\ 1+arg1P11 > 0 /\ -1+n >= 0), cost: n4+n4*n
Sub-proof via acceration calculus written to file:///tmp/tmpnam_DmLGnH.txt

Applied nonterm
Original rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (-2+arg1 > 0 /\ -arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0 /\ -1+n >= 0), cost: 1+n
New rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0 /\ 1+arg1P11 > 0 /\ -1+n >= 0), cost: NONTERM
Sub-proof via acceration calculus written to file:///tmp/tmpnam_fKDNie.txt

Applied chaining
First rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0 /\ 1+arg1P11 > 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (0 <= 0 /\ 0 >= 0 /\ 2-arg1+arg1P11 <= 0 /\ -2+arg1P11 > 0 /\ 1+arg1P11 > 0 /\ -1+n >= 0), cost: NONTERM

Applied simplification
Original rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -arg1P12+arg1 <= 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -arg1P12+arg1 <= 0), cost: NONTERM

Applied simplification
Original rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1P12 > 0 /\ -arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (-arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0), cost: NONTERM

Applied simplification
Original rule:
f2097_0_flatten_NULL -> [6] : (0 <= 0 /\ 0 >= 0 /\ -5+arg1P12 >= 0 /\ -2+arg1 > 0 /\ -2+arg1P12-arg1 <= 0 /\ -2+arg1P12 > 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (-5+arg1P12 >= 0 /\ -2+arg1P12-arg1 <= 0), cost: NONTERM

Applied simplification
Original rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0 /\ 1+arg1P11 > 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0), cost: NONTERM

Applied simplification
Original rule:
f2097_0_flatten_NULL -> [6] : (0 <= 0 /\ 0 >= 0 /\ 2-arg1+arg1P11 <= 0 /\ -2+arg1P11 > 0 /\ 1+arg1P11 > 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (2-arg1+arg1P11 <= 0 /\ -2+arg1P11 > 0), cost: NONTERM

Applied simplification
Original rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1P12 > 0 /\ -arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (-arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0 /\ -1+n >= 0), cost: NONTERM

Applied simplification
Original rule:
f2097_0_flatten_NULL -> [6] : (0 <= 0 /\ 0 >= 0 /\ -5+arg1P12 >= 0 /\ -2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (-5+arg1P12 >= 0 /\ 2-arg1P12+arg1 >= 0 /\ -1+n >= 0), cost: NONTERM

Applied simplification
Original rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0 /\ 1+arg1P11 > 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0 /\ -1+n >= 0), cost: NONTERM

Applied simplification
Original rule:
f2097_0_flatten_NULL -> [6] : (0 <= 0 /\ 0 >= 0 /\ 2-arg1+arg1P11 <= 0 /\ -2+arg1P11 > 0 /\ 1+arg1P11 > 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f2097_0_flatten_NULL -> [6] : (2-arg1+arg1P11 <= 0 /\ -2+arg1P11 > 0 /\ -1+n >= 0), cost: NONTERM

Applied deletion
Removed the following rules: 12

Applied acceleration
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=1+arg4, arg1'=arg1P7, arg3'=-1+arg3, (-2+arg1 > 0 /\ -2+arg2P7 > 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=arg4+n7, arg1'=arg1P7, arg3'=-n7+arg3, (-2+arg1 > 0 /\ -2+arg2P7 > 0 /\ 1-n7+arg3 > 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ 1+arg4 > 0 /\ -1+n7 >= 0), cost: n7
Sub-proof via acceration calculus written to file:///tmp/tmpnam_DlGNiO.txt

Applied instantiation
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=arg4+n7, arg1'=arg1P7, arg3'=-n7+arg3, (-2+arg1 > 0 /\ -2+arg2P7 > 0 /\ 1-n7+arg3 > 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ 1+arg4 > 0 /\ -1+n7 >= 0), cost: n7
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=arg4+arg3, arg1'=arg1P7, arg3'=0, (-2+arg1 > 0 /\ 1 > 0 /\ -2+arg2P7 > 0 /\ -1+arg3 >= 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ 1+arg4 > 0), cost: arg3

Applied acceleration
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=1+arg4, arg1'=arg1P8, arg3'=-1+arg3, (-2+arg1 > 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=n8+arg4, arg1'=arg1P8, arg3'=-n8+arg3, (-2+arg1 > 0 /\ 1-n8+arg3 > 0 /\ -1+n8 >= 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ 1+arg4 > 0), cost: n8
Sub-proof via acceration calculus written to file:///tmp/tmpnam_dMcbbh.txt

Applied instantiation
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=n8+arg4, arg1'=arg1P8, arg3'=-n8+arg3, (-2+arg1 > 0 /\ 1-n8+arg3 > 0 /\ -1+n8 >= 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ 1+arg4 > 0), cost: n8
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=arg4+arg3, arg1'=arg1P8, arg3'=0, (-2+arg1 > 0 /\ 1 > 0 /\ -1+arg3 >= 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ 1+arg4 > 0), cost: arg3

Applied acceleration
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=1+arg4, arg1'=arg1P9, arg3'=-1+arg3, (-2+arg1P9-arg1 <= 0 /\ -4+arg2P9 > 0 /\ -2-arg2+arg1P9 <= 0 /\ -4+arg1P9 > 0 /\ -2+arg2P9-arg1 <= 0 /\ arg3 > 0 /\ -2+arg2P9-arg2 <= 0 /\ 1+arg4 > 0), cost: 1
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=arg4+n9, arg1'=arg1P9, arg3'=-n9+arg3, (2-arg1P9+arg1 >= 0 /\ -1+n9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -4+arg2P9 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ -4+arg1P9 > 0 /\ 2-arg2P9+arg1 >= 0 /\ 2-arg2P9+arg2 >= 0 /\ 1-n9+arg3 > 0 /\ 1+arg4 > 0), cost: n9
Sub-proof via acceration calculus written to file:///tmp/tmpnam_EAFfdE.txt

Applied instantiation
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=arg4+n9, arg1'=arg1P9, arg3'=-n9+arg3, (2-arg1P9+arg1 >= 0 /\ -1+n9 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -4+arg2P9 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ -4+arg1P9 > 0 /\ 2-arg2P9+arg1 >= 0 /\ 2-arg2P9+arg2 >= 0 /\ 1-n9+arg3 > 0 /\ 1+arg4 > 0), cost: n9
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=arg4+arg3, arg1'=arg1P9, arg3'=0, (1 > 0 /\ 2-arg1P9+arg1 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -4+arg2P9 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P9+arg1P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ -4+arg1P9 > 0 /\ 2-arg2P9+arg1 >= 0 /\ 2-arg2P9+arg2 >= 0 /\ 1+arg4 > 0), cost: arg3

Applied acceleration
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=1+arg4, arg1'=arg1P10, arg3'=-1+arg3, (-2-arg2+arg2P10 <= 0 /\ -4+arg2P10 > 0 /\ -2+arg2P10-arg1 <= 0 /\ -2+arg1P10-arg1 <= 0 /\ arg3 > 0 /\ -2-arg2+arg1P10 <= 0 /\ -4+arg1P10 > 0 /\ 1+arg4 > 0), cost: 1
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=n10+arg4, arg1'=arg1P10, arg3'=-n10+arg3, (2+arg2-arg2P10 >= 0 /\ -4+arg2P10 > 0 /\ 1-n10+arg3 > 0 /\ 2-arg2P10+arg1 >= 0 /\ -1+n10 >= 0 /\ 2+arg2P10-arg1P10 >= 0 /\ 2-arg1P10+arg1 >= 0 /\ 2+arg2-arg1P10 >= 0 /\ -4+arg1P10 > 0 /\ 2-arg2P10+arg1P10 >= 0 /\ 1+arg4 > 0), cost: n10
Sub-proof via acceration calculus written to file:///tmp/tmpnam_oLJhKn.txt

Applied instantiation
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=n10+arg4, arg1'=arg1P10, arg3'=-n10+arg3, (2+arg2-arg2P10 >= 0 /\ -4+arg2P10 > 0 /\ 1-n10+arg3 > 0 /\ 2-arg2P10+arg1 >= 0 /\ -1+n10 >= 0 /\ 2+arg2P10-arg1P10 >= 0 /\ 2-arg1P10+arg1 >= 0 /\ 2+arg2-arg1P10 >= 0 /\ -4+arg1P10 > 0 /\ 2-arg2P10+arg1P10 >= 0 /\ 1+arg4 > 0), cost: n10
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=arg4+arg3, arg1'=arg1P10, arg3'=0, (1 > 0 /\ 2+arg2-arg2P10 >= 0 /\ -4+arg2P10 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P10+arg1 >= 0 /\ 2+arg2P10-arg1P10 >= 0 /\ 2-arg1P10+arg1 >= 0 /\ 2+arg2-arg1P10 >= 0 /\ -4+arg1P10 > 0 /\ 2-arg2P10+arg1P10 >= 0 /\ 1+arg4 > 0), cost: arg3

Applied simplification
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=arg4+arg3, arg1'=arg1P7, arg3'=0, (-2+arg1 > 0 /\ 1 > 0 /\ -2+arg2P7 > 0 /\ -1+arg3 >= 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ 1+arg4 > 0), cost: arg3
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=arg4+arg3, arg1'=arg1P7, arg3'=0, (-2+arg1 > 0 /\ -2+arg2P7 > 0 /\ -1+arg3 >= 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ 1+arg4 > 0), cost: arg3

Applied simplification
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=arg4+arg3, arg1'=arg1P8, arg3'=0, (-2+arg1 > 0 /\ 1 > 0 /\ -1+arg3 >= 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ 1+arg4 > 0), cost: arg3
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=arg4+arg3, arg1'=arg1P8, arg3'=0, (-2+arg1 > 0 /\ -1+arg3 >= 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ 1+arg4 > 0), cost: arg3

Applied simplification
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=arg4+arg3, arg1'=arg1P9, arg3'=0, (1 > 0 /\ 2-arg1P9+arg1 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -4+arg2P9 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P9+arg1P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ -4+arg1P9 > 0 /\ 2-arg2P9+arg1 >= 0 /\ 2-arg2P9+arg2 >= 0 /\ 1+arg4 > 0), cost: arg3
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=arg4+arg3, arg1'=arg1P9, arg3'=0, (2-arg1P9+arg1 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -4+arg2P9 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P9+arg1P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ -4+arg1P9 > 0 /\ 2-arg2P9+arg1 >= 0 /\ 2-arg2P9+arg2 >= 0 /\ 1+arg4 > 0), cost: arg3

Applied simplification
Original rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=arg4+arg3, arg1'=arg1P10, arg3'=0, (1 > 0 /\ 2+arg2-arg2P10 >= 0 /\ -4+arg2P10 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P10+arg1 >= 0 /\ 2+arg2P10-arg1P10 >= 0 /\ 2-arg1P10+arg1 >= 0 /\ 2+arg2-arg1P10 >= 0 /\ -4+arg1P10 > 0 /\ 2-arg2P10+arg1P10 >= 0 /\ 1+arg4 > 0), cost: arg3
New rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=arg4+arg3, arg1'=arg1P10, arg3'=0, (2+arg2-arg2P10 >= 0 /\ -4+arg2P10 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P10+arg1 >= 0 /\ 2+arg2P10-arg1P10 >= 0 /\ 2-arg1P10+arg1 >= 0 /\ 2+arg2-arg1P10 >= 0 /\ -4+arg1P10 > 0 /\ 2-arg2P10+arg1P10 >= 0 /\ 1+arg4 > 0), cost: arg3

Applied deletion
Removed the following rules: 20 21 22 23

Accelerated simple loops
Start location: __init
  14: f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
  15: f1_0_main_Load -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -2+arg2P1 > 0), cost: 1
  17: f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=1, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1+arg2 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1
  24: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 1
  25: f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -1+n >= 0), cost: n
  35: f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -arg1P12+arg1 <= 0), cost: NONTERM
  36: f2097_0_flatten_NULL -> [6] : (-arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0), cost: NONTERM
  37: f2097_0_flatten_NULL -> [6] : (-5+arg1P12 >= 0 /\ -2+arg1P12-arg1 <= 0), cost: NONTERM
  38: f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0), cost: NONTERM
  39: f2097_0_flatten_NULL -> [6] : (2-arg1+arg1P11 <= 0 /\ -2+arg1P11 > 0), cost: NONTERM
  40: f2097_0_flatten_NULL -> [6] : (-arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0 /\ -1+n >= 0), cost: NONTERM
  41: f2097_0_flatten_NULL -> [6] : (-5+arg1P12 >= 0 /\ 2-arg1P12+arg1 >= 0 /\ -1+n >= 0), cost: NONTERM
  42: f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0 /\ -1+n >= 0), cost: NONTERM
  43: f2097_0_flatten_NULL -> [6] : (2-arg1+arg1P11 <= 0 /\ -2+arg1P11 > 0 /\ -1+n >= 0), cost: NONTERM
  16: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
  18: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P5, arg4'=1+arg4, arg1'=arg1P5, arg3'=-1+arg3, (-2+arg1P5 > 0 /\ arg2P5 > 0 /\ 2-arg2+arg2P5 <= 0 /\ -arg1+arg1P5 <= 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1
  19: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P6, arg4'=1+arg4, arg1'=arg1P6, arg3'=-1+arg3, (-2+arg1P6 > 0 /\ arg2P6 > 0 /\ 2-arg2+arg2P6 <= 0 /\ arg3 > 0 /\ -arg1+arg1P6 <= 0 /\ 1+arg4 > 0), cost: 1
  48: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=arg4+arg3, arg1'=arg1P7, arg3'=0, (-2+arg1 > 0 /\ -2+arg2P7 > 0 /\ -1+arg3 >= 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ 1+arg4 > 0), cost: arg3
  49: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=arg4+arg3, arg1'=arg1P8, arg3'=0, (-2+arg1 > 0 /\ -1+arg3 >= 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ 1+arg4 > 0), cost: arg3
  50: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=arg4+arg3, arg1'=arg1P9, arg3'=0, (2-arg1P9+arg1 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -4+arg2P9 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P9+arg1P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ -4+arg1P9 > 0 /\ 2-arg2P9+arg1 >= 0 /\ 2-arg2P9+arg2 >= 0 /\ 1+arg4 > 0), cost: arg3
  51: f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=arg4+arg3, arg1'=arg1P10, arg3'=0, (2+arg2-arg2P10 >= 0 /\ -4+arg2P10 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P10+arg1 >= 0 /\ 2+arg2P10-arg1P10 >= 0 /\ 2-arg1P10+arg1 >= 0 /\ 2+arg2-arg1P10 >= 0 /\ -4+arg1P10 > 0 /\ 2-arg2P10+arg1P10 >= 0 /\ 1+arg4 > 0), cost: arg3
  13: __init -> f1_0_main_Load : arg2'=arg2P13, arg4'=arg4P13, arg1'=arg1P13, arg3'=arg3P13, TRUE, cost: 1


Applied chaining
First rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 1
New rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (arg2 > 0 /\ 3-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 2

Applied chaining
First rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 1
New rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg2+arg3 <= 0 /\ 2-arg2+arg1P11 <= 0 /\ arg1 > 0 /\ 1+arg1P11 > 0 /\ 3-arg2 <= 0), cost: 2

Applied chaining
First rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -1+n >= 0), cost: n
New rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (arg2 > 0 /\ -4+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -1+n >= 0 /\ -1+arg1P12-arg1 <= 0), cost: 1+n

Applied chaining
First rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -1+n >= 0), cost: n
New rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1P12 > 0 /\ -2+arg1P12-arg2 <= 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -1+n >= 0 /\ 3-arg2 <= 0), cost: 1+n

Applied chaining
First rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -arg1P12+arg1 <= 0), cost: NONTERM
New rule:
f1_0_main_Load -> [6] : (arg2 > 0 /\ -4+arg1 >= 0), cost: NONTERM

Applied chaining
First rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ 2-arg1P12+arg1 >= 0 /\ -arg1P12+arg1 <= 0), cost: NONTERM
New rule:
f1795_0_main_InvokeMethod -> [6] : (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ 3-arg2 <= 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0), cost: NONTERM
New rule:
f1_0_main_Load -> [6] : (arg2 > 0 /\ -6+arg1 >= 0), cost: NONTERM

Applied chaining
First rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0), cost: NONTERM
New rule:
f1795_0_main_InvokeMethod -> [6] : (-5+arg2 >= 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-5+arg1P12 >= 0 /\ -2+arg1P12-arg1 <= 0), cost: NONTERM
New rule:
f1_0_main_Load -> [6] : (arg2 > 0 /\ -4+arg1 >= 0), cost: NONTERM

Applied chaining
First rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-5+arg1P12 >= 0 /\ -2+arg1P12-arg1 <= 0), cost: NONTERM
New rule:
f1795_0_main_InvokeMethod -> [6] : (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ 3-arg2 <= 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0), cost: NONTERM
New rule:
f1_0_main_Load -> [6] : (arg2 > 0 /\ -4+arg1 >= 0), cost: NONTERM

Applied chaining
First rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0), cost: NONTERM
New rule:
f1795_0_main_InvokeMethod -> [6] : (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ 3-arg2 <= 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (2-arg1+arg1P11 <= 0 /\ -2+arg1P11 > 0), cost: NONTERM
New rule:
f1_0_main_Load -> [6] : (arg2 > 0 /\ -6+arg1 >= 0), cost: NONTERM

Applied chaining
First rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (2-arg1+arg1P11 <= 0 /\ -2+arg1P11 > 0), cost: NONTERM
New rule:
f1795_0_main_InvokeMethod -> [6] : (-5+arg2 >= 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f1_0_main_Load -> [6] : (arg2 > 0 /\ -6+arg1 >= 0), cost: NONTERM

Applied chaining
First rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-arg1P12+arg1 <= 0 /\ -arg1P12+arg1 >= 0 /\ -5+arg1 >= 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f1795_0_main_InvokeMethod -> [6] : (-5+arg2 >= 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-5+arg1P12 >= 0 /\ 2-arg1P12+arg1 >= 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f1_0_main_Load -> [6] : (arg2 > 0 /\ -4+arg1 >= 0), cost: NONTERM

Applied chaining
First rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-5+arg1P12 >= 0 /\ 2-arg1P12+arg1 >= 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f1795_0_main_InvokeMethod -> [6] : (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ 3-arg2 <= 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f1_0_main_Load -> [6] : (arg2 > 0 /\ -4+arg1 >= 0), cost: NONTERM

Applied chaining
First rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (-2+arg1 > 0 /\ arg1-arg1P11 <= 0 /\ arg1-arg1P11 >= 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f1795_0_main_InvokeMethod -> [6] : (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ 3-arg2 <= 0), cost: NONTERM

Applied chaining
First rule:
f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (2-arg1+arg1P11 <= 0 /\ -2+arg1P11 > 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f1_0_main_Load -> [6] : (arg2 > 0 /\ -6+arg1 >= 0), cost: NONTERM

Applied chaining
First rule:
f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
Second rule:
f2097_0_flatten_NULL -> [6] : (2-arg1+arg1P11 <= 0 /\ -2+arg1P11 > 0 /\ -1+n >= 0), cost: NONTERM
New rule:
f1795_0_main_InvokeMethod -> [6] : (-5+arg2 >= 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0), cost: NONTERM

Applied deletion
Removed the following rules: 24 25 35 36 37 38 39 40 41 42 43

Applied chaining
First rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=1, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1+arg2 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1
Second rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P5, arg4'=1+arg4, arg1'=arg1P5, arg3'=-1+arg3, (-2+arg1P5 > 0 /\ arg2P5 > 0 /\ 2-arg2+arg2P5 <= 0 /\ -arg1+arg1P5 <= 0 /\ arg3 > 0 /\ 1+arg4 > 0), cost: 1
New rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P5, arg4'=2, arg1'=arg1P5, arg3'=-1+arg3P4, (-2+arg1P5 > 0 /\ arg2P5 > 0 /\ 1+arg2 > 0 /\ arg2P5-arg1 <= 0 /\ arg3P4 > 0 /\ -2-arg1+arg1P5 <= 0), cost: 2

Applied chaining
First rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=1, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1+arg2 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1
Second rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P6, arg4'=1+arg4, arg1'=arg1P6, arg3'=-1+arg3, (-2+arg1P6 > 0 /\ arg2P6 > 0 /\ 2-arg2+arg2P6 <= 0 /\ arg3 > 0 /\ -arg1+arg1P6 <= 0 /\ 1+arg4 > 0), cost: 1
New rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P6, arg4'=2, arg1'=arg1P6, arg3'=-1+arg3P4, (-2+arg1P6 > 0 /\ arg2P6 > 0 /\ arg2P6-arg1 <= 0 /\ 1+arg2 > 0 /\ arg3P4 > 0 /\ -2-arg1+arg1P6 <= 0), cost: 2

Applied chaining
First rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=1, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1+arg2 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1
Second rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=arg4+arg3, arg1'=arg1P7, arg3'=0, (-2+arg1 > 0 /\ -2+arg2P7 > 0 /\ -1+arg3 >= 0 /\ -2+arg1P7 > 0 /\ -1+arg2 > 0 /\ 1+arg4 > 0), cost: arg3
New rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=1+arg3P4, arg1'=arg1P7, arg3'=0, (-2+arg2P7 > 0 /\ 1+arg2 > 0 /\ -2+arg1P7 > 0 /\ arg3P4 > 0 /\ -1+arg1 >= 0), cost: 1+arg3P4

Applied chaining
First rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=1, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1+arg2 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1
Second rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=arg4+arg3, arg1'=arg1P8, arg3'=0, (-2+arg1 > 0 /\ -1+arg3 >= 0 /\ -2+arg1P8 > 0 /\ -1+arg2 > 0 /\ -2+arg2P8 > 0 /\ 1+arg4 > 0), cost: arg3
New rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=1+arg3P4, arg1'=arg1P8, arg3'=0, (1+arg2 > 0 /\ -2+arg1P8 > 0 /\ arg3P4 > 0 /\ -2+arg2P8 > 0 /\ -1+arg1 >= 0), cost: 1+arg3P4

Applied chaining
First rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=1, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1+arg2 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1
Second rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=arg4+arg3, arg1'=arg1P9, arg3'=0, (2-arg1P9+arg1 >= 0 /\ 2+arg2P9-arg1P9 >= 0 /\ -4+arg2P9 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P9+arg1P9 >= 0 /\ 2+arg2-arg1P9 >= 0 /\ -4+arg1P9 > 0 /\ 2-arg2P9+arg1 >= 0 /\ 2-arg2P9+arg2 >= 0 /\ 1+arg4 > 0), cost: arg3
New rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=1+arg3P4, arg1'=arg1P9, arg3'=0, (2+arg2P9-arg1P9 >= 0 /\ -4+arg1P9-arg1 <= 0 /\ -4+arg2P9 > 0 /\ 1+arg2 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -4+arg1P9 > 0 /\ arg3P4 > 0 /\ -4+arg2P9-arg1 <= 0), cost: 1+arg3P4

Applied chaining
First rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=1, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1+arg2 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1
Second rule:
f1759_0_createTree_LE -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=arg4+arg3, arg1'=arg1P10, arg3'=0, (2+arg2-arg2P10 >= 0 /\ -4+arg2P10 > 0 /\ -1+arg3 >= 0 /\ 2-arg2P10+arg1 >= 0 /\ 2+arg2P10-arg1P10 >= 0 /\ 2-arg1P10+arg1 >= 0 /\ 2+arg2-arg1P10 >= 0 /\ -4+arg1P10 > 0 /\ 2-arg2P10+arg1P10 >= 0 /\ 1+arg4 > 0), cost: arg3
New rule:
f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=1+arg3P4, arg1'=arg1P10, arg3'=0, (-4+arg2P10-arg1 <= 0 /\ -4+arg2P10 > 0 /\ 1+arg2 > 0 /\ 2+arg2P10-arg1P10 >= 0 /\ arg3P4 > 0 /\ -4+arg1P10 > 0 /\ -4+arg1P10-arg1 <= 0 /\ 2-arg2P10+arg1P10 >= 0), cost: 1+arg3P4

Applied deletion
Removed the following rules: 18 19 48 49 50 51

Chained accelerated rules with incoming rules
Start location: __init
  14: f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg1P0 > 0 /\ arg2 > 0 /\ 1-arg1+arg1P0 <= 0), cost: 1
  15: f1_0_main_Load -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -2+arg2P1 > 0), cost: 1
  17: f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P4, arg4'=1, arg1'=arg1P4, arg3'=arg3P4, (-2-arg1+arg2P4 <= 0 /\ 1+arg2 > 0 /\ arg3P4 > 0 /\ -2+arg1P4 > 0 /\ -2+arg1P4-arg1 <= 0 /\ -2+arg2P4 > 0), cost: 1
  52: f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (arg2 > 0 /\ 3-arg1+arg1P11 <= 0 /\ 1+arg1P11 > 0), cost: 2
  54: f1_0_main_Load -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (arg2 > 0 /\ -4+arg1 >= 0 /\ -2+arg1P12 > 0 /\ -1+n >= 0 /\ -1+arg1P12-arg1 <= 0), cost: 1+n
  56: f1_0_main_Load -> [6] : (arg2 > 0 /\ -4+arg1 >= 0), cost: NONTERM
  58: f1_0_main_Load -> [6] : (arg2 > 0 /\ -6+arg1 >= 0), cost: NONTERM
  60: f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P5, arg4'=2, arg1'=arg1P5, arg3'=-1+arg3P4, (-2+arg1P5 > 0 /\ arg2P5 > 0 /\ 1+arg2 > 0 /\ arg2P5-arg1 <= 0 /\ arg3P4 > 0 /\ -2-arg1+arg1P5 <= 0), cost: 2
  61: f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P6, arg4'=2, arg1'=arg1P6, arg3'=-1+arg3P4, (-2+arg1P6 > 0 /\ arg2P6 > 0 /\ arg2P6-arg1 <= 0 /\ 1+arg2 > 0 /\ arg3P4 > 0 /\ -2-arg1+arg1P6 <= 0), cost: 2
  62: f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P7, arg4'=1+arg3P4, arg1'=arg1P7, arg3'=0, (-2+arg2P7 > 0 /\ 1+arg2 > 0 /\ -2+arg1P7 > 0 /\ arg3P4 > 0 /\ -1+arg1 >= 0), cost: 1+arg3P4
  63: f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P8, arg4'=1+arg3P4, arg1'=arg1P8, arg3'=0, (1+arg2 > 0 /\ -2+arg1P8 > 0 /\ arg3P4 > 0 /\ -2+arg2P8 > 0 /\ -1+arg1 >= 0), cost: 1+arg3P4
  64: f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P9, arg4'=1+arg3P4, arg1'=arg1P9, arg3'=0, (2+arg2P9-arg1P9 >= 0 /\ -4+arg1P9-arg1 <= 0 /\ -4+arg2P9 > 0 /\ 1+arg2 > 0 /\ 2-arg2P9+arg1P9 >= 0 /\ -4+arg1P9 > 0 /\ arg3P4 > 0 /\ -4+arg2P9-arg1 <= 0), cost: 1+arg3P4
  65: f1_0_main_Load -> f1759_0_createTree_LE : arg2'=arg2P10, arg4'=1+arg3P4, arg1'=arg1P10, arg3'=0, (-4+arg2P10-arg1 <= 0 /\ -4+arg2P10 > 0 /\ 1+arg2 > 0 /\ 2+arg2P10-arg1P10 >= 0 /\ arg3P4 > 0 /\ -4+arg1P10 > 0 /\ -4+arg1P10-arg1 <= 0 /\ 2-arg2P10+arg1P10 >= 0), cost: 1+arg3P4
  16: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -2+arg1P3 > 0 /\ -arg2+arg1P3 <= 0), cost: 1
  53: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (2-arg2+arg3 <= 0 /\ 2-arg2+arg1P11 <= 0 /\ arg1 > 0 /\ 1+arg1P11 > 0 /\ 3-arg2 <= 0), cost: 2
  55: f1795_0_main_InvokeMethod -> f2097_0_flatten_NULL : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (-2+arg1P12 > 0 /\ -2+arg1P12-arg2 <= 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0 /\ -1+n >= 0 /\ 3-arg2 <= 0), cost: 1+n
  57: f1795_0_main_InvokeMethod -> [6] : (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ 3-arg2 <= 0), cost: NONTERM
  59: f1795_0_main_InvokeMethod -> [6] : (-5+arg2 >= 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0), cost: NONTERM
  13: __init -> f1_0_main_Load : arg2'=arg2P13, arg4'=arg4P13, arg1'=arg1P13, arg3'=arg3P13, TRUE, cost: 1


Removed unreachable locations and irrelevant leafs
Start location: __init
  15: f1_0_main_Load -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -2+arg2P1 > 0), cost: 1
  56: f1_0_main_Load -> [6] : (arg2 > 0 /\ -4+arg1 >= 0), cost: NONTERM
  58: f1_0_main_Load -> [6] : (arg2 > 0 /\ -6+arg1 >= 0), cost: NONTERM
  57: f1795_0_main_InvokeMethod -> [6] : (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ 3-arg2 <= 0), cost: NONTERM
  59: f1795_0_main_InvokeMethod -> [6] : (-5+arg2 >= 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0), cost: NONTERM
  13: __init -> f1_0_main_Load : arg2'=arg2P13, arg4'=arg4P13, arg1'=arg1P13, arg3'=arg3P13, TRUE, cost: 1


Eliminating location f1_0_main_Load by chaining:

Applied chaining
First rule:
__init -> f1_0_main_Load : arg2'=arg2P13, arg4'=arg4P13, arg1'=arg1P13, arg3'=arg3P13, TRUE, cost: 1
Second rule:
f1_0_main_Load -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (-arg1+arg1P1 <= 0 /\ arg1P1 > 0 /\ -2+arg2P1 > 0), cost: 1
New rule:
__init -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg1P1 > 0 /\ -arg1P13+arg1P1 <= 0 /\ -2+arg2P1 > 0), cost: 2

Applied chaining
First rule:
__init -> f1_0_main_Load : arg2'=arg2P13, arg4'=arg4P13, arg1'=arg1P13, arg3'=arg3P13, TRUE, cost: 1
Second rule:
f1_0_main_Load -> [6] : (arg2 > 0 /\ -4+arg1 >= 0), cost: NONTERM
New rule:
__init -> [6] : (arg2P13 > 0 /\ -4+arg1P13 >= 0), cost: NONTERM

Applied chaining
First rule:
__init -> f1_0_main_Load : arg2'=arg2P13, arg4'=arg4P13, arg1'=arg1P13, arg3'=arg3P13, TRUE, cost: 1
Second rule:
f1_0_main_Load -> [6] : (arg2 > 0 /\ -6+arg1 >= 0), cost: NONTERM
New rule:
__init -> [6] : (arg2P13 > 0 /\ -6+arg1P13 >= 0), cost: NONTERM

Applied deletion
Removed the following rules: 13 15 56 58

Eliminated locations on tree-shaped paths
Start location: __init
  57: f1795_0_main_InvokeMethod -> [6] : (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ 3-arg2 <= 0), cost: NONTERM
  59: f1795_0_main_InvokeMethod -> [6] : (-5+arg2 >= 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0), cost: NONTERM
  66: __init -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg1P1 > 0 /\ -arg1P13+arg1P1 <= 0 /\ -2+arg2P1 > 0), cost: 2
  67: __init -> [6] : (arg2P13 > 0 /\ -4+arg1P13 >= 0), cost: NONTERM
  68: __init -> [6] : (arg2P13 > 0 /\ -6+arg1P13 >= 0), cost: NONTERM


Eliminating location f1795_0_main_InvokeMethod by chaining:

Applied chaining
First rule:
__init -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg1P1 > 0 /\ -arg1P13+arg1P1 <= 0 /\ -2+arg2P1 > 0), cost: 2
Second rule:
f1795_0_main_InvokeMethod -> [6] : (2-arg2+arg3 <= 0 /\ arg1 > 0 /\ 3-arg2 <= 0), cost: NONTERM
New rule:
__init -> [6] : (3-arg2P1 <= 0 /\ 2+arg3P1-arg2P1 <= 0 /\ arg1P1 > 0 /\ -arg1P13+arg1P1 <= 0 /\ -2+arg2P1 > 0), cost: NONTERM

Applied simplification
Original rule:
__init -> [6] : (3-arg2P1 <= 0 /\ 2+arg3P1-arg2P1 <= 0 /\ arg1P1 > 0 /\ -arg1P13+arg1P1 <= 0 /\ -2+arg2P1 > 0), cost: NONTERM
New rule:
__init -> [6] : (2+arg3P1-arg2P1 <= 0 /\ arg1P1 > 0 /\ -arg1P13+arg1P1 <= 0 /\ -2+arg2P1 > 0), cost: NONTERM

Applied chaining
First rule:
__init -> f1795_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (arg1P1 > 0 /\ -arg1P13+arg1P1 <= 0 /\ -2+arg2P1 > 0), cost: 2
Second rule:
f1795_0_main_InvokeMethod -> [6] : (-5+arg2 >= 0 /\ 2-arg2+arg3 <= 0 /\ arg1 > 0), cost: NONTERM
New rule:
__init -> [6] : (2+arg3P1-arg2P1 <= 0 /\ -5+arg2P1 >= 0 /\ arg1P1 > 0 /\ -arg1P13+arg1P1 <= 0 /\ -2+arg2P1 > 0), cost: NONTERM

Applied simplification
Original rule:
__init -> [6] : (2+arg3P1-arg2P1 <= 0 /\ -5+arg2P1 >= 0 /\ arg1P1 > 0 /\ -arg1P13+arg1P1 <= 0 /\ -2+arg2P1 > 0), cost: NONTERM
New rule:
__init -> [6] : (2+arg3P1-arg2P1 <= 0 /\ -5+arg2P1 >= 0 /\ arg1P1 > 0 /\ -arg1P13+arg1P1 <= 0), cost: NONTERM

Applied deletion
Removed the following rules: 57 59 66

Eliminated locations on tree-shaped paths
Start location: __init
  67: __init -> [6] : (arg2P13 > 0 /\ -4+arg1P13 >= 0), cost: NONTERM
  68: __init -> [6] : (arg2P13 > 0 /\ -6+arg1P13 >= 0), cost: NONTERM
  69: __init -> [6] : (2+arg3P1-arg2P1 <= 0 /\ arg1P1 > 0 /\ -arg1P13+arg1P1 <= 0 /\ -2+arg2P1 > 0), cost: NONTERM
  70: __init -> [6] : (2+arg3P1-arg2P1 <= 0 /\ -5+arg2P1 >= 0 /\ arg1P1 > 0 /\ -arg1P13+arg1P1 <= 0), cost: NONTERM


Computing asymptotic complexity
Proved nontermination of rule 67 via SMT.

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

Solved cost: NONTERM
Rule cost:   NONTERM
Rule guard:  (arg2P13 > 0 /\ -4+arg1P13 >= 0)