WORST_CASE(Omega(0),?)

Initial ITS
Start location: __init
   0: f1_0_main_Load -> f1843_0_main_InvokeMethod : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg2P0 > 0 /\ arg1 > 0 /\ arg1P0 > 0 /\ -arg1+arg1P0 <= 0), cost: 1
   3: f1_0_main_Load -> f931_0_random_ArrayAccess : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg1P3 > 0 /\ arg1P3-arg1 <= 0 /\ arg1 > 0), cost: 1
   5: f1_0_main_Load -> f977_0_random_ArrayAccess : arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (arg1 > 0 /\ -arg1+arg1P5 <= 0 /\ arg1P5 > 0), cost: 1
  13: f1_0_main_Load -> f1257_0_random_ArrayAccess : arg2'=arg2P13, arg4'=arg4P13, arg1'=arg1P13, arg3'=arg3P13, (arg1P13 > 0 /\ -arg1+arg2P13 <= 0 /\ 1+arg2 > 0 /\ arg1P13-arg1 <= 0 /\ arg1 > 0 /\ -arg3P13 == 0 /\ arg2P13 > 0), cost: 1
  16: f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P16, arg1'=arg1P16, arg3'=arg3P16, (1+arg2 > 0 /\ arg1 > 0 /\ 1+arg1P16 > 0 /\ -arg3P16+arg3 == 0 /\ -arg2+arg1P16 <= 0), cost: 1
   1: f323_0_createTree_Return -> f1843_0_main_InvokeMethod : arg2'=arg2P1, arg4'=arg4P1, arg1'=arg1P1, arg3'=arg3P1, (-1-arg2+arg1P1 <= 0 /\ -arg1+arg1P1 <= 0 /\ 1+arg2 > 0 /\ -arg2+arg2P1 <= 0 /\ arg1 > 0 /\ 1+arg2P1 > 0 /\ arg1P1 > 0 /\ 2-arg3P1 == 0), cost: 1
   2: f521_0_createNode_Return -> f931_0_random_ArrayAccess : arg2'=arg2P2, arg4'=arg4P2, arg1'=arg1P2, arg3'=arg3P2, arg1P2 > 0, cost: 1
   7: f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P7, arg4'=arg4P7, arg1'=arg1P7, arg3'=arg3P7, (x300 > 0 /\ 1+arg2P7 > 0 /\ -1+arg1P7 > 0 /\ arg1 > 0 /\ -1-arg1+arg1P7 <= 0 /\ 1-arg4P7+x300 == 0), cost: 1
   4: f588_0_createNode_Return -> f977_0_random_ArrayAccess : arg2'=arg2P4, arg4'=arg4P4, arg1'=arg1P4, arg3'=arg3P4, arg1P4 > 0, cost: 1
   6: f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, (1+x250-arg4P6 == 0 /\ -3+arg1P6 > 0 /\ arg1 > 0 /\ x250 > 0 /\ -3+arg1P6-arg1 <= 0 /\ 1+arg2P6 > 0), cost: 1
   8: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2P8, arg4'=arg4P8, arg1'=arg1P8, arg3'=arg3P8, (-1+arg2-arg2P8 == 0 /\ arg2 > 0 /\ -arg4P8+arg4 == 0 /\ 1+arg1P8 > 0 /\ 2+arg1P8-arg1 <= 0 /\ -1+arg1 > 0 /\ -arg3P8+arg3 == 0), cost: 1
   9: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2P9, arg4'=arg4P9, arg1'=arg1P9, arg3'=arg3P9, (-2+arg1 > 0 /\ -3+arg1P9 > 0 /\ arg2 > 0 /\ -1-arg2P9+arg2 == 0 /\ arg4 > 0 /\ x450 > 0 /\ -2+arg1P9-arg1 <= 0 /\ -arg3P9+arg3 == 0), cost: 1
  10: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2P10, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P10, (-2+arg1 > 0 /\ -arg3P10+arg3 == 0 /\ arg2 > 0 /\ arg4 > 0 /\ -1+arg2-arg2P10 == 0 /\ -3+arg1P10 > 0 /\ -2+arg1P10-arg1 <= 0 /\ x520 > 0), cost: 1
  11: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (-2+arg1 > 0 /\ -3+arg1P11-arg1 <= 0 /\ arg2 > 0 /\ arg4 > 0 /\ x590 > 0 /\ -5+arg1P11 > 0 /\ -arg3P11+arg3 == 0 /\ -1-arg2P11+arg2 == 0), cost: 1
  12: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (x660 > 0 /\ -2+arg1 > 0 /\ -arg3P12+arg3 == 0 /\ -5+arg1P12 > 0 /\ arg2 > 0 /\ arg4 > 0 /\ -3-arg1+arg1P12 <= 0 /\ -1+arg2-arg2P12 == 0), cost: 1
  14: f2251_0_createTree_LE -> f1257_0_random_ArrayAccess : arg2'=arg2P14, arg4'=arg4P14, arg1'=arg1P14, arg3'=arg3P14, (-2+arg1 > 0 /\ arg2 > 0 /\ 2-arg1+arg2P14 <= 0 /\ arg4 > 0 /\ 1+arg3 > 0 /\ arg4-arg3P14 == 0 /\ arg2P14 > 0), cost: 1
  15: f2251_0_createTree_LE -> f1257_0_random_ArrayAccess : arg2'=arg2P15, arg4'=arg4P15, arg1'=arg1P15, arg3'=arg3P15, (-2+arg1 > 0 /\ 2+arg2P15-arg1 <= 0 /\ arg2 > 0 /\ arg2P15 > 0 /\ arg4 > 0 /\ 1+arg3 > 0 /\ arg3P15 > 0), cost: 1
  17: f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P17, arg4'=arg4P17, arg1'=arg1P17, arg3'=arg3P17, (1-arg3P17+arg3 == 0 /\ -43+x930 < 0 /\ arg2-arg2P17 == 0 /\ 1+x930 > 0 /\ 1+arg1P17 > 0 /\ 1+arg2 > 0 /\ 1-arg1+arg1P17 <= 0 /\ arg1 > 0 /\ 1+arg3 > 0), cost: 1
  18: f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P18, arg4'=arg4P18, arg1'=arg1P18, arg3'=arg3P18, (1-arg3P18+arg3 == 0 /\ 1-arg1+arg1P18 <= 0 /\ -42+x980 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg3 > 0 /\ 1+arg1P18 > 0 /\ arg2-arg2P18 == 0), cost: 1
  19: __init -> f1_0_main_Load : arg2'=arg2P19, arg4'=arg4P19, arg1'=arg1P19, arg3'=arg3P19, TRUE, cost: 1


