NO

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

Initial linear ITS problem
   Start location: __init
      0: f1_0_main_Load -> f543_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2>0 && arg1P_1>-1 && arg1>0 && arg2==arg2P_1 && 1==arg3P_1 ], cost: 1
      1: f1_0_main_Load -> f1156_0_random_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>0 && x8_1>-1 && arg1>0 && arg1P_2>1 && arg2==arg2P_2 && 0==arg3P_2 ], cost: 1
      3: f1_0_main_Load -> f3334_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg2>0 && arg4P_4>-1 && arg1P_4<=arg1 && 1+arg2P_4<=arg1 && arg1>0 && arg1P_4>0 && arg2P_4>-1 && -1+arg4P_4==arg3P_4 && 2==arg5P_4 ], cost: 1
      8: f543_0_createTree_GT -> f998_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>-1 && arg3>0 && arg1>0 && arg2P_9>-1 && arg1==arg1P_9 && arg2==arg3P_9 && 1+arg3==arg4P_9 ], cost: 1
      4: f1156_0_random_ArrayAccess -> f3334_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ x150_1>0 && arg4P_5>-1 && 1+arg1P_5<=arg1 && arg2P_5<=arg1 && arg1>1 && arg1P_5>0 && arg2P_5>1 && 2+arg4<=arg1 && 0==arg3 && -1+arg4P_5==arg3P_5 && 1+x150_1==arg5P_5 ], cost: 1
      2: f814_0_createTree_Return -> f1156_0_random_ArrayAccess : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, arg5'=arg5P_3, arg6'=arg6P_3, [ arg1P_3<=arg2 && arg1>0 && arg2>1 && arg1P_3>1 && 2+arg5<=arg2 && 0==arg4 && 0==arg3P_3 && arg5==arg4P_3 ], cost: 1
      5: f3334_0_main_LE -> f3430_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ x27_1>0 && arg4>0 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg4P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg3P_6>-1 && arg4P_6>0 && 1+arg6P_6<=arg2 && arg3==arg2P_6 ], cost: 1
      6: f3334_0_main_LE -> f3430_0_main_InvokeMethod : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ x38_1>0 && arg4>0 && arg1P_7<=arg1 && arg1P_7<=arg2 && arg4P_7<=arg2 && arg1>0 && arg2>0 && arg1P_7>0 && arg3P_7>1 && arg4P_7>0 && 1+arg6P_7<=arg2 && arg3==arg2P_7 ], cost: 1
     12: f3334_0_main_LE -> f2378_0_random_ArrayAccess : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ x75_1>0 && arg4>0 && arg1P_13<=arg2 && arg1>0 && arg2>0 && arg1P_13>0 && 1+arg2P_13<=arg2 ], cost: 1
     19: f3334_0_main_LE -> f3446_0_visit_NE : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, arg5'=arg5P_20, arg6'=arg6P_20, [ x120_1>0 && arg4<1 && arg1P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && 2+arg4P_20<=arg2 && 2+arg2P_20<=arg2 && arg2P_20==arg3P_20 ], cost: 1
      7: f3430_0_main_InvokeMethod -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8<=arg1 && x49_1>0 && arg1P_8<=arg3 && arg1P_8<=arg4 && arg1>0 && arg3>0 && arg4>0 && arg1P_8>0 && arg2P_8>0 && 1+arg6<=arg4 && -1+arg2==arg3P_8 && arg2==arg4P_8 ], cost: 1
     13: f3430_0_main_InvokeMethod -> f2378_0_random_ArrayAccess : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1P_14<=arg4 && x83_1>0 && arg1>0 && arg3>-1 && arg4>0 && arg1P_14>0 && 1+arg6<=arg4 && arg6==arg2P_14 ], cost: 1
      9: f998_0_createTree_LE -> f543_0_createTree_GT : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1>0 && arg2>0 && -1+arg1<arg1 && arg4>1 && -1+arg1==arg1P_10 && arg3==arg2P_10 && arg4==arg3P_10 ], cost: 1
     10: f998_0_createTree_LE -> f998_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2>0 && arg4>1 && 1==arg1 && 1==arg1P_11 && -1+arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
     11: f998_0_createTree_LE -> f998_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg1>0 && arg2>0 && -1+arg1<arg1 && arg4>1 && arg1==arg1P_12 && -1+arg2==arg2P_12 && arg3==arg3P_12 ], cost: 1
     14: f2378_0_random_ArrayAccess -> f3147_0_getRandom_LT : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, arg6'=arg6P_15, [ x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1 && arg1>0 && arg2P_15>0 && 1+arg2<=arg1 && -1+arg3P_15==arg1P_15 && 1+x91_1==arg4P_15 ], cost: 1
     15: f3147_0_getRandom_LT -> f3577_0_getRandom_LT : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, arg6'=arg6P_16, [ arg4P_16>-1 && arg4>-1 && arg3>-1 && arg2>=2+arg3P_16 && arg2>2 && arg3P_16>0 && arg1==arg1P_16 && -1+arg4P_16==arg2P_16 && 1+arg4==arg5P_16 ], cost: 1
     16: f3577_0_getRandom_LT -> f3577_0_getRandom_LT : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, arg5'=arg5P_17, arg6'=arg6P_17, [ 2+arg3P_17<=arg3 && arg4>-1 && arg3>2 && arg3P_17>0 && arg1==arg1P_17 && -1+arg2==arg2P_17 && arg2==arg4P_17 && arg5==arg5P_17 ], cost: 1
     17: f3577_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, arg5'=arg5P_18, arg6'=arg6P_18, [ arg3>0 && arg4<0 && arg2P_18>-1 && -1+arg1==arg1P_18 && arg1==arg3P_18 && arg5==arg4P_18 ], cost: 1
     18: f3577_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, arg5'=arg5P_19, arg6'=arg6P_19, [ arg3>1 && arg4>-1 && arg2P_19>-1 && -1+arg1==arg1P_19 && arg1==arg3P_19 && arg5==arg4P_19 ], cost: 1
     20: f3446_0_visit_NE -> f3530_0_visit_NULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, arg5'=arg5P_21, arg6'=arg6P_21, [ arg1>0 && arg2P_21>-1 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 && arg2==arg1P_21 ], cost: 1
     21: f3530_0_visit_NULL -> f3446_0_visit_NE : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, arg5'=arg5P_22, arg6'=arg6P_22, [ arg2>0 && arg1P_22>0 && arg1==arg2P_22 ], cost: 1
     22: f3530_0_visit_NULL -> f3530_0_visit_NULL : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, arg5'=arg5P_23, arg6'=arg6P_23, [ 1+arg2P_23<=arg2 && arg2>0 && arg2P_23>-1 && arg1==arg1P_23 && arg3==arg3P_23 ], cost: 1
     23: __init -> f1_0_main_Load : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, arg5'=arg5P_24, arg6'=arg6P_24, [], cost: 1

Checking for constant complexity:
   The following rule is satisfiable with cost >= 1, yielding constant complexity:
     23: __init -> f1_0_main_Load : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, arg5'=arg5P_24, arg6'=arg6P_24, [], cost: 1

Removed unreachable and leaf rules:
   Start location: __init
      0: f1_0_main_Load -> f543_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2>0 && arg1P_1>-1 && arg1>0 && arg2==arg2P_1 && 1==arg3P_1 ], cost: 1
      1: f1_0_main_Load -> f1156_0_random_ArrayAccess : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>0 && x8_1>-1 && arg1>0 && arg1P_2>1 && arg2==arg2P_2 && 0==arg3P_2 ], cost: 1
      3: f1_0_main_Load -> f3334_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, arg5'=arg5P_4, arg6'=arg6P_4, [ arg2>0 && arg4P_4>-1 && arg1P_4<=arg1 && 1+arg2P_4<=arg1 && arg1>0 && arg1P_4>0 && arg2P_4>-1 && -1+arg4P_4==arg3P_4 && 2==arg5P_4 ], cost: 1
      8: f543_0_createTree_GT -> f998_0_createTree_LE : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>-1 && arg3>0 && arg1>0 && arg2P_9>-1 && arg1==arg1P_9 && arg2==arg3P_9 && 1+arg3==arg4P_9 ], cost: 1
      4: f1156_0_random_ArrayAccess -> f3334_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, arg5'=arg5P_5, arg6'=arg6P_5, [ x150_1>0 && arg4P_5>-1 && 1+arg1P_5<=arg1 && arg2P_5<=arg1 && arg1>1 && arg1P_5>0 && arg2P_5>1 && 2+arg4<=arg1 && 0==arg3 && -1+arg4P_5==arg3P_5 && 1+x150_1==arg5P_5 ], cost: 1
      5: f3334_0_main_LE -> f3430_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ x27_1>0 && arg4>0 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg4P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg3P_6>-1 && arg4P_6>0 && 1+arg6P_6<=arg2 && arg3==arg2P_6 ], cost: 1
      6: f3334_0_main_LE -> f3430_0_main_InvokeMethod : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ x38_1>0 && arg4>0 && arg1P_7<=arg1 && arg1P_7<=arg2 && arg4P_7<=arg2 && arg1>0 && arg2>0 && arg1P_7>0 && arg3P_7>1 && arg4P_7>0 && 1+arg6P_7<=arg2 && arg3==arg2P_7 ], cost: 1
     12: f3334_0_main_LE -> f2378_0_random_ArrayAccess : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ x75_1>0 && arg4>0 && arg1P_13<=arg2 && arg1>0 && arg2>0 && arg1P_13>0 && 1+arg2P_13<=arg2 ], cost: 1
     19: f3334_0_main_LE -> f3446_0_visit_NE : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, arg5'=arg5P_20, arg6'=arg6P_20, [ x120_1>0 && arg4<1 && arg1P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && 2+arg4P_20<=arg2 && 2+arg2P_20<=arg2 && arg2P_20==arg3P_20 ], cost: 1
      7: f3430_0_main_InvokeMethod -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8<=arg1 && x49_1>0 && arg1P_8<=arg3 && arg1P_8<=arg4 && arg1>0 && arg3>0 && arg4>0 && arg1P_8>0 && arg2P_8>0 && 1+arg6<=arg4 && -1+arg2==arg3P_8 && arg2==arg4P_8 ], cost: 1
     13: f3430_0_main_InvokeMethod -> f2378_0_random_ArrayAccess : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1P_14<=arg4 && x83_1>0 && arg1>0 && arg3>-1 && arg4>0 && arg1P_14>0 && 1+arg6<=arg4 && arg6==arg2P_14 ], cost: 1
      9: f998_0_createTree_LE -> f543_0_createTree_GT : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1>0 && arg2>0 && -1+arg1<arg1 && arg4>1 && -1+arg1==arg1P_10 && arg3==arg2P_10 && arg4==arg3P_10 ], cost: 1
     10: f998_0_createTree_LE -> f998_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2>0 && arg4>1 && 1==arg1 && 1==arg1P_11 && -1+arg2==arg2P_11 && arg3==arg3P_11 && arg4==arg4P_11 ], cost: 1
     11: f998_0_createTree_LE -> f998_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg1>0 && arg2>0 && -1+arg1<arg1 && arg4>1 && arg1==arg1P_12 && -1+arg2==arg2P_12 && arg3==arg3P_12 ], cost: 1
     14: f2378_0_random_ArrayAccess -> f3147_0_getRandom_LT : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, arg5'=arg5P_15, arg6'=arg6P_15, [ x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1 && arg1>0 && arg2P_15>0 && 1+arg2<=arg1 && -1+arg3P_15==arg1P_15 && 1+x91_1==arg4P_15 ], cost: 1
     15: f3147_0_getRandom_LT -> f3577_0_getRandom_LT : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=arg5P_16, arg6'=arg6P_16, [ arg4P_16>-1 && arg4>-1 && arg3>-1 && arg2>=2+arg3P_16 && arg2>2 && arg3P_16>0 && arg1==arg1P_16 && -1+arg4P_16==arg2P_16 && 1+arg4==arg5P_16 ], cost: 1
     16: f3577_0_getRandom_LT -> f3577_0_getRandom_LT : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, arg5'=arg5P_17, arg6'=arg6P_17, [ 2+arg3P_17<=arg3 && arg4>-1 && arg3>2 && arg3P_17>0 && arg1==arg1P_17 && -1+arg2==arg2P_17 && arg2==arg4P_17 && arg5==arg5P_17 ], cost: 1
     17: f3577_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, arg5'=arg5P_18, arg6'=arg6P_18, [ arg3>0 && arg4<0 && arg2P_18>-1 && -1+arg1==arg1P_18 && arg1==arg3P_18 && arg5==arg4P_18 ], cost: 1
     18: f3577_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, arg5'=arg5P_19, arg6'=arg6P_19, [ arg3>1 && arg4>-1 && arg2P_19>-1 && -1+arg1==arg1P_19 && arg1==arg3P_19 && arg5==arg4P_19 ], cost: 1
     20: f3446_0_visit_NE -> f3530_0_visit_NULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, arg5'=arg5P_21, arg6'=arg6P_21, [ arg1>0 && arg2P_21>-1 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 && arg2==arg1P_21 ], cost: 1
     21: f3530_0_visit_NULL -> f3446_0_visit_NE : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, arg5'=arg5P_22, arg6'=arg6P_22, [ arg2>0 && arg1P_22>0 && arg1==arg2P_22 ], cost: 1
     22: f3530_0_visit_NULL -> f3530_0_visit_NULL : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, arg5'=arg5P_23, arg6'=arg6P_23, [ 1+arg2P_23<=arg2 && arg2>0 && arg2P_23>-1 && arg1==arg1P_23 && arg3==arg3P_23 ], cost: 1
     23: __init -> f1_0_main_Load : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, arg5'=arg5P_24, arg6'=arg6P_24, [], cost: 1

Simplified all rules, resulting in:
   Start location: __init
      0: f1_0_main_Load -> f543_0_createTree_GT : arg1'=arg1P_1, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2>0 && arg1P_1>-1 && arg1>0 ], cost: 1
      1: f1_0_main_Load -> f1156_0_random_ArrayAccess : arg1'=arg1P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>0 && arg1>0 && arg1P_2>1 ], cost: 1
      3: f1_0_main_Load -> f3334_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg4P_4, arg4'=arg4P_4, arg5'=2, arg6'=arg6P_4, [ arg2>0 && arg4P_4>-1 && arg1P_4<=arg1 && 1+arg2P_4<=arg1 && arg1>0 && arg1P_4>0 && arg2P_4>-1 ], cost: 1
      8: f543_0_createTree_GT -> f998_0_createTree_LE : arg2'=arg2P_9, arg3'=arg2, arg4'=1+arg3, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>-1 && arg3>0 && arg1>0 && arg2P_9>-1 ], cost: 1
      4: f1156_0_random_ArrayAccess -> f3334_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=1+arg3P_5, arg5'=1+x150_1, arg6'=arg6P_5, [ x150_1>0 && 1+arg3P_5>-1 && 1+arg1P_5<=arg1 && arg2P_5<=arg1 && arg1>1 && arg1P_5>0 && arg2P_5>1 && 2+arg4<=arg1 && 0==arg3 ], cost: 1
      5: f3334_0_main_LE -> f3430_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg3, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg4>0 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg4P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg3P_6>-1 && arg4P_6>0 && 1+arg6P_6<=arg2 ], cost: 1
      6: f3334_0_main_LE -> f3430_0_main_InvokeMethod : arg1'=arg1P_7, arg2'=arg3, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg4>0 && arg1P_7<=arg1 && arg1P_7<=arg2 && arg4P_7<=arg2 && arg1>0 && arg2>0 && arg1P_7>0 && arg3P_7>1 && arg4P_7>0 && 1+arg6P_7<=arg2 ], cost: 1
     12: f3334_0_main_LE -> f2378_0_random_ArrayAccess : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg4>0 && arg1P_13<=arg2 && arg1>0 && arg2>0 && arg1P_13>0 && 1+arg2P_13<=arg2 ], cost: 1
     19: f3334_0_main_LE -> f3446_0_visit_NE : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg2P_20, arg4'=arg4P_20, arg5'=arg5P_20, arg6'=arg6P_20, [ arg4<1 && arg1P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && 2+arg4P_20<=arg2 && 2+arg2P_20<=arg2 ], cost: 1
      7: f3430_0_main_InvokeMethod -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg2, arg4'=arg2, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8<=arg1 && arg1P_8<=arg3 && arg1P_8<=arg4 && arg1>0 && arg3>0 && arg4>0 && arg1P_8>0 && arg2P_8>0 && 1+arg6<=arg4 ], cost: 1
     13: f3430_0_main_InvokeMethod -> f2378_0_random_ArrayAccess : arg1'=arg1P_14, arg2'=arg6, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1P_14<=arg4 && arg1>0 && arg3>-1 && arg4>0 && arg1P_14>0 && 1+arg6<=arg4 ], cost: 1
      9: f998_0_createTree_LE -> f543_0_createTree_GT : arg1'=-1+arg1, arg2'=arg3, arg3'=arg4, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1>0 && arg2>0 && arg4>1 ], cost: 1
     10: f998_0_createTree_LE -> f998_0_createTree_LE : arg1'=1, arg2'=-1+arg2, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2>0 && arg4>1 && 1==arg1 ], cost: 1
     11: f998_0_createTree_LE -> f998_0_createTree_LE : arg2'=-1+arg2, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg1>0 && arg2>0 && arg4>1 ], cost: 1
     14: f2378_0_random_ArrayAccess -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1 && arg1>0 && arg2P_15>0 && 1+arg2<=arg1 ], cost: 1
     15: f3147_0_getRandom_LT -> f3577_0_getRandom_LT : arg2'=-1+arg4P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=1+arg4, arg6'=arg6P_16, [ arg4P_16>-1 && arg4>-1 && arg3>-1 && arg2>=2+arg3P_16 && arg2>2 && arg3P_16>0 ], cost: 1
     16: f3577_0_getRandom_LT -> f3577_0_getRandom_LT : arg2'=-1+arg2, arg3'=arg3P_17, arg4'=arg2, arg6'=arg6P_17, [ 2+arg3P_17<=arg3 && arg4>-1 && arg3>2 && arg3P_17>0 ], cost: 1
     17: f3577_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_18, arg3'=arg1, arg4'=arg5, arg5'=arg5P_18, arg6'=arg6P_18, [ arg3>0 && arg4<0 && arg2P_18>-1 ], cost: 1
     18: f3577_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_19, arg3'=arg1, arg4'=arg5, arg5'=arg5P_19, arg6'=arg6P_19, [ arg3>1 && arg4>-1 && arg2P_19>-1 ], cost: 1
     20: f3446_0_visit_NE -> f3530_0_visit_NULL : arg1'=arg2, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, arg5'=arg5P_21, arg6'=arg6P_21, [ arg1>0 && arg2P_21>-1 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 ], cost: 1
     21: f3530_0_visit_NULL -> f3446_0_visit_NE : arg1'=arg1P_22, arg2'=arg1, arg3'=arg3P_22, arg4'=arg4P_22, arg5'=arg5P_22, arg6'=arg6P_22, [ arg2>0 && arg1P_22>0 ], cost: 1
     22: f3530_0_visit_NULL -> f3530_0_visit_NULL : arg2'=arg2P_23, arg4'=arg4P_23, arg5'=arg5P_23, arg6'=arg6P_23, [ 1+arg2P_23<=arg2 && arg2>0 && arg2P_23>-1 ], cost: 1
     23: __init -> f1_0_main_Load : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, arg5'=arg5P_24, arg6'=arg6P_24, [], cost: 1

### Simplification by acceleration and chaining ###

Accelerating simple loops of location 6.
   Accelerating the following rules:
     10: f998_0_createTree_LE -> f998_0_createTree_LE : arg1'=1, arg2'=-1+arg2, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2>0 && arg4>1 && 1==arg1 ], cost: 1
     11: f998_0_createTree_LE -> f998_0_createTree_LE : arg2'=-1+arg2, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg1>0 && arg2>0 && arg4>1 ], cost: 1

   Accelerated rule 10 with backward acceleration, yielding the new rule 24.