Removed unreachable rules and leafs
Start location: __init
   0: f1_0_main_Load -> f1843_0_main_InvokeMethod : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg2P0 > 0 /\ arg1 > 0 /\ arg1P0 > 0 /\ -arg1+arg1P0 <= 0), cost: 1
   3: f1_0_main_Load -> f931_0_random_ArrayAccess : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg1P3 > 0 /\ arg1P3-arg1 <= 0 /\ arg1 > 0), cost: 1
   5: f1_0_main_Load -> f977_0_random_ArrayAccess : arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (arg1 > 0 /\ -arg1+arg1P5 <= 0 /\ arg1P5 > 0), cost: 1
  16: f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P16, arg1'=arg1P16, arg3'=arg3P16, (1+arg2 > 0 /\ arg1 > 0 /\ 1+arg1P16 > 0 /\ -arg3P16+arg3 == 0 /\ -arg2+arg1P16 <= 0), cost: 1
   7: f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P7, arg4'=arg4P7, arg1'=arg1P7, arg3'=arg3P7, (x300 > 0 /\ 1+arg2P7 > 0 /\ -1+arg1P7 > 0 /\ arg1 > 0 /\ -1-arg1+arg1P7 <= 0 /\ 1-arg4P7+x300 == 0), cost: 1
   6: f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P6, arg4'=arg4P6, arg1'=arg1P6, arg3'=arg3P6, (1+x250-arg4P6 == 0 /\ -3+arg1P6 > 0 /\ arg1 > 0 /\ x250 > 0 /\ -3+arg1P6-arg1 <= 0 /\ 1+arg2P6 > 0), cost: 1
   8: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2P8, arg4'=arg4P8, arg1'=arg1P8, arg3'=arg3P8, (-1+arg2-arg2P8 == 0 /\ arg2 > 0 /\ -arg4P8+arg4 == 0 /\ 1+arg1P8 > 0 /\ 2+arg1P8-arg1 <= 0 /\ -1+arg1 > 0 /\ -arg3P8+arg3 == 0), cost: 1
   9: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2P9, arg4'=arg4P9, arg1'=arg1P9, arg3'=arg3P9, (-2+arg1 > 0 /\ -3+arg1P9 > 0 /\ arg2 > 0 /\ -1-arg2P9+arg2 == 0 /\ arg4 > 0 /\ x450 > 0 /\ -2+arg1P9-arg1 <= 0 /\ -arg3P9+arg3 == 0), cost: 1
  10: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2P10, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P10, (-2+arg1 > 0 /\ -arg3P10+arg3 == 0 /\ arg2 > 0 /\ arg4 > 0 /\ -1+arg2-arg2P10 == 0 /\ -3+arg1P10 > 0 /\ -2+arg1P10-arg1 <= 0 /\ x520 > 0), cost: 1
  11: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2P11, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P11, (-2+arg1 > 0 /\ -3+arg1P11-arg1 <= 0 /\ arg2 > 0 /\ arg4 > 0 /\ x590 > 0 /\ -5+arg1P11 > 0 /\ -arg3P11+arg3 == 0 /\ -1-arg2P11+arg2 == 0), cost: 1
  12: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (x660 > 0 /\ -2+arg1 > 0 /\ -arg3P12+arg3 == 0 /\ -5+arg1P12 > 0 /\ arg2 > 0 /\ arg4 > 0 /\ -3-arg1+arg1P12 <= 0 /\ -1+arg2-arg2P12 == 0), cost: 1
  17: f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P17, arg4'=arg4P17, arg1'=arg1P17, arg3'=arg3P17, (1-arg3P17+arg3 == 0 /\ -43+x930 < 0 /\ arg2-arg2P17 == 0 /\ 1+x930 > 0 /\ 1+arg1P17 > 0 /\ 1+arg2 > 0 /\ 1-arg1+arg1P17 <= 0 /\ arg1 > 0 /\ 1+arg3 > 0), cost: 1
  18: f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P18, arg4'=arg4P18, arg1'=arg1P18, arg3'=arg3P18, (1-arg3P18+arg3 == 0 /\ 1-arg1+arg1P18 <= 0 /\ -42+x980 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg3 > 0 /\ 1+arg1P18 > 0 /\ arg2-arg2P18 == 0), cost: 1
  19: __init -> f1_0_main_Load : arg2'=arg2P19, arg4'=arg4P19, arg1'=arg1P19, arg3'=arg3P19, TRUE, cost: 1


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

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

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

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