[test] deduced pseudo-invariant arg4P_12-arg4<=0, also trying -arg4P_12+arg4<=-1
   Accelerated rule 11 with backward acceleration, yielding the new rule 25.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Removing the simple loops: 10.

Accelerating simple loops of location 9.
   Accelerating the following rules:
     16: f3577_0_getRandom_LT -> f3577_0_getRandom_LT : arg2'=-1+arg2, arg3'=arg3P_17, arg4'=arg2, arg6'=arg6P_17, [ 2+arg3P_17<=arg3 && arg4>-1 && arg3>2 && arg3P_17>0 ], cost: 1

   Failed to prove monotonicity of the guard of rule 16.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerating simple loops of location 11.
   Accelerating the following rules:
     22: f3530_0_visit_NULL -> f3530_0_visit_NULL : arg2'=arg2P_23, arg4'=arg4P_23, arg5'=arg5P_23, arg6'=arg6P_23, [ 1+arg2P_23<=arg2 && arg2>0 && arg2P_23>-1 ], cost: 1

   Failed to prove monotonicity of the guard of rule 22.
[accelerate] Nesting with 1 inner and 1 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
      0: f1_0_main_Load -> f543_0_createTree_GT : arg1'=arg1P_1, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2>0 && arg1P_1>-1 && arg1>0 ], cost: 1
      1: f1_0_main_Load -> f1156_0_random_ArrayAccess : arg1'=arg1P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>0 && arg1>0 && arg1P_2>1 ], cost: 1
      3: f1_0_main_Load -> f3334_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg4P_4, arg4'=arg4P_4, arg5'=2, arg6'=arg6P_4, [ arg2>0 && arg4P_4>-1 && arg1P_4<=arg1 && 1+arg2P_4<=arg1 && arg1>0 && arg1P_4>0 && arg2P_4>-1 ], cost: 1
      8: f543_0_createTree_GT -> f998_0_createTree_LE : arg2'=arg2P_9, arg3'=arg2, arg4'=1+arg3, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>-1 && arg3>0 && arg1>0 && arg2P_9>-1 ], cost: 1
      4: f1156_0_random_ArrayAccess -> f3334_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=1+arg3P_5, arg5'=1+x150_1, arg6'=arg6P_5, [ x150_1>0 && 1+arg3P_5>-1 && 1+arg1P_5<=arg1 && arg2P_5<=arg1 && arg1>1 && arg1P_5>0 && arg2P_5>1 && 2+arg4<=arg1 && 0==arg3 ], cost: 1
      5: f3334_0_main_LE -> f3430_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg3, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg4>0 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg4P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg3P_6>-1 && arg4P_6>0 && 1+arg6P_6<=arg2 ], cost: 1
      6: f3334_0_main_LE -> f3430_0_main_InvokeMethod : arg1'=arg1P_7, arg2'=arg3, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg4>0 && arg1P_7<=arg1 && arg1P_7<=arg2 && arg4P_7<=arg2 && arg1>0 && arg2>0 && arg1P_7>0 && arg3P_7>1 && arg4P_7>0 && 1+arg6P_7<=arg2 ], cost: 1
     12: f3334_0_main_LE -> f2378_0_random_ArrayAccess : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg4>0 && arg1P_13<=arg2 && arg1>0 && arg2>0 && arg1P_13>0 && 1+arg2P_13<=arg2 ], cost: 1
     19: f3334_0_main_LE -> f3446_0_visit_NE : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg2P_20, arg4'=arg4P_20, arg5'=arg5P_20, arg6'=arg6P_20, [ arg4<1 && arg1P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && 2+arg4P_20<=arg2 && 2+arg2P_20<=arg2 ], cost: 1
      7: f3430_0_main_InvokeMethod -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg2, arg4'=arg2, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8<=arg1 && arg1P_8<=arg3 && arg1P_8<=arg4 && arg1>0 && arg3>0 && arg4>0 && arg1P_8>0 && arg2P_8>0 && 1+arg6<=arg4 ], cost: 1
     13: f3430_0_main_InvokeMethod -> f2378_0_random_ArrayAccess : arg1'=arg1P_14, arg2'=arg6, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1P_14<=arg4 && arg1>0 && arg3>-1 && arg4>0 && arg1P_14>0 && 1+arg6<=arg4 ], cost: 1
      9: f998_0_createTree_LE -> f543_0_createTree_GT : arg1'=-1+arg1, arg2'=arg3, arg3'=arg4, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1>0 && arg2>0 && arg4>1 ], cost: 1
     11: f998_0_createTree_LE -> f998_0_createTree_LE : arg2'=-1+arg2, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg1>0 && arg2>0 && arg4>1 ], cost: 1
     24: f998_0_createTree_LE -> f998_0_createTree_LE : arg1'=1, arg2'=0, arg5'=arg5P_11, arg6'=arg6P_11, [ arg4>1 && 1==arg1 && arg2>=1 ], cost: arg2
     25: f998_0_createTree_LE -> f998_0_createTree_LE : arg2'=0, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg1>0 && arg4P_12-arg4<=0 && arg2>=1 && arg4P_12>1 ], cost: arg2
     14: f2378_0_random_ArrayAccess -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1 && arg1>0 && arg2P_15>0 && 1+arg2<=arg1 ], cost: 1
     15: f3147_0_getRandom_LT -> f3577_0_getRandom_LT : arg2'=-1+arg4P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=1+arg4, arg6'=arg6P_16, [ arg4P_16>-1 && arg4>-1 && arg3>-1 && arg2>=2+arg3P_16 && arg2>2 && arg3P_16>0 ], cost: 1
     16: f3577_0_getRandom_LT -> f3577_0_getRandom_LT : arg2'=-1+arg2, arg3'=arg3P_17, arg4'=arg2, arg6'=arg6P_17, [ 2+arg3P_17<=arg3 && arg4>-1 && arg3>2 && arg3P_17>0 ], cost: 1
     17: f3577_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_18, arg3'=arg1, arg4'=arg5, arg5'=arg5P_18, arg6'=arg6P_18, [ arg3>0 && arg4<0 && arg2P_18>-1 ], cost: 1
     18: f3577_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_19, arg3'=arg1, arg4'=arg5, arg5'=arg5P_19, arg6'=arg6P_19, [ arg3>1 && arg4>-1 && arg2P_19>-1 ], cost: 1
     20: f3446_0_visit_NE -> f3530_0_visit_NULL : arg1'=arg2, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, arg5'=arg5P_21, arg6'=arg6P_21, [ arg1>0 && arg2P_21>-1 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 ], cost: 1
     21: f3530_0_visit_NULL -> f3446_0_visit_NE : arg1'=arg1P_22, arg2'=arg1, arg3'=arg3P_22, arg4'=arg4P_22, arg5'=arg5P_22, arg6'=arg6P_22, [ arg2>0 && arg1P_22>0 ], cost: 1
     22: f3530_0_visit_NULL -> f3530_0_visit_NULL : arg2'=arg2P_23, arg4'=arg4P_23, arg5'=arg5P_23, arg6'=arg6P_23, [ 1+arg2P_23<=arg2 && arg2>0 && arg2P_23>-1 ], cost: 1
     23: __init -> f1_0_main_Load : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, arg5'=arg5P_24, arg6'=arg6P_24, [], cost: 1