Applied preprocessing
Original rule:
f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P7, arg4'=arg4P7, arg1'=arg1P7, arg3'=arg3P7, (x300 > 0 /\ 1+arg2P7 > 0 /\ -1+arg1P7 > 0 /\ arg1 > 0 /\ -1-arg1+arg1P7 <= 0 /\ 1-arg4P7+x300 == 0), cost: 1
New rule:
f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P7, arg4'=1+x300, arg1'=arg1P7, arg3'=arg3P7, (x300 > 0 /\ 1+arg2P7 > 0 /\ -1+arg1P7 > 0 /\ -1-arg1+arg1P7 <= 0), cost: 1

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

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

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

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

Applied preprocessing
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2P12, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P12, (x660 > 0 /\ -2+arg1 > 0 /\ -arg3P12+arg3 == 0 /\ -5+arg1P12 > 0 /\ arg2 > 0 /\ arg4 > 0 /\ -3-arg1+arg1P12 <= 0 /\ -1+arg2-arg2P12 == 0), cost: 1
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg4'=arg4P12, arg1'=arg1P12, (-5+arg1P12 > 0 /\ arg2 > 0 /\ arg4 > 0 /\ -3-arg1+arg1P12 <= 0), cost: 1

Applied preprocessing
Original rule:
f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P16, arg1'=arg1P16, arg3'=arg3P16, (1+arg2 > 0 /\ arg1 > 0 /\ 1+arg1P16 > 0 /\ -arg3P16+arg3 == 0 /\ -arg2+arg1P16 <= 0), cost: 1
New rule:
f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P16, arg1'=arg1P16, (arg1 > 0 /\ 1+arg1P16 > 0 /\ -arg2+arg1P16 <= 0), cost: 1

Applied preprocessing
Original rule:
f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P17, arg4'=arg4P17, arg1'=arg1P17, arg3'=arg3P17, (1-arg3P17+arg3 == 0 /\ -43+x930 < 0 /\ arg2-arg2P17 == 0 /\ 1+x930 > 0 /\ 1+arg1P17 > 0 /\ 1+arg2 > 0 /\ 1-arg1+arg1P17 <= 0 /\ arg1 > 0 /\ 1+arg3 > 0), cost: 1
New rule:
f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg4'=arg4P17, arg1'=arg1P17, arg3'=1+arg3, (1+arg1P17 > 0 /\ 1+arg2 > 0 /\ 1-arg1+arg1P17 <= 0 /\ 1+arg3 > 0), cost: 1

Applied preprocessing
Original rule:
f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P18, arg4'=arg4P18, arg1'=arg1P18, arg3'=arg3P18, (1-arg3P18+arg3 == 0 /\ 1-arg1+arg1P18 <= 0 /\ -42+x980 > 0 /\ 1+arg2 > 0 /\ arg1 > 0 /\ 1+arg3 > 0 /\ 1+arg1P18 > 0 /\ arg2-arg2P18 == 0), cost: 1
New rule:
f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg4'=arg4P18, arg1'=arg1P18, arg3'=1+arg3, (1-arg1+arg1P18 <= 0 /\ 1+arg2 > 0 /\ 1+arg3 > 0 /\ 1+arg1P18 > 0), cost: 1

Simplified rules
Start location: __init
  20: f1_0_main_Load -> f1843_0_main_InvokeMethod : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg2P0 > 0 /\ arg1P0 > 0 /\ -arg1+arg1P0 <= 0), cost: 1
  21: f1_0_main_Load -> f931_0_random_ArrayAccess : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg1P3 > 0 /\ arg1P3-arg1 <= 0), cost: 1
  22: f1_0_main_Load -> f977_0_random_ArrayAccess : arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (-arg1+arg1P5 <= 0 /\ arg1P5 > 0), cost: 1
  30: f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P16, arg1'=arg1P16, (arg1 > 0 /\ 1+arg1P16 > 0 /\ -arg2+arg1P16 <= 0), cost: 1
  24: f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P7, arg4'=1+x300, arg1'=arg1P7, arg3'=arg3P7, (x300 > 0 /\ 1+arg2P7 > 0 /\ -1+arg1P7 > 0 /\ -1-arg1+arg1P7 <= 0), cost: 1
  23: f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P6, arg4'=1+x250, arg1'=arg1P6, arg3'=arg3P6, (-3+arg1P6 > 0 /\ x250 > 0 /\ -3+arg1P6-arg1 <= 0 /\ 1+arg2P6 > 0), cost: 1
  25: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg1'=arg1P8, (arg2 > 0 /\ 1+arg1P8 > 0 /\ 2+arg1P8-arg1 <= 0), cost: 1
  26: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg4'=arg4P9, arg1'=arg1P9, (-2+arg1 > 0 /\ -3+arg1P9 > 0 /\ arg2 > 0 /\ arg4 > 0 /\ -2+arg1P9-arg1 <= 0), cost: 1
  27: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg4'=arg4P10, arg1'=arg1P10, (-2+arg1 > 0 /\ arg2 > 0 /\ arg4 > 0 /\ -3+arg1P10 > 0 /\ -2+arg1P10-arg1 <= 0), cost: 1
  28: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg4'=arg4P11, arg1'=arg1P11, (-3+arg1P11-arg1 <= 0 /\ arg2 > 0 /\ arg4 > 0 /\ -5+arg1P11 > 0), cost: 1
  29: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg4'=arg4P12, arg1'=arg1P12, (-5+arg1P12 > 0 /\ arg2 > 0 /\ arg4 > 0 /\ -3-arg1+arg1P12 <= 0), cost: 1
  31: f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg4'=arg4P17, arg1'=arg1P17, arg3'=1+arg3, (1+arg1P17 > 0 /\ 1+arg2 > 0 /\ 1-arg1+arg1P17 <= 0 /\ 1+arg3 > 0), cost: 1
  32: f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg4'=arg4P18, arg1'=arg1P18, arg3'=1+arg3, (1-arg1+arg1P18 <= 0 /\ 1+arg2 > 0 /\ 1+arg3 > 0 /\ 1+arg1P18 > 0), cost: 1
  19: __init -> f1_0_main_Load : arg2'=arg2P19, arg4'=arg4P19, arg1'=arg1P19, arg3'=arg3P19, TRUE, cost: 1