Chained accelerated rules (with incoming rules):
   Start location: __init
      0: f1_0_main_Load -> f543_0_createTree_GT : arg1'=arg1P_1, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2>0 && arg1P_1>-1 && arg1>0 ], cost: 1
      1: f1_0_main_Load -> f1156_0_random_ArrayAccess : arg1'=arg1P_2, arg3'=0, arg4'=arg4P_2, arg5'=arg5P_2, arg6'=arg6P_2, [ arg2>0 && arg1>0 && arg1P_2>1 ], cost: 1
      3: f1_0_main_Load -> f3334_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg4P_4, arg4'=arg4P_4, arg5'=2, arg6'=arg6P_4, [ arg2>0 && arg4P_4>-1 && arg1P_4<=arg1 && 1+arg2P_4<=arg1 && arg1>0 && arg1P_4>0 && arg2P_4>-1 ], cost: 1
      8: f543_0_createTree_GT -> f998_0_createTree_LE : arg2'=arg2P_9, arg3'=arg2, arg4'=1+arg3, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>-1 && arg3>0 && arg1>0 && arg2P_9>-1 ], cost: 1
     26: f543_0_createTree_GT -> f998_0_createTree_LE : arg2'=-1+arg2P_9, arg3'=arg2, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2>-1 && arg3>0 && arg1>0 && arg2P_9>0 ], cost: 2
     27: f543_0_createTree_GT -> f998_0_createTree_LE : arg1'=1, arg2'=0, arg3'=arg2, arg4'=1+arg3, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2>-1 && arg3>0 && 1==arg1 && arg2P_9>=1 ], cost: 1+arg2P_9
     28: f543_0_createTree_GT -> f998_0_createTree_LE : arg2'=0, arg3'=arg2, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2>-1 && arg3>0 && arg1>0 && -1+arg4P_12-arg3<=0 && arg2P_9>=1 && arg4P_12>1 ], cost: 1+arg2P_9
      4: f1156_0_random_ArrayAccess -> f3334_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=1+arg3P_5, arg5'=1+x150_1, arg6'=arg6P_5, [ x150_1>0 && 1+arg3P_5>-1 && 1+arg1P_5<=arg1 && arg2P_5<=arg1 && arg1>1 && arg1P_5>0 && arg2P_5>1 && 2+arg4<=arg1 && 0==arg3 ], cost: 1
      5: f3334_0_main_LE -> f3430_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg3, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg4>0 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg4P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg3P_6>-1 && arg4P_6>0 && 1+arg6P_6<=arg2 ], cost: 1
      6: f3334_0_main_LE -> f3430_0_main_InvokeMethod : arg1'=arg1P_7, arg2'=arg3, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg4>0 && arg1P_7<=arg1 && arg1P_7<=arg2 && arg4P_7<=arg2 && arg1>0 && arg2>0 && arg1P_7>0 && arg3P_7>1 && arg4P_7>0 && 1+arg6P_7<=arg2 ], cost: 1
     12: f3334_0_main_LE -> f2378_0_random_ArrayAccess : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg4>0 && arg1P_13<=arg2 && arg1>0 && arg2>0 && arg1P_13>0 && 1+arg2P_13<=arg2 ], cost: 1
     19: f3334_0_main_LE -> f3446_0_visit_NE : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg2P_20, arg4'=arg4P_20, arg5'=arg5P_20, arg6'=arg6P_20, [ arg4<1 && arg1P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && 2+arg4P_20<=arg2 && 2+arg2P_20<=arg2 ], cost: 1
      7: f3430_0_main_InvokeMethod -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg2, arg4'=arg2, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8<=arg1 && arg1P_8<=arg3 && arg1P_8<=arg4 && arg1>0 && arg3>0 && arg4>0 && arg1P_8>0 && arg2P_8>0 && 1+arg6<=arg4 ], cost: 1
     13: f3430_0_main_InvokeMethod -> f2378_0_random_ArrayAccess : arg1'=arg1P_14, arg2'=arg6, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1P_14<=arg4 && arg1>0 && arg3>-1 && arg4>0 && arg1P_14>0 && 1+arg6<=arg4 ], cost: 1
      9: f998_0_createTree_LE -> f543_0_createTree_GT : arg1'=-1+arg1, arg2'=arg3, arg3'=arg4, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1>0 && arg2>0 && arg4>1 ], cost: 1
     14: f2378_0_random_ArrayAccess -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1 && arg1>0 && arg2P_15>0 && 1+arg2<=arg1 ], cost: 1
     15: f3147_0_getRandom_LT -> f3577_0_getRandom_LT : arg2'=-1+arg4P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=1+arg4, arg6'=arg6P_16, [ arg4P_16>-1 && arg4>-1 && arg3>-1 && arg2>=2+arg3P_16 && arg2>2 && arg3P_16>0 ], cost: 1
     29: f3147_0_getRandom_LT -> f3577_0_getRandom_LT : arg2'=-2+arg4P_16, arg3'=arg3P_17, arg4'=-1+arg4P_16, arg5'=1+arg4, arg6'=arg6P_17, [ arg4P_16>-1 && arg4>-1 && arg3>-1 && arg3P_17>0 && 2+arg3P_17<=-2+arg2 && 3<=-2+arg2 ], cost: 2
     17: f3577_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_18, arg3'=arg1, arg4'=arg5, arg5'=arg5P_18, arg6'=arg6P_18, [ arg3>0 && arg4<0 && arg2P_18>-1 ], cost: 1
     18: f3577_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_19, arg3'=arg1, arg4'=arg5, arg5'=arg5P_19, arg6'=arg6P_19, [ arg3>1 && arg4>-1 && arg2P_19>-1 ], cost: 1
     20: f3446_0_visit_NE -> f3530_0_visit_NULL : arg1'=arg2, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, arg5'=arg5P_21, arg6'=arg6P_21, [ arg1>0 && arg2P_21>-1 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 ], cost: 1
     30: f3446_0_visit_NE -> f3530_0_visit_NULL : arg1'=arg2, arg2'=arg2P_23, arg3'=arg3P_21, arg4'=arg4P_23, arg5'=arg5P_23, arg6'=arg6P_23, [ arg1>0 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 && arg2P_23>-1 ], cost: 2
     21: f3530_0_visit_NULL -> f3446_0_visit_NE : arg1'=arg1P_22, arg2'=arg1, arg3'=arg3P_22, arg4'=arg4P_22, arg5'=arg5P_22, arg6'=arg6P_22, [ arg2>0 && arg1P_22>0 ], cost: 1
     23: __init -> f1_0_main_Load : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, arg5'=arg5P_24, arg6'=arg6P_24, [], cost: 1

Eliminated locations (on linear paths):
   Start location: __init
      0: f1_0_main_Load -> f543_0_createTree_GT : arg1'=arg1P_1, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2>0 && arg1P_1>-1 && arg1>0 ], cost: 1
      3: f1_0_main_Load -> f3334_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg4P_4, arg4'=arg4P_4, arg5'=2, arg6'=arg6P_4, [ arg2>0 && arg4P_4>-1 && arg1P_4<=arg1 && 1+arg2P_4<=arg1 && arg1>0 && arg1P_4>0 && arg2P_4>-1 ], cost: 1
     31: f1_0_main_Load -> f3334_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=1+arg3P_5, arg5'=1+x150_1, arg6'=arg6P_5, [ arg2>0 && arg1>0 && arg1P_2>1 && x150_1>0 && 1+arg3P_5>-1 && 1+arg1P_5<=arg1P_2 && arg2P_5<=arg1P_2 && arg1P_5>0 && arg2P_5>1 && 2+arg4P_2<=arg1P_2 ], cost: 2
      8: f543_0_createTree_GT -> f998_0_createTree_LE : arg2'=arg2P_9, arg3'=arg2, arg4'=1+arg3, arg5'=arg5P_9, arg6'=arg6P_9, [ arg2>-1 && arg3>0 && arg1>0 && arg2P_9>-1 ], cost: 1
     26: f543_0_createTree_GT -> f998_0_createTree_LE : arg2'=-1+arg2P_9, arg3'=arg2, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2>-1 && arg3>0 && arg1>0 && arg2P_9>0 ], cost: 2
     27: f543_0_createTree_GT -> f998_0_createTree_LE : arg1'=1, arg2'=0, arg3'=arg2, arg4'=1+arg3, arg5'=arg5P_11, arg6'=arg6P_11, [ arg2>-1 && arg3>0 && 1==arg1 && arg2P_9>=1 ], cost: 1+arg2P_9
     28: f543_0_createTree_GT -> f998_0_createTree_LE : arg2'=0, arg3'=arg2, arg4'=arg4P_12, arg5'=arg5P_12, arg6'=arg6P_12, [ arg2>-1 && arg3>0 && arg1>0 && -1+arg4P_12-arg3<=0 && arg2P_9>=1 && arg4P_12>1 ], cost: 1+arg2P_9
      5: f3334_0_main_LE -> f3430_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg3, arg3'=arg3P_6, arg4'=arg4P_6, arg5'=arg5P_6, arg6'=arg6P_6, [ arg4>0 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg4P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg3P_6>-1 && arg4P_6>0 && 1+arg6P_6<=arg2 ], cost: 1
      6: f3334_0_main_LE -> f3430_0_main_InvokeMethod : arg1'=arg1P_7, arg2'=arg3, arg3'=arg3P_7, arg4'=arg4P_7, arg5'=arg5P_7, arg6'=arg6P_7, [ arg4>0 && arg1P_7<=arg1 && arg1P_7<=arg2 && arg4P_7<=arg2 && arg1>0 && arg2>0 && arg1P_7>0 && arg3P_7>1 && arg4P_7>0 && 1+arg6P_7<=arg2 ], cost: 1
     12: f3334_0_main_LE -> f2378_0_random_ArrayAccess : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, arg5'=arg5P_13, arg6'=arg6P_13, [ arg4>0 && arg1P_13<=arg2 && arg1>0 && arg2>0 && arg1P_13>0 && 1+arg2P_13<=arg2 ], cost: 1
     19: f3334_0_main_LE -> f3446_0_visit_NE : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg2P_20, arg4'=arg4P_20, arg5'=arg5P_20, arg6'=arg6P_20, [ arg4<1 && arg1P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && 2+arg4P_20<=arg2 && 2+arg2P_20<=arg2 ], cost: 1
      7: f3430_0_main_InvokeMethod -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg2, arg4'=arg2, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8<=arg1 && arg1P_8<=arg3 && arg1P_8<=arg4 && arg1>0 && arg3>0 && arg4>0 && arg1P_8>0 && arg2P_8>0 && 1+arg6<=arg4 ], cost: 1
     13: f3430_0_main_InvokeMethod -> f2378_0_random_ArrayAccess : arg1'=arg1P_14, arg2'=arg6, arg3'=arg3P_14, arg4'=arg4P_14, arg5'=arg5P_14, arg6'=arg6P_14, [ arg1P_14<=arg4 && arg1>0 && arg3>-1 && arg4>0 && arg1P_14>0 && 1+arg6<=arg4 ], cost: 1
      9: f998_0_createTree_LE -> f543_0_createTree_GT : arg1'=-1+arg1, arg2'=arg3, arg3'=arg4, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg1>0 && arg2>0 && arg4>1 ], cost: 1
     14: f2378_0_random_ArrayAccess -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1 && arg1>0 && arg2P_15>0 && 1+arg2<=arg1 ], cost: 1
     15: f3147_0_getRandom_LT -> f3577_0_getRandom_LT : arg2'=-1+arg4P_16, arg3'=arg3P_16, arg4'=arg4P_16, arg5'=1+arg4, arg6'=arg6P_16, [ arg4P_16>-1 && arg4>-1 && arg3>-1 && arg2>=2+arg3P_16 && arg2>2 && arg3P_16>0 ], cost: 1
     29: f3147_0_getRandom_LT -> f3577_0_getRandom_LT : arg2'=-2+arg4P_16, arg3'=arg3P_17, arg4'=-1+arg4P_16, arg5'=1+arg4, arg6'=arg6P_17, [ arg4P_16>-1 && arg4>-1 && arg3>-1 && arg3P_17>0 && 2+arg3P_17<=-2+arg2 && 3<=-2+arg2 ], cost: 2
     17: f3577_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_18, arg3'=arg1, arg4'=arg5, arg5'=arg5P_18, arg6'=arg6P_18, [ arg3>0 && arg4<0 && arg2P_18>-1 ], cost: 1
     18: f3577_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_19, arg3'=arg1, arg4'=arg5, arg5'=arg5P_19, arg6'=arg6P_19, [ arg3>1 && arg4>-1 && arg2P_19>-1 ], cost: 1
     20: f3446_0_visit_NE -> f3530_0_visit_NULL : arg1'=arg2, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, arg5'=arg5P_21, arg6'=arg6P_21, [ arg1>0 && arg2P_21>-1 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 ], cost: 1
     30: f3446_0_visit_NE -> f3530_0_visit_NULL : arg1'=arg2, arg2'=arg2P_23, arg3'=arg3P_21, arg4'=arg4P_23, arg5'=arg5P_23, arg6'=arg6P_23, [ arg1>0 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 && arg2P_23>-1 ], cost: 2
     21: f3530_0_visit_NULL -> f3446_0_visit_NE : arg1'=arg1P_22, arg2'=arg1, arg3'=arg3P_22, arg4'=arg4P_22, arg5'=arg5P_22, arg6'=arg6P_22, [ arg2>0 && arg1P_22>0 ], cost: 1
     23: __init -> f1_0_main_Load : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, arg5'=arg5P_24, arg6'=arg6P_24, [], cost: 1