Applied acceleration
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg4'=arg4P9, arg1'=arg1P9, (-2+arg1 > 0 /\ -3+arg1P9 > 0 /\ arg2 > 0 /\ arg4 > 0 /\ -2+arg1P9-arg1 <= 0), cost: 1
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2-n0, arg4'=arg4P9, arg1'=arg1P9, (-2+arg1 > 0 /\ -3+arg1P9 > 0 /\ -1+n0 >= 0 /\ arg4P9 > 0 /\ arg4 > 0 /\ 2-arg1P9+arg1 >= 0 /\ 1+arg2-n0 > 0), cost: n0
Sub-proof via acceration calculus written to file:///tmp/tmpnam_icFLcg.txt

Applied instantiation
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2-n0, arg4'=arg4P9, arg1'=arg1P9, (-2+arg1 > 0 /\ -3+arg1P9 > 0 /\ -1+n0 >= 0 /\ arg4P9 > 0 /\ arg4 > 0 /\ 2-arg1P9+arg1 >= 0 /\ 1+arg2-n0 > 0), cost: n0
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P9, arg1'=arg1P9, (-2+arg1 > 0 /\ -3+arg1P9 > 0 /\ 1 > 0 /\ arg4P9 > 0 /\ arg4 > 0 /\ -1+arg2 >= 0 /\ 2-arg1P9+arg1 >= 0), cost: arg2

Applied acceleration
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg4'=arg4P10, arg1'=arg1P10, (-2+arg1 > 0 /\ arg2 > 0 /\ arg4 > 0 /\ -3+arg1P10 > 0 /\ -2+arg1P10-arg1 <= 0), cost: 1
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2-n1, arg4'=arg4P10, arg1'=arg1P10, (-2+arg1 > 0 /\ -1+n1 >= 0 /\ arg4 > 0 /\ arg4P10 > 0 /\ -3+arg1P10 > 0 /\ 2-arg1P10+arg1 >= 0 /\ 1+arg2-n1 > 0), cost: n1
Sub-proof via acceration calculus written to file:///tmp/tmpnam_AggLOI.txt

Applied instantiation
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2-n1, arg4'=arg4P10, arg1'=arg1P10, (-2+arg1 > 0 /\ -1+n1 >= 0 /\ arg4 > 0 /\ arg4P10 > 0 /\ -3+arg1P10 > 0 /\ 2-arg1P10+arg1 >= 0 /\ 1+arg2-n1 > 0), cost: n1
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P10, arg1'=arg1P10, (-2+arg1 > 0 /\ 1 > 0 /\ arg4 > 0 /\ arg4P10 > 0 /\ -1+arg2 >= 0 /\ -3+arg1P10 > 0 /\ 2-arg1P10+arg1 >= 0), cost: arg2

Applied acceleration
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg4'=arg4P11, arg1'=arg1P11, (-3+arg1P11-arg1 <= 0 /\ arg2 > 0 /\ arg4 > 0 /\ -5+arg1P11 > 0), cost: 1
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2-n2, arg4'=arg4P11, arg1'=arg1P11, (3-arg1P11+arg1 >= 0 /\ -1+n2 >= 0 /\ arg4 > 0 /\ 1+arg2-n2 > 0 /\ -5+arg1P11 > 0 /\ arg4P11 > 0), cost: n2
Sub-proof via acceration calculus written to file:///tmp/tmpnam_LMgboI.txt

Applied instantiation
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=arg2-n2, arg4'=arg4P11, arg1'=arg1P11, (3-arg1P11+arg1 >= 0 /\ -1+n2 >= 0 /\ arg4 > 0 /\ 1+arg2-n2 > 0 /\ -5+arg1P11 > 0 /\ arg4P11 > 0), cost: n2
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P11, arg1'=arg1P11, (1 > 0 /\ 3-arg1P11+arg1 >= 0 /\ arg4 > 0 /\ -5+arg1P11 > 0 /\ -1+arg2 >= 0 /\ arg4P11 > 0), cost: arg2

Applied acceleration
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg4'=arg4P12, arg1'=arg1P12, (-5+arg1P12 > 0 /\ arg2 > 0 /\ arg4 > 0 /\ -3-arg1+arg1P12 <= 0), cost: 1
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-n3+arg2, arg4'=arg4P12, arg1'=arg1P12, (1-n3+arg2 > 0 /\ -5+arg1P12 > 0 /\ arg4 > 0 /\ 3+arg1-arg1P12 >= 0 /\ -1+n3 >= 0 /\ arg4P12 > 0), cost: n3
Sub-proof via acceration calculus written to file:///tmp/tmpnam_OIGeEL.txt