Eliminated locations (on tree-shaped paths):
   Start location: __init
     35: f543_0_createTree_GT -> f543_0_createTree_GT : arg1'=-1+arg1, arg2'=arg2, arg3'=1+arg3, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>-1 && arg3>0 && arg1>0 && arg2P_9>0 ], cost: 2
     36: f543_0_createTree_GT -> f543_0_createTree_GT : arg1'=-1+arg1, arg2'=arg2, arg3'=arg4P_12, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>-1 && arg3>0 && arg1>0 && -1+arg2P_9>0 && arg4P_12>1 ], cost: 3
     37: f543_0_createTree_GT -> [16] : [ arg2>-1 && arg3>0 && 1==arg1 && arg2P_9>=1 ], cost: 1+arg2P_9
     38: f543_0_createTree_GT -> [16] : [ arg2>-1 && arg3>0 && arg1>0 && -1+arg4P_12-arg3<=0 && arg2P_9>=1 && arg4P_12>1 ], cost: 1+arg2P_9
     19: f3334_0_main_LE -> f3446_0_visit_NE : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg2P_20, arg4'=arg4P_20, arg5'=arg5P_20, arg6'=arg6P_20, [ arg4<1 && arg1P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && 2+arg4P_20<=arg2 && 2+arg2P_20<=arg2 ], cost: 1
     39: f3334_0_main_LE -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=arg3, arg5'=arg5P_8, arg6'=arg6P_8, [ arg4>0 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg4P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg4P_6>0 && 1+arg6P_6<=arg2 && arg1P_8<=arg1P_6 && arg1P_8<=arg3P_6 && arg1P_8<=arg4P_6 && arg3P_6>0 && arg1P_8>0 && arg2P_8>0 && 1+arg6P_6<=arg4P_6 ], cost: 2
     41: f3334_0_main_LE -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=arg3, arg5'=arg5P_8, arg6'=arg6P_8, [ arg4>0 && arg1P_7<=arg1 && arg1P_7<=arg2 && arg4P_7<=arg2 && arg1>0 && arg2>0 && arg1P_7>0 && arg3P_7>1 && arg4P_7>0 && 1+arg6P_7<=arg2 && arg1P_8<=arg1P_7 && arg1P_8<=arg3P_7 && arg1P_8<=arg4P_7 && arg1P_8>0 && arg2P_8>0 && 1+arg6P_7<=arg4P_7 ], cost: 2
     43: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ arg4>0 && arg1P_13<=arg2 && arg1>0 && arg2>0 && arg1P_13>0 && 1+arg2P_13<=arg2 && x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1P_13 && arg2P_15>0 && 1+arg2P_13<=arg1P_13 ], cost: 2
     44: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ arg4>0 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg4P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg3P_6>-1 && arg4P_6>0 && 1+arg6P_6<=arg2 && arg1P_14<=arg4P_6 && arg1P_14>0 && 1+arg6P_6<=arg4P_6 && x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1P_14 && arg2P_15>0 && 1+arg6P_6<=arg1P_14 ], cost: 3
     45: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ arg4>0 && arg1P_7<=arg1 && arg1P_7<=arg2 && arg4P_7<=arg2 && arg1>0 && arg2>0 && arg1P_7>0 && arg3P_7>1 && arg4P_7>0 && 1+arg6P_7<=arg2 && arg1P_14<=arg4P_7 && arg1P_14>0 && 1+arg6P_7<=arg4P_7 && x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1P_14 && arg2P_15>0 && 1+arg6P_7<=arg1P_14 ], cost: 3
     46: f3147_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_19, arg3'=arg1, arg4'=1+arg4, arg5'=arg5P_19, arg6'=arg6P_19, [ arg4P_16>-1 && arg4>-1 && arg3>-1 && arg2>=2+arg3P_16 && arg2>2 && arg3P_16>1 && arg2P_19>-1 ], cost: 2
     47: f3147_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_18, arg3'=arg1, arg4'=1+arg4, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4P_16>-1 && arg4>-1 && arg3>-1 && arg3P_17>0 && 2+arg3P_17<=-2+arg2 && 3<=-2+arg2 && -1+arg4P_16<0 && arg2P_18>-1 ], cost: 3
     48: f3147_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_19, arg3'=arg1, arg4'=1+arg4, arg5'=arg5P_19, arg6'=arg6P_19, [ arg4>-1 && arg3>-1 && 2+arg3P_17<=-2+arg2 && 3<=-2+arg2 && arg3P_17>1 && -1+arg4P_16>-1 && arg2P_19>-1 ], cost: 3
     49: f3446_0_visit_NE -> f3446_0_visit_NE : arg1'=arg1P_22, arg2'=arg2, arg3'=arg3P_22, arg4'=arg4P_22, arg5'=arg5P_22, arg6'=arg6P_22, [ arg1>0 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 && arg2P_21>0 && arg1P_22>0 ], cost: 2
     50: f3446_0_visit_NE -> f3446_0_visit_NE : arg1'=arg1P_22, arg2'=arg2, arg3'=arg3P_22, arg4'=arg4P_22, arg5'=arg5P_22, arg6'=arg6P_22, [ arg1>0 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 && arg2P_23>0 && arg1P_22>0 ], cost: 3
     32: __init -> f543_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_24, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2P_24>0 && arg1P_1>-1 && arg1P_24>0 ], cost: 2
     33: __init -> f3334_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg4P_4, arg4'=arg4P_4, arg5'=2, arg6'=arg6P_4, [ arg2P_24>0 && arg4P_4>-1 && arg1P_4<=arg1P_24 && 1+arg2P_4<=arg1P_24 && arg1P_24>0 && arg1P_4>0 && arg2P_4>-1 ], cost: 2
     34: __init -> f3334_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=1+arg3P_5, arg5'=1+x150_1, arg6'=arg6P_5, [ arg2P_24>0 && arg1P_24>0 && arg1P_2>1 && x150_1>0 && 1+arg3P_5>-1 && 1+arg1P_5<=arg1P_2 && arg2P_5<=arg1P_2 && arg1P_5>0 && arg2P_5>1 && 2+arg4P_2<=arg1P_2 ], cost: 3

Accelerating simple loops of location 1.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     35: f543_0_createTree_GT -> f543_0_createTree_GT : arg1'=-1+arg1, arg3'=1+arg3, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>-1 && arg3>0 && arg1>0 ], cost: 2
     36: f543_0_createTree_GT -> f543_0_createTree_GT : arg1'=-1+arg1, arg3'=arg4P_12, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>-1 && arg3>0 && arg1>0 && arg4P_12>1 ], cost: 3

   Accelerated rule 35 with backward acceleration, yielding the new rule 51.
   Accelerated rule 36 with backward acceleration, yielding the new rule 52.
[accelerate] Nesting with 2 inner and 2 outer candidates
   Removing the simple loops: 35 36.

Accelerating simple loops of location 4.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     39: f3334_0_main_LE -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=arg3, arg5'=arg5P_8, arg6'=arg6P_8, [ arg4>0 && arg1>0 && arg2>0 && arg1P_8>0 && arg2P_8>0 && arg1P_8<=arg1 && arg1P_8<=arg2 ], cost: 2
     41: f3334_0_main_LE -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=arg3, arg5'=arg5P_8, arg6'=arg6P_8, [ arg4>0 && arg1>0 && arg2>0 && arg1P_8>0 && arg2P_8>0 && arg1P_8<=arg2 && arg1P_8<=arg1 ], cost: 2

[test] deduced pseudo-invariant arg2-arg2P_8<=0, also trying -arg2+arg2P_8<=-1
[test] deduced invariant 1+arg3-arg4<=0
   Accelerated rule 39 with backward acceleration, yielding the new rule 53.
[test] deduced pseudo-invariant arg1P_8-arg2P_8<=0, also trying -arg1P_8+arg2P_8<=-1
[test] deduced invariant 1+arg3-arg4<=0
   Accelerated rule 41 with backward acceleration, yielding the new rule 54.
[accelerate] Nesting with 2 inner and 2 outer candidates

Accelerating simple loops of location 8.
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     46: f3147_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_19, arg3'=arg1, arg4'=1+arg4, arg5'=arg5P_19, arg6'=arg6P_19, [ arg4>-1 && arg3>-1 && arg2P_19>-1 && 2<=-2+arg2 ], cost: 2
     47: f3147_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_18, arg3'=arg1, arg4'=1+arg4, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4>-1 && arg3>-1 && 3<=-2+arg2 && arg2P_18>-1 ], cost: 3
     48: f3147_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_19, arg3'=arg1, arg4'=1+arg4, arg5'=arg5P_19, arg6'=arg6P_19, [ arg4>-1 && arg3>-1 && arg2P_19>-1 && 2<=-4+arg2 ], cost: 3

   Failed to prove monotonicity of the guard of rule 46.
[test] deduced invariant 1-arg3+arg1<=0
[test] deduced pseudo-invariant arg2-arg2P_18<=0, also trying -arg2+arg2P_18<=-1
   Accelerated rule 47 with backward acceleration, yielding the new rule 55.
[test] deduced invariant -1-arg3+arg1<=0
[test] deduced pseudo-invariant arg2-arg2P_19<=0, also trying -arg2+arg2P_19<=-1
   Failed to prove monotonicity of the guard of rule 48.
[accelerate] Nesting with 3 inner and 3 outer candidates