Applied instantiation
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-n3+arg2, arg4'=arg4P12, arg1'=arg1P12, (1-n3+arg2 > 0 /\ -5+arg1P12 > 0 /\ arg4 > 0 /\ 3+arg1-arg1P12 >= 0 /\ -1+n3 >= 0 /\ arg4P12 > 0), cost: n3
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P12, arg1'=arg1P12, (1 > 0 /\ -5+arg1P12 > 0 /\ arg4 > 0 /\ 3+arg1-arg1P12 >= 0 /\ -1+arg2 >= 0 /\ arg4P12 > 0), cost: arg2

Applied simplification
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P9, arg1'=arg1P9, (-2+arg1 > 0 /\ -3+arg1P9 > 0 /\ 1 > 0 /\ arg4P9 > 0 /\ arg4 > 0 /\ -1+arg2 >= 0 /\ 2-arg1P9+arg1 >= 0), cost: arg2
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P9, arg1'=arg1P9, (-2+arg1 > 0 /\ -3+arg1P9 > 0 /\ arg4P9 > 0 /\ arg4 > 0 /\ -1+arg2 >= 0 /\ 2-arg1P9+arg1 >= 0), cost: arg2

Applied simplification
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P10, arg1'=arg1P10, (-2+arg1 > 0 /\ 1 > 0 /\ arg4 > 0 /\ arg4P10 > 0 /\ -1+arg2 >= 0 /\ -3+arg1P10 > 0 /\ 2-arg1P10+arg1 >= 0), cost: arg2
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P10, arg1'=arg1P10, (-2+arg1 > 0 /\ arg4 > 0 /\ arg4P10 > 0 /\ -1+arg2 >= 0 /\ -3+arg1P10 > 0 /\ 2-arg1P10+arg1 >= 0), cost: arg2

Applied simplification
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P11, arg1'=arg1P11, (1 > 0 /\ 3-arg1P11+arg1 >= 0 /\ arg4 > 0 /\ -5+arg1P11 > 0 /\ -1+arg2 >= 0 /\ arg4P11 > 0), cost: arg2
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P11, arg1'=arg1P11, (3-arg1P11+arg1 >= 0 /\ arg4 > 0 /\ -5+arg1P11 > 0 /\ -1+arg2 >= 0 /\ arg4P11 > 0), cost: arg2

Applied simplification
Original rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P12, arg1'=arg1P12, (1 > 0 /\ -5+arg1P12 > 0 /\ arg4 > 0 /\ 3+arg1-arg1P12 >= 0 /\ -1+arg2 >= 0 /\ arg4P12 > 0), cost: arg2
New rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P12, arg1'=arg1P12, (-5+arg1P12 > 0 /\ arg4 > 0 /\ 3+arg1-arg1P12 >= 0 /\ -1+arg2 >= 0 /\ arg4P12 > 0), cost: arg2

Applied deletion
Removed the following rules: 26 27 28 29

Accelerated simple loops
Start location: __init
  20: f1_0_main_Load -> f1843_0_main_InvokeMethod : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg2P0 > 0 /\ arg1P0 > 0 /\ -arg1+arg1P0 <= 0), cost: 1
  21: f1_0_main_Load -> f931_0_random_ArrayAccess : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg1P3 > 0 /\ arg1P3-arg1 <= 0), cost: 1
  22: f1_0_main_Load -> f977_0_random_ArrayAccess : arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (-arg1+arg1P5 <= 0 /\ arg1P5 > 0), cost: 1
  30: f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P16, arg1'=arg1P16, (arg1 > 0 /\ 1+arg1P16 > 0 /\ -arg2+arg1P16 <= 0), cost: 1
  24: f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P7, arg4'=1+x300, arg1'=arg1P7, arg3'=arg3P7, (x300 > 0 /\ 1+arg2P7 > 0 /\ -1+arg1P7 > 0 /\ -1-arg1+arg1P7 <= 0), cost: 1
  23: f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P6, arg4'=1+x250, arg1'=arg1P6, arg3'=arg3P6, (-3+arg1P6 > 0 /\ x250 > 0 /\ -3+arg1P6-arg1 <= 0 /\ 1+arg2P6 > 0), cost: 1
  25: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg1'=arg1P8, (arg2 > 0 /\ 1+arg1P8 > 0 /\ 2+arg1P8-arg1 <= 0), cost: 1
  37: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P9, arg1'=arg1P9, (-2+arg1 > 0 /\ -3+arg1P9 > 0 /\ arg4P9 > 0 /\ arg4 > 0 /\ -1+arg2 >= 0 /\ 2-arg1P9+arg1 >= 0), cost: arg2
  38: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P10, arg1'=arg1P10, (-2+arg1 > 0 /\ arg4 > 0 /\ arg4P10 > 0 /\ -1+arg2 >= 0 /\ -3+arg1P10 > 0 /\ 2-arg1P10+arg1 >= 0), cost: arg2
  39: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P11, arg1'=arg1P11, (3-arg1P11+arg1 >= 0 /\ arg4 > 0 /\ -5+arg1P11 > 0 /\ -1+arg2 >= 0 /\ arg4P11 > 0), cost: arg2
  40: f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P12, arg1'=arg1P12, (-5+arg1P12 > 0 /\ arg4 > 0 /\ 3+arg1-arg1P12 >= 0 /\ -1+arg2 >= 0 /\ arg4P12 > 0), cost: arg2
  31: f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg4'=arg4P17, arg1'=arg1P17, arg3'=1+arg3, (1+arg1P17 > 0 /\ 1+arg2 > 0 /\ 1-arg1+arg1P17 <= 0 /\ 1+arg3 > 0), cost: 1
  32: f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg4'=arg4P18, arg1'=arg1P18, arg3'=1+arg3, (1-arg1+arg1P18 <= 0 /\ 1+arg2 > 0 /\ 1+arg3 > 0 /\ 1+arg1P18 > 0), cost: 1
  19: __init -> f1_0_main_Load : arg2'=arg2P19, arg4'=arg4P19, arg1'=arg1P19, arg3'=arg3P19, TRUE, cost: 1