Accelerating simple loops of location 10.
[accelerate] Removed some duplicate simple loops
   Simplified some of the simple loops (and removed duplicate rules).
   Accelerating the following rules:
     50: f3446_0_visit_NE -> f3446_0_visit_NE : arg1'=arg1P_22, arg3'=arg3P_22, arg4'=arg4P_22, arg5'=arg5P_22, arg6'=arg6P_22, [ arg1>0 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 && arg1P_22>0 ], cost: 3

   Accelerated rule 50 with non-termination, yielding the new rule 56.
[accelerate] Nesting with 0 inner and 1 outer candidates

Accelerated all simple loops using metering functions (where possible):
   Start location: __init
     37: f543_0_createTree_GT -> [16] : [ arg2>-1 && arg3>0 && 1==arg1 && arg2P_9>=1 ], cost: 1+arg2P_9
     38: f543_0_createTree_GT -> [16] : [ arg2>-1 && arg3>0 && arg1>0 && -1+arg4P_12-arg3<=0 && arg2P_9>=1 && arg4P_12>1 ], cost: 1+arg2P_9
     51: f543_0_createTree_GT -> f543_0_createTree_GT : arg1'=0, arg3'=arg3+arg1, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>-1 && arg3>0 && arg1>=1 ], cost: 2*arg1
     52: f543_0_createTree_GT -> f543_0_createTree_GT : arg1'=0, arg3'=arg4P_12, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2>-1 && arg3>0 && arg4P_12>1 && arg1>=1 ], cost: 3*arg1
     19: f3334_0_main_LE -> f3446_0_visit_NE : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg2P_20, arg4'=arg4P_20, arg5'=arg5P_20, arg6'=arg6P_20, [ arg4<1 && arg1P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && 2+arg4P_20<=arg2 && 2+arg2P_20<=arg2 ], cost: 1
     39: f3334_0_main_LE -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=arg3, arg5'=arg5P_8, arg6'=arg6P_8, [ arg4>0 && arg1>0 && arg2>0 && arg1P_8>0 && arg2P_8>0 && arg1P_8<=arg1 && arg1P_8<=arg2 ], cost: 2
     41: f3334_0_main_LE -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3, arg4'=arg3, arg5'=arg5P_8, arg6'=arg6P_8, [ arg4>0 && arg1>0 && arg2>0 && arg1P_8>0 && arg2P_8>0 && arg1P_8<=arg2 && arg1P_8<=arg1 ], cost: 2
     43: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ arg4>0 && arg1P_13<=arg2 && arg1>0 && arg2>0 && arg1P_13>0 && 1+arg2P_13<=arg2 && x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1P_13 && arg2P_15>0 && 1+arg2P_13<=arg1P_13 ], cost: 2
     44: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ arg4>0 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg4P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg3P_6>-1 && arg4P_6>0 && 1+arg6P_6<=arg2 && arg1P_14<=arg4P_6 && arg1P_14>0 && 1+arg6P_6<=arg4P_6 && x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1P_14 && arg2P_15>0 && 1+arg6P_6<=arg1P_14 ], cost: 3
     45: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ arg4>0 && arg1P_7<=arg1 && arg1P_7<=arg2 && arg4P_7<=arg2 && arg1>0 && arg2>0 && arg1P_7>0 && arg3P_7>1 && arg4P_7>0 && 1+arg6P_7<=arg2 && arg1P_14<=arg4P_7 && arg1P_14>0 && 1+arg6P_7<=arg4P_7 && x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1P_14 && arg2P_15>0 && 1+arg6P_7<=arg1P_14 ], cost: 3
     53: f3334_0_main_LE -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1, arg4'=0, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1>0 && arg2>0 && arg1P_8>0 && arg2P_8>0 && arg1P_8<=arg1 && arg1P_8<=arg2 && arg2-arg2P_8<=0 && 1+arg3-arg4<=0 && 1+arg3>=1 ], cost: 2+2*arg3
     54: f3334_0_main_LE -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1, arg4'=0, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1>0 && arg2>0 && arg1P_8>0 && arg2P_8>0 && arg1P_8<=arg2 && arg1P_8<=arg1 && arg1P_8-arg2P_8<=0 && 1+arg3-arg4<=0 && 1+arg3>=1 ], cost: 2+2*arg3
     46: f3147_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_19, arg3'=arg1, arg4'=1+arg4, arg5'=arg5P_19, arg6'=arg6P_19, [ arg4>-1 && arg3>-1 && arg2P_19>-1 && 2<=-2+arg2 ], cost: 2
     47: f3147_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_18, arg3'=arg1, arg4'=1+arg4, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4>-1 && arg3>-1 && 3<=-2+arg2 && arg2P_18>-1 ], cost: 3
     48: f3147_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-1+arg1, arg2'=arg2P_19, arg3'=arg1, arg4'=1+arg4, arg5'=arg5P_19, arg6'=arg6P_19, [ arg4>-1 && arg3>-1 && arg2P_19>-1 && 2<=-4+arg2 ], cost: 3
     55: f3147_0_getRandom_LT -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg4+arg1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4>-1 && 3<=-2+arg2 && arg2P_18>-1 && 1-arg3+arg1<=0 && arg2-arg2P_18<=0 && 2+arg1>=1 ], cost: 6+3*arg1
     50: f3446_0_visit_NE -> f3446_0_visit_NE : arg1'=arg1P_22, arg3'=arg3P_22, arg4'=arg4P_22, arg5'=arg5P_22, arg6'=arg6P_22, [ arg1>0 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 && arg1P_22>0 ], cost: 3
     56: f3446_0_visit_NE -> [20] : [ arg1>0 && 2+arg4<=arg1 && 2+arg2<=arg1 && arg2==arg3 && arg1P_22>0 && 2+arg4P_22<=arg1P_22 && 2+arg2<=arg1P_22 && arg2==arg3P_22 ], cost: NONTERM
     32: __init -> f543_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_24, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2P_24>0 && arg1P_1>-1 && arg1P_24>0 ], cost: 2
     33: __init -> f3334_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg4P_4, arg4'=arg4P_4, arg5'=2, arg6'=arg6P_4, [ arg2P_24>0 && arg4P_4>-1 && arg1P_4<=arg1P_24 && 1+arg2P_4<=arg1P_24 && arg1P_24>0 && arg1P_4>0 && arg2P_4>-1 ], cost: 2
     34: __init -> f3334_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=1+arg3P_5, arg5'=1+x150_1, arg6'=arg6P_5, [ arg2P_24>0 && arg1P_24>0 && arg1P_2>1 && x150_1>0 && 1+arg3P_5>-1 && 1+arg1P_5<=arg1P_2 && arg2P_5<=arg1P_2 && arg1P_5>0 && arg2P_5>1 && 2+arg4P_2<=arg1P_2 ], cost: 3

Chained accelerated rules (with incoming rules):
   Start location: __init
     37: f543_0_createTree_GT -> [16] : [ arg2>-1 && arg3>0 && 1==arg1 && arg2P_9>=1 ], cost: 1+arg2P_9
     38: f543_0_createTree_GT -> [16] : [ arg2>-1 && arg3>0 && arg1>0 && -1+arg4P_12-arg3<=0 && arg2P_9>=1 && arg4P_12>1 ], cost: 1+arg2P_9
     19: f3334_0_main_LE -> f3446_0_visit_NE : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg2P_20, arg4'=arg4P_20, arg5'=arg5P_20, arg6'=arg6P_20, [ arg4<1 && arg1P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && 2+arg4P_20<=arg2 && 2+arg2P_20<=arg2 ], cost: 1
     43: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ arg4>0 && arg1P_13<=arg2 && arg1>0 && arg2>0 && arg1P_13>0 && 1+arg2P_13<=arg2 && x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1P_13 && arg2P_15>0 && 1+arg2P_13<=arg1P_13 ], cost: 2
     44: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ arg4>0 && arg1P_6<=arg1 && arg1P_6<=arg2 && arg4P_6<=arg2 && arg1>0 && arg2>0 && arg1P_6>0 && arg3P_6>-1 && arg4P_6>0 && 1+arg6P_6<=arg2 && arg1P_14<=arg4P_6 && arg1P_14>0 && 1+arg6P_6<=arg4P_6 && x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1P_14 && arg2P_15>0 && 1+arg6P_6<=arg1P_14 ], cost: 3
     45: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-1+arg3P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=1+x91_1, arg5'=arg5P_15, arg6'=arg6P_15, [ arg4>0 && arg1P_7<=arg1 && arg1P_7<=arg2 && arg4P_7<=arg2 && arg1>0 && arg2>0 && arg1P_7>0 && arg3P_7>1 && arg4P_7>0 && 1+arg6P_7<=arg2 && arg1P_14<=arg4P_7 && arg1P_14>0 && 1+arg6P_7<=arg4P_7 && x91_1>-1 && arg3P_15>-1 && arg2P_15<=arg1P_14 && arg2P_15>0 && 1+arg6P_7<=arg1P_14 ], cost: 3
     67: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2+arg3P_15, arg2'=arg2P_19, arg3'=-1+arg3P_15, arg4'=2+x91_1, arg5'=arg5P_19, arg6'=arg6P_19, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && arg2P_19>-1 && 4<=arg2 ], cost: 4
     68: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2+arg3P_15, arg2'=arg2P_19, arg3'=-1+arg3P_15, arg4'=2+x91_1, arg5'=arg5P_19, arg6'=arg6P_19, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && arg2P_19>-1 && 4<=arg2 ], cost: 5
     69: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2+arg3P_15, arg2'=arg2P_19, arg3'=-1+arg3P_15, arg4'=2+x91_1, arg5'=arg5P_19, arg6'=arg6P_19, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && arg2P_19>-1 && 4<=arg2 ], cost: 5
     70: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2+arg3P_15, arg2'=arg2P_18, arg3'=-1+arg3P_15, arg4'=2+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && arg2P_18>-1 && 5<=arg2 ], cost: 5
     71: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2+arg3P_15, arg2'=arg2P_18, arg3'=-1+arg3P_15, arg4'=2+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && arg2P_18>-1 && 5<=arg2 ], cost: 6
     72: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2+arg3P_15, arg2'=arg2P_18, arg3'=-1+arg3P_15, arg4'=2+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && arg2P_18>-1 && 5<=arg2 ], cost: 6
     73: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2+arg3P_15, arg2'=arg2P_19, arg3'=-1+arg3P_15, arg4'=2+x91_1, arg5'=arg5P_19, arg6'=arg6P_19, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && arg2P_19>-1 && 6<=arg2 ], cost: 5
     74: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2+arg3P_15, arg2'=arg2P_19, arg3'=-1+arg3P_15, arg4'=2+x91_1, arg5'=arg5P_19, arg6'=arg6P_19, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && arg2P_19>-1 && 6<=arg2 ], cost: 6
     75: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2+arg3P_15, arg2'=arg2P_19, arg3'=-1+arg3P_15, arg4'=2+x91_1, arg5'=arg5P_19, arg6'=arg6P_19, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && arg2P_19>-1 && 6<=arg2 ], cost: 6
     76: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2 ], cost: 5+3*arg3P_15
     77: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2 ], cost: 6+3*arg3P_15
     78: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2 ], cost: 6+3*arg3P_15
     79: f3334_0_main_LE -> f3446_0_visit_NE : arg1'=arg1P_22, arg2'=arg2P_20, arg3'=arg3P_22, arg4'=arg4P_22, arg5'=arg5P_22, arg6'=arg6P_22, [ arg4<1 && arg1>0 && arg2>0 && 2+arg2P_20<=arg2 && arg1P_22>0 ], cost: 4
     80: f3334_0_main_LE -> [20] : [ arg4<1 && arg1>0 && arg2>0 && 2+arg2P_20<=arg2 ], cost: NONTERM
     32: __init -> f543_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_24, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2P_24>0 && arg1P_1>-1 && arg1P_24>0 ], cost: 2
     33: __init -> f3334_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg4P_4, arg4'=arg4P_4, arg5'=2, arg6'=arg6P_4, [ arg2P_24>0 && arg4P_4>-1 && arg1P_4<=arg1P_24 && 1+arg2P_4<=arg1P_24 && arg1P_24>0 && arg1P_4>0 && arg2P_4>-1 ], cost: 2
     34: __init -> f3334_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=1+arg3P_5, arg5'=1+x150_1, arg6'=arg6P_5, [ arg2P_24>0 && arg1P_24>0 && arg1P_2>1 && x150_1>0 && 1+arg3P_5>-1 && 1+arg1P_5<=arg1P_2 && arg2P_5<=arg1P_2 && arg1P_5>0 && arg2P_5>1 && 2+arg4P_2<=arg1P_2 ], cost: 3
     57: __init -> f543_0_createTree_GT : arg1'=0, arg2'=arg2P_24, arg3'=1+arg1P_1, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2P_24>0 && arg1P_1>=1 ], cost: 2+2*arg1P_1
     58: __init -> f543_0_createTree_GT : arg1'=0, arg2'=arg2P_24, arg3'=arg4P_12, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2P_24>0 && arg4P_12>1 && arg1P_1>=1 ], cost: 2+3*arg1P_1
     59: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2+arg4P_4, arg4'=-1+arg4P_4, arg5'=arg5P_8, arg6'=arg6P_8, [ arg4P_4>0 && arg1P_8>0 && arg2P_8>0 ], cost: 4
     60: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5, arg4'=arg3P_5, arg5'=arg5P_8, arg6'=arg6P_8, [ 1+arg3P_5>0 && arg1P_8>0 && arg2P_8>0 ], cost: 5
     61: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2+arg4P_4, arg4'=-1+arg4P_4, arg5'=arg5P_8, arg6'=arg6P_8, [ arg4P_4>0 && arg1P_8>0 && arg2P_8>0 ], cost: 4
     62: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5, arg4'=arg3P_5, arg5'=arg5P_8, arg6'=arg6P_8, [ 1+arg3P_5>0 && arg1P_8>0 && arg2P_8>0 ], cost: 5
     63: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1, arg4'=0, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8>0 && arg2P_8>0 && arg4P_4>=1 && arg1P_8<=arg2P_8 ], cost: 2+2*arg4P_4
     64: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1, arg4'=0, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8>0 && 1+arg3P_5>=1 && 2<=arg2P_8 && arg1P_8<=arg2P_8 ], cost: 5+2*arg3P_5
     65: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1, arg4'=0, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8>0 && arg2P_8>0 && arg1P_8-arg2P_8<=0 && arg4P_4>=1 ], cost: 2+2*arg4P_4
     66: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1, arg4'=0, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8>0 && arg2P_8>0 && arg1P_8-arg2P_8<=0 && 1+arg3P_5>=1 ], cost: 5+2*arg3P_5

Removed unreachable locations (and leaf rules with constant cost):
   Start location: __init
     37: f543_0_createTree_GT -> [16] : [ arg2>-1 && arg3>0 && 1==arg1 && arg2P_9>=1 ], cost: 1+arg2P_9
     38: f543_0_createTree_GT -> [16] : [ arg2>-1 && arg3>0 && arg1>0 && -1+arg4P_12-arg3<=0 && arg2P_9>=1 && arg4P_12>1 ], cost: 1+arg2P_9
     76: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2 ], cost: 5+3*arg3P_15
     77: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2 ], cost: 6+3*arg3P_15
     78: f3334_0_main_LE -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg4>0 && arg1>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2 ], cost: 6+3*arg3P_15
     80: f3334_0_main_LE -> [20] : [ arg4<1 && arg1>0 && arg2>0 && 2+arg2P_20<=arg2 ], cost: NONTERM
     32: __init -> f543_0_createTree_GT : arg1'=arg1P_1, arg2'=arg2P_24, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2P_24>0 && arg1P_1>-1 && arg1P_24>0 ], cost: 2
     33: __init -> f3334_0_main_LE : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=-1+arg4P_4, arg4'=arg4P_4, arg5'=2, arg6'=arg6P_4, [ arg2P_24>0 && arg4P_4>-1 && arg1P_4<=arg1P_24 && 1+arg2P_4<=arg1P_24 && arg1P_24>0 && arg1P_4>0 && arg2P_4>-1 ], cost: 2
     34: __init -> f3334_0_main_LE : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=1+arg3P_5, arg5'=1+x150_1, arg6'=arg6P_5, [ arg2P_24>0 && arg1P_24>0 && arg1P_2>1 && x150_1>0 && 1+arg3P_5>-1 && 1+arg1P_5<=arg1P_2 && arg2P_5<=arg1P_2 && arg1P_5>0 && arg2P_5>1 && 2+arg4P_2<=arg1P_2 ], cost: 3
     57: __init -> f543_0_createTree_GT : arg1'=0, arg2'=arg2P_24, arg3'=1+arg1P_1, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2P_24>0 && arg1P_1>=1 ], cost: 2+2*arg1P_1
     58: __init -> f543_0_createTree_GT : arg1'=0, arg2'=arg2P_24, arg3'=arg4P_12, arg4'=arg4P_10, arg5'=arg5P_10, arg6'=arg6P_10, [ arg2P_24>0 && arg4P_12>1 && arg1P_1>=1 ], cost: 2+3*arg1P_1
     59: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2+arg4P_4, arg4'=-1+arg4P_4, arg5'=arg5P_8, arg6'=arg6P_8, [ arg4P_4>0 && arg1P_8>0 && arg2P_8>0 ], cost: 4
     60: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5, arg4'=arg3P_5, arg5'=arg5P_8, arg6'=arg6P_8, [ 1+arg3P_5>0 && arg1P_8>0 && arg2P_8>0 ], cost: 5
     61: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-2+arg4P_4, arg4'=-1+arg4P_4, arg5'=arg5P_8, arg6'=arg6P_8, [ arg4P_4>0 && arg1P_8>0 && arg2P_8>0 ], cost: 4
     62: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1+arg3P_5, arg4'=arg3P_5, arg5'=arg5P_8, arg6'=arg6P_8, [ 1+arg3P_5>0 && arg1P_8>0 && arg2P_8>0 ], cost: 5
     63: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1, arg4'=0, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8>0 && arg2P_8>0 && arg4P_4>=1 && arg1P_8<=arg2P_8 ], cost: 2+2*arg4P_4
     64: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1, arg4'=0, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8>0 && 1+arg3P_5>=1 && 2<=arg2P_8 && arg1P_8<=arg2P_8 ], cost: 5+2*arg3P_5
     65: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1, arg4'=0, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8>0 && arg2P_8>0 && arg1P_8-arg2P_8<=0 && arg4P_4>=1 ], cost: 2+2*arg4P_4
     66: __init -> f3334_0_main_LE : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=-1, arg4'=0, arg5'=arg5P_8, arg6'=arg6P_8, [ arg1P_8>0 && arg2P_8>0 && arg1P_8-arg2P_8<=0 && 1+arg3P_5>=1 ], cost: 5+2*arg3P_5