Applied chaining
First rule:
f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P6, arg4'=1+x250, arg1'=arg1P6, arg3'=arg3P6, (-3+arg1P6 > 0 /\ x250 > 0 /\ -3+arg1P6-arg1 <= 0 /\ 1+arg2P6 > 0), cost: 1
Second rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg1'=arg1P8, (arg2 > 0 /\ 1+arg1P8 > 0 /\ 2+arg1P8-arg1 <= 0), cost: 1
New rule:
f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=-1+arg2P6, arg4'=1+x250, arg1'=arg1P8, arg3'=arg3P6, (-1+arg1P8-arg1 <= 0 /\ arg2P6 > 0 /\ 1+arg1P8 > 0 /\ x250 > 0 /\ 1-arg1 <= 0), cost: 2

Applied chaining
First rule:
f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P7, arg4'=1+x300, arg1'=arg1P7, arg3'=arg3P7, (x300 > 0 /\ 1+arg2P7 > 0 /\ -1+arg1P7 > 0 /\ -1-arg1+arg1P7 <= 0), cost: 1
Second rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=-1+arg2, arg1'=arg1P8, (arg2 > 0 /\ 1+arg1P8 > 0 /\ 2+arg1P8-arg1 <= 0), cost: 1
New rule:
f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=-1+arg2P7, arg4'=1+x300, arg1'=arg1P8, arg3'=arg3P7, (x300 > 0 /\ 1+arg1P8 > 0 /\ arg2P7 > 0 /\ 1+arg1P8-arg1 <= 0), cost: 2

Applied chaining
First rule:
f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P6, arg4'=1+x250, arg1'=arg1P6, arg3'=arg3P6, (-3+arg1P6 > 0 /\ x250 > 0 /\ -3+arg1P6-arg1 <= 0 /\ 1+arg2P6 > 0), cost: 1
Second rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P9, arg1'=arg1P9, (-2+arg1 > 0 /\ -3+arg1P9 > 0 /\ arg4P9 > 0 /\ arg4 > 0 /\ -1+arg2 >= 0 /\ 2-arg1P9+arg1 >= 0), cost: arg2
New rule:
f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P9, arg1'=arg1P9, arg3'=arg3P6, (-3+arg1P9 > 0 /\ arg4P9 > 0 /\ -1+arg2P6 >= 0 /\ -5+arg1P9-arg1 <= 0 /\ 1-arg1 <= 0), cost: 1+arg2P6

Applied chaining
First rule:
f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P7, arg4'=1+x300, arg1'=arg1P7, arg3'=arg3P7, (x300 > 0 /\ 1+arg2P7 > 0 /\ -1+arg1P7 > 0 /\ -1-arg1+arg1P7 <= 0), cost: 1
Second rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P9, arg1'=arg1P9, (-2+arg1 > 0 /\ -3+arg1P9 > 0 /\ arg4P9 > 0 /\ arg4 > 0 /\ -1+arg2 >= 0 /\ 2-arg1P9+arg1 >= 0), cost: arg2
New rule:
f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P9, arg1'=arg1P9, arg3'=arg3P7, (-2+arg1 >= 0 /\ -3+arg1P9 > 0 /\ arg4P9 > 0 /\ -1+arg2P7 >= 0 /\ -3+arg1P9-arg1 <= 0), cost: 1+arg2P7

Applied chaining
First rule:
f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P6, arg4'=1+x250, arg1'=arg1P6, arg3'=arg3P6, (-3+arg1P6 > 0 /\ x250 > 0 /\ -3+arg1P6-arg1 <= 0 /\ 1+arg2P6 > 0), cost: 1
Second rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P10, arg1'=arg1P10, (-2+arg1 > 0 /\ arg4 > 0 /\ arg4P10 > 0 /\ -1+arg2 >= 0 /\ -3+arg1P10 > 0 /\ 2-arg1P10+arg1 >= 0), cost: arg2
New rule:
f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P6, (-1+arg2P6 >= 0 /\ arg4P10 > 0 /\ -3+arg1P10 > 0 /\ -1+arg1 >= 0 /\ -5+arg1P10-arg1 <= 0), cost: 1+arg2P6

Applied chaining
First rule:
f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P7, arg4'=1+x300, arg1'=arg1P7, arg3'=arg3P7, (x300 > 0 /\ 1+arg2P7 > 0 /\ -1+arg1P7 > 0 /\ -1-arg1+arg1P7 <= 0), cost: 1
Second rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P10, arg1'=arg1P10, (-2+arg1 > 0 /\ arg4 > 0 /\ arg4P10 > 0 /\ -1+arg2 >= 0 /\ -3+arg1P10 > 0 /\ 2-arg1P10+arg1 >= 0), cost: arg2
New rule:
f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P7, (-2+arg1 >= 0 /\ arg4P10 > 0 /\ -1+arg2P7 >= 0 /\ -3+arg1P10-arg1 <= 0 /\ -3+arg1P10 > 0), cost: 1+arg2P7

Applied chaining
First rule:
f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P6, arg4'=1+x250, arg1'=arg1P6, arg3'=arg3P6, (-3+arg1P6 > 0 /\ x250 > 0 /\ -3+arg1P6-arg1 <= 0 /\ 1+arg2P6 > 0), cost: 1
Second rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P11, arg1'=arg1P11, (3-arg1P11+arg1 >= 0 /\ arg4 > 0 /\ -5+arg1P11 > 0 /\ -1+arg2 >= 0 /\ arg4P11 > 0), cost: arg2
New rule:
f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P6, (-1+arg2P6 >= 0 /\ -6+arg1P11-arg1 <= 0 /\ -5+arg1P11 > 0 /\ arg4P11 > 0 /\ 1-arg1 <= 0), cost: 1+arg2P6

Applied chaining
First rule:
f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P7, arg4'=1+x300, arg1'=arg1P7, arg3'=arg3P7, (x300 > 0 /\ 1+arg2P7 > 0 /\ -1+arg1P7 > 0 /\ -1-arg1+arg1P7 <= 0), cost: 1
Second rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P11, arg1'=arg1P11, (3-arg1P11+arg1 >= 0 /\ arg4 > 0 /\ -5+arg1P11 > 0 /\ -1+arg2 >= 0 /\ arg4P11 > 0), cost: arg2
New rule:
f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P7, (-4+arg1P11-arg1 <= 0 /\ -1+arg2P7 >= 0 /\ -5+arg1P11 > 0 /\ arg4P11 > 0), cost: 1+arg2P7

Applied chaining
First rule:
f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P6, arg4'=1+x250, arg1'=arg1P6, arg3'=arg3P6, (-3+arg1P6 > 0 /\ x250 > 0 /\ -3+arg1P6-arg1 <= 0 /\ 1+arg2P6 > 0), cost: 1
Second rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P12, arg1'=arg1P12, (-5+arg1P12 > 0 /\ arg4 > 0 /\ 3+arg1-arg1P12 >= 0 /\ -1+arg2 >= 0 /\ arg4P12 > 0), cost: arg2
New rule:
f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P6, (-5+arg1P12 > 0 /\ -1+arg2P6 >= 0 /\ -6-arg1+arg1P12 <= 0 /\ 1-arg1 <= 0 /\ arg4P12 > 0), cost: 1+arg2P6

Applied chaining
First rule:
f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P7, arg4'=1+x300, arg1'=arg1P7, arg3'=arg3P7, (x300 > 0 /\ 1+arg2P7 > 0 /\ -1+arg1P7 > 0 /\ -1-arg1+arg1P7 <= 0), cost: 1
Second rule:
f2251_0_createTree_LE -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P12, arg1'=arg1P12, (-5+arg1P12 > 0 /\ arg4 > 0 /\ 3+arg1-arg1P12 >= 0 /\ -1+arg2 >= 0 /\ arg4P12 > 0), cost: arg2
New rule:
f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P7, (-5+arg1P12 > 0 /\ -1+arg2P7 >= 0 /\ -4-arg1+arg1P12 <= 0 /\ arg4P12 > 0), cost: 1+arg2P7

Applied deletion
Removed the following rules: 25 37 38 39 40

Applied chaining
First rule:
f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P16, arg1'=arg1P16, (arg1 > 0 /\ 1+arg1P16 > 0 /\ -arg2+arg1P16 <= 0), cost: 1
Second rule:
f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg4'=arg4P17, arg1'=arg1P17, arg3'=1+arg3, (1+arg1P17 > 0 /\ 1+arg2 > 0 /\ 1-arg1+arg1P17 <= 0 /\ 1+arg3 > 0), cost: 1
New rule:
f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P17, arg1'=arg1P17, arg3'=1+arg3, (1-arg2+arg1P17 <= 0 /\ 1+arg1P17 > 0 /\ arg1 > 0 /\ 1+arg3 > 0 /\ 1+arg2P16 > 0), cost: 2

Applied chaining
First rule:
f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P16, arg1'=arg1P16, (arg1 > 0 /\ 1+arg1P16 > 0 /\ -arg2+arg1P16 <= 0), cost: 1
Second rule:
f2233_0_randomlyDuplicate_NULL -> f2233_0_randomlyDuplicate_NULL : arg4'=arg4P18, arg1'=arg1P18, arg3'=1+arg3, (1-arg1+arg1P18 <= 0 /\ 1+arg2 > 0 /\ 1+arg3 > 0 /\ 1+arg1P18 > 0), cost: 1
New rule:
f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P18, arg1'=arg1P18, arg3'=1+arg3, (arg1 > 0 /\ 1-arg2+arg1P18 <= 0 /\ 1+arg3 > 0 /\ 1+arg1P18 > 0 /\ 1+arg2P16 > 0), cost: 2

Applied deletion
Removed the following rules: 31 32