Eliminated locations (on tree-shaped paths):
   Start location: __init
     81: __init -> [16] : arg1'=arg1P_1, arg2'=arg2P_24, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2P_24>0 && arg1P_24>0 && 1==arg1P_1 && arg2P_9>=1 ], cost: 3+arg2P_9
     82: __init -> [16] : arg1'=arg1P_1, arg2'=arg2P_24, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2P_24>0 && arg1P_24>0 && arg1P_1>0 && -2+arg4P_12<=0 && arg2P_9>=1 && arg4P_12>1 ], cost: 3+arg2P_9
     83: __init -> [21] : [ arg2P_24>0 && arg1P_1>=1 ], cost: 2+2*arg1P_1
     84: __init -> [21] : [ arg2P_24>0 && arg4P_12>1 && arg1P_1>=1 ], cost: 2+3*arg1P_1
     85: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg2P_24>0 && arg1P_4<=arg1P_24 && 1+arg2P_4<=arg1P_24 && arg1P_24>0 && arg1P_4>0 && arg4P_4>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_4 ], cost: 7+3*arg3P_15
     86: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg2P_24>0 && arg1P_4<=arg1P_24 && 1+arg2P_4<=arg1P_24 && arg1P_24>0 && arg1P_4>0 && arg4P_4>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_4 ], cost: 8+3*arg3P_15
     87: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg2P_24>0 && arg1P_4<=arg1P_24 && 1+arg2P_4<=arg1P_24 && arg1P_24>0 && arg1P_4>0 && arg4P_4>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_4 ], cost: 8+3*arg3P_15
     88: __init -> [20] : [ arg2P_24>0 && arg4P_4>-1 && arg1P_4<=arg1P_24 && 1+arg2P_4<=arg1P_24 && arg1P_24>0 && arg1P_4>0 && arg4P_4<1 && arg2P_4>0 && 2+arg2P_20<=arg2P_4 ], cost: NONTERM
     89: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg2P_24>0 && arg1P_24>0 && arg1P_2>1 && x150_1>0 && 1+arg1P_5<=arg1P_2 && arg2P_5<=arg1P_2 && arg1P_5>0 && 2+arg4P_2<=arg1P_2 && 1+arg3P_5>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_5 ], cost: 8+3*arg3P_15
     90: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg2P_24>0 && arg1P_24>0 && arg1P_2>1 && x150_1>0 && 1+arg1P_5<=arg1P_2 && arg2P_5<=arg1P_2 && arg1P_5>0 && 2+arg4P_2<=arg1P_2 && 1+arg3P_5>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_5 ], cost: 9+3*arg3P_15
     91: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg2P_24>0 && arg1P_24>0 && arg1P_2>1 && x150_1>0 && 1+arg1P_5<=arg1P_2 && arg2P_5<=arg1P_2 && arg1P_5>0 && 2+arg4P_2<=arg1P_2 && 1+arg3P_5>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_5 ], cost: 9+3*arg3P_15
     92: __init -> [20] : [ arg2P_24>0 && arg1P_24>0 && arg1P_2>1 && x150_1>0 && 1+arg3P_5>-1 && 1+arg1P_5<=arg1P_2 && arg2P_5<=arg1P_2 && arg1P_5>0 && arg2P_5>1 && 2+arg4P_2<=arg1P_2 && 1+arg3P_5<1 && 2+arg2P_20<=arg2P_5 ], cost: NONTERM
     93: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && -1+arg4P_4>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 9+3*arg3P_15
     94: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && -1+arg4P_4>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 10+3*arg3P_15
     95: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && -1+arg4P_4>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 10+3*arg3P_15
     96: __init -> [20] : [ arg4P_4>0 && arg1P_8>0 && arg2P_8>0 && -1+arg4P_4<1 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
     97: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && arg3P_5>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 10+3*arg3P_15
     98: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && arg3P_5>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 11+3*arg3P_15
     99: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && arg3P_5>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 11+3*arg3P_15
    100: __init -> [20] : [ 1+arg3P_5>0 && arg1P_8>0 && arg2P_8>0 && arg3P_5<1 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    101: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && -1+arg4P_4>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 9+3*arg3P_15
    102: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && -1+arg4P_4>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 10+3*arg3P_15
    103: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && -1+arg4P_4>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 10+3*arg3P_15
    104: __init -> [20] : [ arg4P_4>0 && arg1P_8>0 && arg2P_8>0 && -1+arg4P_4<1 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    105: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && arg3P_5>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 10+3*arg3P_15
    106: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && arg3P_5>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 11+3*arg3P_15
    107: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && arg3P_5>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 11+3*arg3P_15
    108: __init -> [20] : [ 1+arg3P_5>0 && arg1P_8>0 && arg2P_8>0 && arg3P_5<1 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    109: __init -> [20] : [ arg1P_8>0 && arg2P_8>0 && arg4P_4>=1 && arg1P_8<=arg2P_8 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    110: __init -> [20] : [ arg1P_8>0 && 1+arg3P_5>=1 && 2<=arg2P_8 && arg1P_8<=arg2P_8 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    111: __init -> [20] : [ arg1P_8>0 && arg2P_8>0 && arg1P_8-arg2P_8<=0 && arg4P_4>=1 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    112: __init -> [20] : [ arg1P_8>0 && arg2P_8>0 && arg1P_8-arg2P_8<=0 && 1+arg3P_5>=1 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    113: __init -> [22] : [ arg1P_8>0 && arg2P_8>0 && arg4P_4>=1 && arg1P_8<=arg2P_8 ], cost: 2+2*arg4P_4
    114: __init -> [22] : [ arg1P_8>0 && 1+arg3P_5>=1 && 2<=arg2P_8 && arg1P_8<=arg2P_8 ], cost: 5+2*arg3P_5
    115: __init -> [22] : [ arg1P_8>0 && arg2P_8>0 && arg1P_8-arg2P_8<=0 && arg4P_4>=1 ], cost: 2+2*arg4P_4
    116: __init -> [22] : [ arg1P_8>0 && arg2P_8>0 && arg1P_8-arg2P_8<=0 && 1+arg3P_5>=1 ], cost: 5+2*arg3P_5

### Computing asymptotic complexity ###

Fully simplified ITS problem
   Start location: __init
     81: __init -> [16] : arg1'=arg1P_1, arg2'=arg2P_24, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2P_24>0 && arg1P_24>0 && 1==arg1P_1 && arg2P_9>=1 ], cost: 3+arg2P_9
     82: __init -> [16] : arg1'=arg1P_1, arg2'=arg2P_24, arg3'=1, arg4'=arg4P_1, arg5'=arg5P_1, arg6'=arg6P_1, [ arg2P_24>0 && arg1P_24>0 && arg1P_1>0 && -2+arg4P_12<=0 && arg2P_9>=1 && arg4P_12>1 ], cost: 3+arg2P_9
     83: __init -> [21] : [ arg2P_24>0 && arg1P_1>=1 ], cost: 2+2*arg1P_1
     84: __init -> [21] : [ arg2P_24>0 && arg4P_12>1 && arg1P_1>=1 ], cost: 2+3*arg1P_1
     87: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg2P_24>0 && arg1P_4<=arg1P_24 && 1+arg2P_4<=arg1P_24 && arg1P_24>0 && arg1P_4>0 && arg4P_4>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_4 ], cost: 8+3*arg3P_15
     88: __init -> [20] : [ arg2P_24>0 && arg4P_4>-1 && arg1P_4<=arg1P_24 && 1+arg2P_4<=arg1P_24 && arg1P_24>0 && arg1P_4>0 && arg4P_4<1 && arg2P_4>0 && 2+arg2P_20<=arg2P_4 ], cost: NONTERM
     91: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg2P_24>0 && arg1P_24>0 && arg1P_2>1 && x150_1>0 && 1+arg1P_5<=arg1P_2 && arg2P_5<=arg1P_2 && arg1P_5>0 && 2+arg4P_2<=arg1P_2 && 1+arg3P_5>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_5 ], cost: 9+3*arg3P_15
     92: __init -> [20] : [ arg2P_24>0 && arg1P_24>0 && arg1P_2>1 && x150_1>0 && 1+arg3P_5>-1 && 1+arg1P_5<=arg1P_2 && arg2P_5<=arg1P_2 && arg1P_5>0 && arg2P_5>1 && 2+arg4P_2<=arg1P_2 && 1+arg3P_5<1 && 2+arg2P_20<=arg2P_5 ], cost: NONTERM
    103: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && -1+arg4P_4>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 10+3*arg3P_15
    104: __init -> [20] : [ arg4P_4>0 && arg1P_8>0 && arg2P_8>0 && -1+arg4P_4<1 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    107: __init -> f3147_0_getRandom_LT : arg1'=-2, arg2'=arg2P_18, arg3'=-1, arg4'=2+arg3P_15+x91_1, arg5'=arg5P_18, arg6'=arg6P_18, [ arg1P_8>0 && arg3P_5>0 && x91_1>-1 && arg3P_15>-1 && 5<=arg2P_18 && 5<=arg2P_8 ], cost: 11+3*arg3P_15
    108: __init -> [20] : [ 1+arg3P_5>0 && arg1P_8>0 && arg2P_8>0 && arg3P_5<1 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    109: __init -> [20] : [ arg1P_8>0 && arg2P_8>0 && arg4P_4>=1 && arg1P_8<=arg2P_8 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    110: __init -> [20] : [ arg1P_8>0 && 1+arg3P_5>=1 && 2<=arg2P_8 && arg1P_8<=arg2P_8 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    111: __init -> [20] : [ arg1P_8>0 && arg2P_8>0 && arg1P_8-arg2P_8<=0 && arg4P_4>=1 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    112: __init -> [20] : [ arg1P_8>0 && arg2P_8>0 && arg1P_8-arg2P_8<=0 && 1+arg3P_5>=1 && 2+arg2P_20<=arg2P_8 ], cost: NONTERM
    113: __init -> [22] : [ arg1P_8>0 && arg2P_8>0 && arg4P_4>=1 && arg1P_8<=arg2P_8 ], cost: 2+2*arg4P_4
    114: __init -> [22] : [ arg1P_8>0 && 1+arg3P_5>=1 && 2<=arg2P_8 && arg1P_8<=arg2P_8 ], cost: 5+2*arg3P_5
    115: __init -> [22] : [ arg1P_8>0 && arg2P_8>0 && arg1P_8-arg2P_8<=0 && arg4P_4>=1 ], cost: 2+2*arg4P_4
    116: __init -> [22] : [ arg1P_8>0 && arg2P_8>0 && arg1P_8-arg2P_8<=0 && 1+arg3P_5>=1 ], cost: 5+2*arg3P_5

Computing asymptotic complexity for rule 104
   Guard is satisfiable, yielding nontermination
   Resulting cost NONTERM has complexity: Nonterm

Found new complexity Nonterm.

Obtained the following overall complexity (w.r.t. the length of the input n):
   Complexity:  Nonterm
   Cpx degree:  Nonterm
   Solved cost: NONTERM
   Rule cost:   NONTERM
   Rule guard:  [ arg4P_4>0 && arg1P_8>0 && arg2P_8>0 && -1+arg4P_4<1 && 2+arg2P_20<=arg2P_8 ]

NO