Chained accelerated rules with incoming rules
Start location: __init
  20: f1_0_main_Load -> f1843_0_main_InvokeMethod : arg2'=arg2P0, arg4'=arg4P0, arg1'=arg1P0, arg3'=arg3P0, (1+arg2P0 > 0 /\ arg1P0 > 0 /\ -arg1+arg1P0 <= 0), cost: 1
  21: f1_0_main_Load -> f931_0_random_ArrayAccess : arg2'=arg2P3, arg4'=arg4P3, arg1'=arg1P3, arg3'=arg3P3, (arg1P3 > 0 /\ arg1P3-arg1 <= 0), cost: 1
  22: f1_0_main_Load -> f977_0_random_ArrayAccess : arg2'=arg2P5, arg4'=arg4P5, arg1'=arg1P5, arg3'=arg3P5, (-arg1+arg1P5 <= 0 /\ arg1P5 > 0), cost: 1
  30: f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P16, arg1'=arg1P16, (arg1 > 0 /\ 1+arg1P16 > 0 /\ -arg2+arg1P16 <= 0), cost: 1
  51: f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P17, arg1'=arg1P17, arg3'=1+arg3, (1-arg2+arg1P17 <= 0 /\ 1+arg1P17 > 0 /\ arg1 > 0 /\ 1+arg3 > 0 /\ 1+arg2P16 > 0), cost: 2
  52: f1843_0_main_InvokeMethod -> f2233_0_randomlyDuplicate_NULL : arg2'=arg2P16, arg4'=arg4P18, arg1'=arg1P18, arg3'=1+arg3, (arg1 > 0 /\ 1-arg2+arg1P18 <= 0 /\ 1+arg3 > 0 /\ 1+arg1P18 > 0 /\ 1+arg2P16 > 0), cost: 2
  24: f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P7, arg4'=1+x300, arg1'=arg1P7, arg3'=arg3P7, (x300 > 0 /\ 1+arg2P7 > 0 /\ -1+arg1P7 > 0 /\ -1-arg1+arg1P7 <= 0), cost: 1
  42: f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=-1+arg2P7, arg4'=1+x300, arg1'=arg1P8, arg3'=arg3P7, (x300 > 0 /\ 1+arg1P8 > 0 /\ arg2P7 > 0 /\ 1+arg1P8-arg1 <= 0), cost: 2
  44: f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P9, arg1'=arg1P9, arg3'=arg3P7, (-2+arg1 >= 0 /\ -3+arg1P9 > 0 /\ arg4P9 > 0 /\ -1+arg2P7 >= 0 /\ -3+arg1P9-arg1 <= 0), cost: 1+arg2P7
  46: f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P7, (-2+arg1 >= 0 /\ arg4P10 > 0 /\ -1+arg2P7 >= 0 /\ -3+arg1P10-arg1 <= 0 /\ -3+arg1P10 > 0), cost: 1+arg2P7
  48: f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P7, (-4+arg1P11-arg1 <= 0 /\ -1+arg2P7 >= 0 /\ -5+arg1P11 > 0 /\ arg4P11 > 0), cost: 1+arg2P7
  50: f931_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P7, (-5+arg1P12 > 0 /\ -1+arg2P7 >= 0 /\ -4-arg1+arg1P12 <= 0 /\ arg4P12 > 0), cost: 1+arg2P7
  23: f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=arg2P6, arg4'=1+x250, arg1'=arg1P6, arg3'=arg3P6, (-3+arg1P6 > 0 /\ x250 > 0 /\ -3+arg1P6-arg1 <= 0 /\ 1+arg2P6 > 0), cost: 1
  41: f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=-1+arg2P6, arg4'=1+x250, arg1'=arg1P8, arg3'=arg3P6, (-1+arg1P8-arg1 <= 0 /\ arg2P6 > 0 /\ 1+arg1P8 > 0 /\ x250 > 0 /\ 1-arg1 <= 0), cost: 2
  43: f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P9, arg1'=arg1P9, arg3'=arg3P6, (-3+arg1P9 > 0 /\ arg4P9 > 0 /\ -1+arg2P6 >= 0 /\ -5+arg1P9-arg1 <= 0 /\ 1-arg1 <= 0), cost: 1+arg2P6
  45: f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P10, arg1'=arg1P10, arg3'=arg3P6, (-1+arg2P6 >= 0 /\ arg4P10 > 0 /\ -3+arg1P10 > 0 /\ -1+arg1 >= 0 /\ -5+arg1P10-arg1 <= 0), cost: 1+arg2P6
  47: f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P11, arg1'=arg1P11, arg3'=arg3P6, (-1+arg2P6 >= 0 /\ -6+arg1P11-arg1 <= 0 /\ -5+arg1P11 > 0 /\ arg4P11 > 0 /\ 1-arg1 <= 0), cost: 1+arg2P6
  49: f977_0_random_ArrayAccess -> f2251_0_createTree_LE : arg2'=0, arg4'=arg4P12, arg1'=arg1P12, arg3'=arg3P6, (-5+arg1P12 > 0 /\ -1+arg2P6 >= 0 /\ -6-arg1+arg1P12 <= 0 /\ 1-arg1 <= 0 /\ arg4P12 > 0), cost: 1+arg2P6
  19: __init -> f1_0_main_Load : arg2'=arg2P19, arg4'=arg4P19, arg1'=arg1P19, arg3'=arg3P19, TRUE, cost: 1


Removed unreachable locations and irrelevant leafs
Start location: __init
  <empty>


Computing asymptotic complexity

Proved the following lower bound
Complexity:  Unknown
Cpx degree: ?

Solved cost: 0
Rule cost:   0