NO ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: __init 0: f193_0_createTree_Return -> f295_0_main_InvokeMethod : arg1'=arg1P_1, arg2'=arg2P_1, arg3'=arg3P_1, arg4'=arg4P_1, [ arg1P_1<=arg1 && arg1>0 && arg1P_1>0 && arg2==arg2P_1 ], cost: 1 4: f295_0_main_InvokeMethod -> f2302_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 ], cost: 1 7: f295_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ x35_1>-1 && arg2>0 && arg1>0 ], cost: 1 16: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ x92_1>0 && arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1 1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1 2: f1_0_main_Load -> f2292_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1 6: f1_0_main_Load -> f548_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1 8: f2292_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && x38_1>-1 && arg2>0 && 2+arg4<=arg2 ], cost: 1 18: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && x108_1>0 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1 19: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1 3: f508_0_createTree_Return -> f2292_0_main_InvokeMethod : arg1'=arg1P_4, arg2'=arg2P_4, arg3'=arg3P_4, arg4'=arg4P_4, [ arg1P_4<=arg1 && 1+arg1P_4<=arg2 && arg2P_4<=arg2 && arg1>0 && arg2>1 && arg1P_4>0 && arg2P_4>1 && 2+arg4<=arg2 && arg3==arg3P_4 && arg4==arg4P_4 ], cost: 1 17: f2302_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ 1+arg1P_18<=arg1 && 1+arg1P_18<=arg2 && arg2P_18<=arg2 && 1+arg3P_18<=arg1 && 1+arg3P_18<=arg2 && arg1>0 && arg2>0 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3<=arg2 ], cost: 1 5: f509_0_createTree_Return -> f2302_0_main_InvokeMethod : arg1'=arg1P_6, arg2'=arg2P_6, arg3'=arg3P_6, arg4'=arg4P_6, [ arg1P_6<=arg1 && 1+arg1P_6<=arg2 && arg2P_6<=arg2 && arg1>0 && arg2>1 && arg1P_6>0 && arg2P_6>1 && 2+arg3<=arg2 && arg3==arg3P_6 ], cost: 1 9: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg3P_10>0 && x43_1>-1 && arg2P_10>1 && arg1P_10>1 && 1+x43_1==arg4P_10 ], cost: 1 10: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg4>-1 && arg3>0 && arg1P_11<=arg1 && 2+arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>0 && arg2P_11>0 && -1+arg3==arg3P_11 && 1+arg4==arg4P_11 ], cost: 1 11: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg3>0 && x59_1>0 && arg4>-1 && arg1P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>0 && arg2>2 && arg1P_12>0 && arg2P_12>0 && -1+arg3==arg3P_12 && 1+arg4==arg4P_12 ], cost: 1 12: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg3>0 && x66_1>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_13>0 && arg2P_13>0 && -1+arg3==arg3P_13 && 1+arg4==arg4P_13 ], cost: 1 13: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_14>0 && arg2P_14>0 && -1+arg3==arg3P_14 && 1+arg4==arg4P_14 ], cost: 1 14: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 && -1+arg3==arg3P_15 && 1+arg4==arg4P_15 ], cost: 1 15: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ arg3>0 && x85_1>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 && -1+arg3==arg3P_16 && 1+arg4==arg4P_16 ], cost: 1 20: f1394_0_less_leaves_NULL -> f1268_0_append_NONNULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ 1+arg1P_21<=arg1 && 1+arg1P_21<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_21>-1 ], cost: 1 21: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ 1+arg2P_22<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>-1 && arg2P_22>-1 ], cost: 1 22: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ 1+arg2P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>-1 ], cost: 1 26: f1268_0_append_NONNULL -> f1410_0_append_NULL : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, arg4'=arg4P_27, [ arg1P_27<=arg1 && 1+arg2P_27<=arg1 && arg1>0 && arg1P_27>0 && arg2P_27>-1 && 2+arg3P_27<=arg1 ], cost: 1 23: f1554_0_less_leaves_InvokeMethod -> f1268_0_append_NONNULL : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1P_24<=arg2 && arg1>-1 && arg2>-1 && arg1P_24>-1 ], cost: 1 24: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ arg1P_25<=arg1 && arg3P_25<=arg1 && arg1>-1 && arg2>-1 && arg1P_25>-1 && arg2P_25>-1 && arg3P_25>-1 ], cost: 1 25: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_26<=arg1 && arg3P_26<=arg1 && arg1>-1 && arg2>-1 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 1 27: f1410_0_append_NULL -> f1410_0_append_NULL : arg1'=arg1P_28, arg2'=arg2P_28, arg3'=arg3P_28, arg4'=arg4P_28, [ 2+arg1P_28<=arg1 && arg1P_28<=arg2 && 3+arg2P_28<=arg1 && 1+arg2P_28<=arg2 && arg1>2 && arg2>0 && arg1P_28>0 && arg2P_28>-1 && 4+arg3P_28<=arg1 && 2+arg3<=arg1 && 2+arg3P_28<=arg2 ], cost: 1 28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, arg4'=arg4P_29, [], cost: 1 Checking for constant complexity: The following rule is satisfiable with cost >= 1, yielding constant complexity: 28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, arg4'=arg4P_29, [], cost: 1 Removed unreachable and leaf rules: Start location: __init 4: f295_0_main_InvokeMethod -> f2302_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 ], cost: 1 7: f295_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ x35_1>-1 && arg2>0 && arg1>0 ], cost: 1 16: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ x92_1>0 && arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1 1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1 2: f1_0_main_Load -> f2292_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1 6: f1_0_main_Load -> f548_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1 8: f2292_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && x38_1>-1 && arg2>0 && 2+arg4<=arg2 ], cost: 1 18: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && x108_1>0 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1 19: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1 17: f2302_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ 1+arg1P_18<=arg1 && 1+arg1P_18<=arg2 && arg2P_18<=arg2 && 1+arg3P_18<=arg1 && 1+arg3P_18<=arg2 && arg1>0 && arg2>0 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3<=arg2 ], cost: 1 9: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=arg4P_10, [ arg3P_10>0 && x43_1>-1 && arg2P_10>1 && arg1P_10>1 && 1+x43_1==arg4P_10 ], cost: 1 10: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=arg3P_11, arg4'=arg4P_11, [ arg4>-1 && arg3>0 && arg1P_11<=arg1 && 2+arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>0 && arg2P_11>0 && -1+arg3==arg3P_11 && 1+arg4==arg4P_11 ], cost: 1 11: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=arg3P_12, arg4'=arg4P_12, [ arg3>0 && x59_1>0 && arg4>-1 && arg1P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>0 && arg2>2 && arg1P_12>0 && arg2P_12>0 && -1+arg3==arg3P_12 && 1+arg4==arg4P_12 ], cost: 1 12: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=arg3P_13, arg4'=arg4P_13, [ arg3>0 && x66_1>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_13>0 && arg2P_13>0 && -1+arg3==arg3P_13 && 1+arg4==arg4P_13 ], cost: 1 13: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=arg3P_14, arg4'=arg4P_14, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_14>0 && arg2P_14>0 && -1+arg3==arg3P_14 && 1+arg4==arg4P_14 ], cost: 1 14: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_15, arg4'=arg4P_15, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 && -1+arg3==arg3P_15 && 1+arg4==arg4P_15 ], cost: 1 15: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_16, arg4'=arg4P_16, [ arg3>0 && x85_1>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 && -1+arg3==arg3P_16 && 1+arg4==arg4P_16 ], cost: 1 20: f1394_0_less_leaves_NULL -> f1268_0_append_NONNULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ 1+arg1P_21<=arg1 && 1+arg1P_21<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_21>-1 ], cost: 1 21: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ 1+arg2P_22<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>-1 && arg2P_22>-1 ], cost: 1 22: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ 1+arg2P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>-1 ], cost: 1 26: f1268_0_append_NONNULL -> f1410_0_append_NULL : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, arg4'=arg4P_27, [ arg1P_27<=arg1 && 1+arg2P_27<=arg1 && arg1>0 && arg1P_27>0 && arg2P_27>-1 && 2+arg3P_27<=arg1 ], cost: 1 23: f1554_0_less_leaves_InvokeMethod -> f1268_0_append_NONNULL : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1P_24<=arg2 && arg1>-1 && arg2>-1 && arg1P_24>-1 ], cost: 1 24: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ arg1P_25<=arg1 && arg3P_25<=arg1 && arg1>-1 && arg2>-1 && arg1P_25>-1 && arg2P_25>-1 && arg3P_25>-1 ], cost: 1 25: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_26<=arg1 && arg3P_26<=arg1 && arg1>-1 && arg2>-1 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 1 27: f1410_0_append_NULL -> f1410_0_append_NULL : arg1'=arg1P_28, arg2'=arg2P_28, arg3'=arg3P_28, arg4'=arg4P_28, [ 2+arg1P_28<=arg1 && arg1P_28<=arg2 && 3+arg2P_28<=arg1 && 1+arg2P_28<=arg2 && arg1>2 && arg2>0 && arg1P_28>0 && arg2P_28>-1 && 4+arg3P_28<=arg1 && 2+arg3<=arg1 && 2+arg3P_28<=arg2 ], cost: 1 28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, arg4'=arg4P_29, [], cost: 1 Simplified all rules, resulting in: Start location: __init 4: f295_0_main_InvokeMethod -> f2302_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 ], cost: 1 7: f295_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1 16: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1 1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1 2: f1_0_main_Load -> f2292_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1 6: f1_0_main_Load -> f548_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1 8: f2292_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1 18: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1 19: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1 17: f2302_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ 1+arg1P_18<=arg1 && 1+arg1P_18<=arg2 && arg2P_18<=arg2 && 1+arg3P_18<=arg1 && 1+arg3P_18<=arg2 && arg1>0 && arg2>0 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3<=arg2 ], cost: 1 9: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=1+x43_1, [ arg3P_10>0 && x43_1>-1 && arg2P_10>1 && arg1P_10>1 ], cost: 1 10: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1P_11<=arg1 && 2+arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>0 && arg2P_11>0 ], cost: 1 11: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>0 && arg2>2 && arg1P_12>0 && arg2P_12>0 ], cost: 1 12: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_13>0 && arg2P_13>0 ], cost: 1 13: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_14>0 && arg2P_14>0 ], cost: 1 14: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 ], cost: 1 15: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 ], cost: 1 20: f1394_0_less_leaves_NULL -> f1268_0_append_NONNULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ 1+arg1P_21<=arg1 && 1+arg1P_21<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_21>-1 ], cost: 1 21: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ 1+arg2P_22<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>-1 && arg2P_22>-1 ], cost: 1 22: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ 1+arg2P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>-1 ], cost: 1 26: f1268_0_append_NONNULL -> f1410_0_append_NULL : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, arg4'=arg4P_27, [ arg1P_27<=arg1 && 1+arg2P_27<=arg1 && arg1>0 && arg1P_27>0 && arg2P_27>-1 && 2+arg3P_27<=arg1 ], cost: 1 23: f1554_0_less_leaves_InvokeMethod -> f1268_0_append_NONNULL : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1P_24<=arg2 && arg1>-1 && arg2>-1 && arg1P_24>-1 ], cost: 1 24: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ arg1P_25<=arg1 && arg3P_25<=arg1 && arg1>-1 && arg2>-1 && arg1P_25>-1 && arg2P_25>-1 && arg3P_25>-1 ], cost: 1 25: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_26<=arg1 && arg3P_26<=arg1 && arg1>-1 && arg2>-1 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 1 27: f1410_0_append_NULL -> f1410_0_append_NULL : arg1'=arg1P_28, arg2'=arg2P_28, arg3'=arg3P_28, arg4'=arg4P_28, [ 2+arg1P_28<=arg1 && arg1P_28<=arg2 && 3+arg2P_28<=arg1 && 1+arg2P_28<=arg2 && arg1>2 && arg2>0 && arg1P_28>0 && arg2P_28>-1 && 4+arg3P_28<=arg1 && 2+arg3<=arg1 && 2+arg3P_28<=arg2 ], cost: 1 28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, arg4'=arg4P_29, [], cost: 1 ### Simplification by acceleration and chaining ### Accelerating simple loops of location 8. Accelerating the following rules: 10: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1P_11<=arg1 && 2+arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>0 && arg2P_11>0 ], cost: 1 11: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>0 && arg2>2 && arg1P_12>0 && arg2P_12>0 ], cost: 1 12: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1>0 && arg2>1 && arg1P_13>0 && arg2P_13>0 ], cost: 1 13: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1>0 && arg2>1 && arg1P_14>0 && arg2P_14>0 ], cost: 1 14: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 ], cost: 1 15: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 ], cost: 1 Failed to prove monotonicity of the guard of rule 10. Failed to prove monotonicity of the guard of rule 11. [test] deduced pseudo-invariant -arg2+arg2P_13<=0, also trying arg2-arg2P_13<=-1 Accelerated rule 12 with backward acceleration, yielding the new rule 29. [test] deduced pseudo-invariant -arg2+arg2P_14<=0, also trying arg2-arg2P_14<=-1 Accelerated rule 13 with backward acceleration, yielding the new rule 30. Failed to prove monotonicity of the guard of rule 14. Failed to prove monotonicity of the guard of rule 15. [accelerate] Nesting with 6 inner and 6 outer candidates Nested simple loops 12 (outer loop) and 14 (inner loop) with Rule(8 | arg4>-1, arg1>0, arg2>1, arg1P_15>3, arg2P_15>3, k_7>=1, 1-2*k_7+arg3>0, | 2*k_7 || 8 | 0=arg1P_15, 1=arg2P_15, 2=-2*k_7+arg3, 3=2*k_7+arg4, ), resulting in the new rules: 31, 32. Nested simple loops 13 (outer loop) and 14 (inner loop) with Rule(8 | arg4>-1, arg1>0, arg2>1, arg1P_15>3, arg2P_15>3, k_8>=1, 1+arg3-2*k_8>0, | 2*k_8 || 8 | 0=arg1P_15, 1=arg2P_15, 2=arg3-2*k_8, 3=2*k_8+arg4, ), resulting in the new rules: 33, 34. Nested simple loops 12 (outer loop) and 15 (inner loop) with Rule(8 | arg4>-1, arg1>0, arg2>1, arg1P_16>3, arg2P_16>3, k_9>=1, 1-2*k_9+arg3>0, | 2*k_9 || 8 | 0=arg1P_16, 1=arg2P_16, 2=-2*k_9+arg3, 3=2*k_9+arg4, ), resulting in the new rules: 35, 36. Nested simple loops 13 (outer loop) and 15 (inner loop) with Rule(8 | arg4>-1, arg1>0, arg2>1, arg1P_16>3, arg2P_16>3, k_10>=1, 1+arg3-2*k_10>0, | 2*k_10 || 8 | 0=arg1P_16, 1=arg2P_16, 2=arg3-2*k_10, 3=arg4+2*k_10, ), resulting in the new rules: 37, 38. Removing the simple loops: 12 13. Accelerating simple loops of location 12. Accelerating the following rules: 27: f1410_0_append_NULL -> f1410_0_append_NULL : arg1'=arg1P_28, arg2'=arg2P_28, arg3'=arg3P_28, arg4'=arg4P_28, [ 2+arg1P_28<=arg1 && arg1P_28<=arg2 && 3+arg2P_28<=arg1 && 1+arg2P_28<=arg2 && arg1>2 && arg2>0 && arg1P_28>0 && arg2P_28>-1 && 4+arg3P_28<=arg1 && 2+arg3<=arg1 && 2+arg3P_28<=arg2 ], cost: 1 Failed to prove monotonicity of the guard of rule 27. [accelerate] Nesting with 1 inner and 1 outer candidates Accelerated all simple loops using metering functions (where possible): Start location: __init 4: f295_0_main_InvokeMethod -> f2302_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 ], cost: 1 7: f295_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1 16: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1 1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1 2: f1_0_main_Load -> f2292_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1 6: f1_0_main_Load -> f548_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1 8: f2292_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1 18: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1 19: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1 17: f2302_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ 1+arg1P_18<=arg1 && 1+arg1P_18<=arg2 && arg2P_18<=arg2 && 1+arg3P_18<=arg1 && 1+arg3P_18<=arg2 && arg1>0 && arg2>0 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3<=arg2 ], cost: 1 9: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=1+x43_1, [ arg3P_10>0 && x43_1>-1 && arg2P_10>1 && arg1P_10>1 ], cost: 1 10: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && arg1P_11<=arg1 && 2+arg2P_11<=arg2 && arg1>0 && arg2>2 && arg1P_11>0 && arg2P_11>0 ], cost: 1 11: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && arg1P_12<=arg1 && 2+arg2P_12<=arg2 && arg1>0 && arg2>2 && arg1P_12>0 && arg2P_12>0 ], cost: 1 14: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3, arg4'=1+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 ], cost: 1 15: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3, arg4'=1+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 ], cost: 1 29: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=arg3+arg4, [ arg4>-1 && arg1>0 && arg1P_13>0 && -arg2+arg2P_13<=0 && arg3>=1 && arg2P_13>1 ], cost: arg3 30: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=arg3+arg4, [ arg4>-1 && arg1>0 && arg1P_14>0 && -arg2+arg2P_14<=0 && arg3>=1 && arg2P_14>1 ], cost: arg3 31: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3, arg4'=2*k_7+arg4, [ arg4>-1 && arg1>0 && arg2>1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3>0 ], cost: 2*k_7 32: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3, arg4'=1+2*k_7+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3>0 ], cost: 1+2*k_7 33: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3-2*k_8, arg4'=2*k_8+arg4, [ arg4>-1 && arg1>0 && arg2>1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3-2*k_8>0 ], cost: 2*k_8 34: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3-2*k_8, arg4'=1+2*k_8+arg4, [ arg4>-1 && arg3>0 && -2+arg1P_15<=arg1 && -2+arg1P_15<=arg2 && -2+arg2P_15<=arg1 && -2+arg2P_15<=arg2 && arg1>1 && arg2>1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3-2*k_8>0 ], cost: 1+2*k_8 35: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-2*k_9+arg3, arg4'=2*k_9+arg4, [ arg4>-1 && arg1>0 && arg2>1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && 1-2*k_9+arg3>0 ], cost: 2*k_9 36: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1-2*k_9+arg3, arg4'=1+2*k_9+arg4, [ arg3>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && -2*k_9+arg3>0 ], cost: 1+2*k_9 37: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3-2*k_10, arg4'=arg4+2*k_10, [ arg4>-1 && arg1>0 && arg2>1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3-2*k_10>0 ], cost: 2*k_10 38: f2274_0_createTree_LE -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3-2*k_10, arg4'=1+arg4+2*k_10, [ arg3>0 && arg4>-1 && -2+arg1P_16<=arg1 && -2+arg1P_16<=arg2 && -2+arg2P_16<=arg1 && -2+arg2P_16<=arg2 && arg1>1 && arg2>1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3-2*k_10>0 ], cost: 1+2*k_10 20: f1394_0_less_leaves_NULL -> f1268_0_append_NONNULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ 1+arg1P_21<=arg1 && 1+arg1P_21<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_21>-1 ], cost: 1 21: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ 1+arg2P_22<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>-1 && arg2P_22>-1 ], cost: 1 22: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ 1+arg2P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>-1 ], cost: 1 26: f1268_0_append_NONNULL -> f1410_0_append_NULL : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, arg4'=arg4P_27, [ arg1P_27<=arg1 && 1+arg2P_27<=arg1 && arg1>0 && arg1P_27>0 && arg2P_27>-1 && 2+arg3P_27<=arg1 ], cost: 1 23: f1554_0_less_leaves_InvokeMethod -> f1268_0_append_NONNULL : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1P_24<=arg2 && arg1>-1 && arg2>-1 && arg1P_24>-1 ], cost: 1 24: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ arg1P_25<=arg1 && arg3P_25<=arg1 && arg1>-1 && arg2>-1 && arg1P_25>-1 && arg2P_25>-1 && arg3P_25>-1 ], cost: 1 25: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_26<=arg1 && arg3P_26<=arg1 && arg1>-1 && arg2>-1 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 1 27: f1410_0_append_NULL -> f1410_0_append_NULL : arg1'=arg1P_28, arg2'=arg2P_28, arg3'=arg3P_28, arg4'=arg4P_28, [ 2+arg1P_28<=arg1 && arg1P_28<=arg2 && 3+arg2P_28<=arg1 && 1+arg2P_28<=arg2 && arg1>2 && arg2>0 && arg1P_28>0 && arg2P_28>-1 && 4+arg3P_28<=arg1 && 2+arg3<=arg1 && 2+arg3P_28<=arg2 ], cost: 1 28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, arg4'=arg4P_29, [], cost: 1 Chained accelerated rules (with incoming rules): Start location: __init 4: f295_0_main_InvokeMethod -> f2302_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 ], cost: 1 7: f295_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1 16: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1 1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1 2: f1_0_main_Load -> f2292_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1 6: f1_0_main_Load -> f548_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1 8: f2292_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1 18: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1 19: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1 17: f2302_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ 1+arg1P_18<=arg1 && 1+arg1P_18<=arg2 && arg2P_18<=arg2 && 1+arg3P_18<=arg1 && 1+arg3P_18<=arg2 && arg1>0 && arg2>0 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3<=arg2 ], cost: 1 9: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_10, arg2'=arg2P_10, arg3'=arg3P_10, arg4'=1+x43_1, [ arg3P_10>0 && x43_1>-1 && arg2P_10>1 && arg1P_10>1 ], cost: 1 39: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_11, arg2'=arg2P_11, arg3'=-1+arg3P_10, arg4'=2+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_11>0 && arg2P_11>0 ], cost: 2 40: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_12, arg2'=arg2P_12, arg3'=-1+arg3P_10, arg4'=2+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_12>0 && arg2P_12>0 ], cost: 2 41: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10, arg4'=2+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 ], cost: 2 42: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10, arg4'=2+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 ], cost: 2 43: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_13>0 && arg2P_13>1 ], cost: 1+arg3P_10 44: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_14>0 && arg2P_14>1 ], cost: 1+arg3P_10 45: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 1+2*k_7 46: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 2+2*k_7 47: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8 48: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 2+2*k_8 49: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_9, arg4'=1+2*k_9+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && 1+arg3P_10-2*k_9>0 ], cost: 1+2*k_9 50: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9 51: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 1+2*k_10 52: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+x43_1+2*k_10, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 2+2*k_10 20: f1394_0_less_leaves_NULL -> f1268_0_append_NONNULL : arg1'=arg1P_21, arg2'=arg2P_21, arg3'=arg3P_21, arg4'=arg4P_21, [ 1+arg1P_21<=arg1 && 1+arg1P_21<=arg3 && arg1>0 && arg2>0 && arg3>0 && arg1P_21>-1 ], cost: 1 21: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ 1+arg2P_22<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>-1 && arg2P_22>-1 ], cost: 1 22: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ 1+arg2P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>-1 ], cost: 1 26: f1268_0_append_NONNULL -> f1410_0_append_NULL : arg1'=arg1P_27, arg2'=arg2P_27, arg3'=arg3P_27, arg4'=arg4P_27, [ arg1P_27<=arg1 && 1+arg2P_27<=arg1 && arg1>0 && arg1P_27>0 && arg2P_27>-1 && 2+arg3P_27<=arg1 ], cost: 1 53: f1268_0_append_NONNULL -> f1410_0_append_NULL : arg1'=arg1P_28, arg2'=arg2P_28, arg3'=arg3P_28, arg4'=arg4P_28, [ arg1P_28>0 && arg2P_28>-1 && 2+arg1P_28<=arg1 && 3+arg2P_28<=arg1 && 3<=arg1 && 4+arg3P_28<=arg1 ], cost: 2 23: f1554_0_less_leaves_InvokeMethod -> f1268_0_append_NONNULL : arg1'=arg1P_24, arg2'=arg2P_24, arg3'=arg3P_24, arg4'=arg4P_24, [ arg1P_24<=arg2 && arg1>-1 && arg2>-1 && arg1P_24>-1 ], cost: 1 24: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ arg1P_25<=arg1 && arg3P_25<=arg1 && arg1>-1 && arg2>-1 && arg1P_25>-1 && arg2P_25>-1 && arg3P_25>-1 ], cost: 1 25: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_26<=arg1 && arg3P_26<=arg1 && arg1>-1 && arg2>-1 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 1 28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, arg4'=arg4P_29, [], cost: 1 Removed unreachable locations (and leaf rules with constant cost): Start location: __init 4: f295_0_main_InvokeMethod -> f2302_0_main_InvokeMethod : arg1'=arg1P_5, arg2'=arg2P_5, arg3'=arg3P_5, arg4'=arg4P_5, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 ], cost: 1 7: f295_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1 16: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1 1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1 2: f1_0_main_Load -> f2292_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1 6: f1_0_main_Load -> f548_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1 8: f2292_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1 18: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1 19: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1 17: f2302_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ 1+arg1P_18<=arg1 && 1+arg1P_18<=arg2 && arg2P_18<=arg2 && 1+arg3P_18<=arg1 && 1+arg3P_18<=arg2 && arg1>0 && arg2>0 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3<=arg2 ], cost: 1 43: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_13>0 && arg2P_13>1 ], cost: 1+arg3P_10 44: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_14>0 && arg2P_14>1 ], cost: 1+arg3P_10 45: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 1+2*k_7 46: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 2+2*k_7 47: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8 48: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 2+2*k_8 49: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_9, arg4'=1+2*k_9+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && 1+arg3P_10-2*k_9>0 ], cost: 1+2*k_9 50: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9 51: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 1+2*k_10 52: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+x43_1+2*k_10, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 2+2*k_10 21: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ 1+arg2P_22<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>-1 && arg2P_22>-1 ], cost: 1 22: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ 1+arg2P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>-1 ], cost: 1 24: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ arg1P_25<=arg1 && arg3P_25<=arg1 && arg1>-1 && arg2>-1 && arg1P_25>-1 && arg2P_25>-1 && arg3P_25>-1 ], cost: 1 25: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_26<=arg1 && arg3P_26<=arg1 && arg1>-1 && arg2>-1 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 1 28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, arg4'=arg4P_29, [], cost: 1 Eliminated locations (on linear paths): Start location: __init 7: f295_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1 16: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1 54: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 && 1+arg1P_18<=arg1P_5 && 1+arg1P_18<=arg2P_5 && arg2P_18<=arg2P_5 && 1+arg3P_18<=arg1P_5 && 1+arg3P_18<=arg2P_5 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3P_5<=arg2P_5 ], cost: 2 1: f1_0_main_Load -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1 && arg1>0 && arg1P_2>0 ], cost: 1 2: f1_0_main_Load -> f2292_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1>=arg1P_3 && arg1>0 && arg1P_3>0 && arg2P_3>0 ], cost: 1 6: f1_0_main_Load -> f548_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1>0 && arg2>-1 ], cost: 1 8: f2292_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1 18: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1 19: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1 43: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_13>0 && arg2P_13>1 ], cost: 1+arg3P_10 44: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_14>0 && arg2P_14>1 ], cost: 1+arg3P_10 45: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 1+2*k_7 46: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 2+2*k_7 47: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8 48: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 2+2*k_8 49: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_9, arg4'=1+2*k_9+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && 1+arg3P_10-2*k_9>0 ], cost: 1+2*k_9 50: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9 51: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 1+2*k_10 52: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+x43_1+2*k_10, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 2+2*k_10 21: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_22, arg2'=arg2P_22, arg3'=arg3P_22, arg4'=arg4P_22, [ 1+arg2P_22<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>-1 && arg2P_22>-1 ], cost: 1 22: f1394_0_less_leaves_NULL -> f1554_0_less_leaves_InvokeMethod : arg1'=arg1P_23, arg2'=arg2P_23, arg3'=arg3P_23, arg4'=arg4P_23, [ 1+arg2P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>-1 ], cost: 1 24: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ arg1P_25<=arg1 && arg3P_25<=arg1 && arg1>-1 && arg2>-1 && arg1P_25>-1 && arg2P_25>-1 && arg3P_25>-1 ], cost: 1 25: f1554_0_less_leaves_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_26<=arg1 && arg3P_26<=arg1 && arg1>-1 && arg2>-1 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 1 28: __init -> f1_0_main_Load : arg1'=arg1P_29, arg2'=arg2P_29, arg3'=arg3P_29, arg4'=arg4P_29, [], cost: 1 Eliminated locations (on tree-shaped paths): Start location: __init 7: f295_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1 16: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1 54: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 && 1+arg1P_18<=arg1P_5 && 1+arg1P_18<=arg2P_5 && arg2P_18<=arg2P_5 && 1+arg3P_18<=arg1P_5 && 1+arg3P_18<=arg2P_5 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3P_5<=arg2P_5 ], cost: 2 8: f2292_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1 18: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1 19: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1 43: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_13, arg2'=arg2P_13, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_13>0 && arg2P_13>1 ], cost: 1+arg3P_10 44: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_14, arg2'=arg2P_14, arg3'=0, arg4'=1+arg3P_10+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_14>0 && arg2P_14>1 ], cost: 1+arg3P_10 45: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 1+2*k_7 46: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 2+2*k_7 47: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8 48: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1+arg3P_10-2*k_8, arg4'=2+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && arg3P_10-2*k_8>0 ], cost: 2+2*k_8 49: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_9, arg4'=1+2*k_9+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && 1+arg3P_10-2*k_9>0 ], cost: 1+2*k_9 50: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9 51: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 1+2*k_10 52: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_10, arg4'=2+x43_1+2*k_10, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && arg3P_10-2*k_10>0 ], cost: 2+2*k_10 58: f1394_0_less_leaves_NULL -> f1394_0_less_leaves_NULL : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ 1+arg2P_22<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>-1 && arg2P_22>-1 && arg1P_25<=arg1P_22 && arg3P_25<=arg1P_22 && arg1P_25>-1 && arg2P_25>-1 && arg3P_25>-1 ], cost: 2 59: f1394_0_less_leaves_NULL -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ 1+arg2P_22<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>-1 && arg2P_22>-1 && arg1P_26<=arg1P_22 && arg3P_26<=arg1P_22 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 2 60: f1394_0_less_leaves_NULL -> f1394_0_less_leaves_NULL : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ 1+arg2P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>-1 && arg1P_25<=arg1P_23 && arg3P_25<=arg1P_23 && arg1P_25>-1 && arg2P_25>-1 && arg3P_25>-1 ], cost: 2 61: f1394_0_less_leaves_NULL -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ 1+arg2P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>-1 && arg1P_26<=arg1P_23 && arg3P_26<=arg1P_23 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 2 55: __init -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 ], cost: 2 56: __init -> f2292_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 ], cost: 2 57: __init -> f548_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_29>0 && arg2P_29>-1 ], cost: 2 Applied pruning (of leafs and parallel rules): Start location: __init 7: f295_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1 16: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1 54: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 && 1+arg1P_18<=arg1P_5 && 1+arg1P_18<=arg2P_5 && arg2P_18<=arg2P_5 && 1+arg3P_18<=arg1P_5 && 1+arg3P_18<=arg2P_5 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3P_5<=arg2P_5 ], cost: 2 8: f2292_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1 18: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1 19: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1 45: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 1+2*k_7 46: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 2+2*k_7 47: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8 50: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9 51: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 1+2*k_10 58: f1394_0_less_leaves_NULL -> f1394_0_less_leaves_NULL : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ 1+arg2P_22<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>-1 && arg2P_22>-1 && arg1P_25<=arg1P_22 && arg3P_25<=arg1P_22 && arg1P_25>-1 && arg2P_25>-1 && arg3P_25>-1 ], cost: 2 59: f1394_0_less_leaves_NULL -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ 1+arg2P_22<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_22>-1 && arg2P_22>-1 && arg1P_26<=arg1P_22 && arg3P_26<=arg1P_22 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 2 60: f1394_0_less_leaves_NULL -> f1394_0_less_leaves_NULL : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ 1+arg2P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>-1 && arg1P_25<=arg1P_23 && arg3P_25<=arg1P_23 && arg1P_25>-1 && arg2P_25>-1 && arg3P_25>-1 ], cost: 2 61: f1394_0_less_leaves_NULL -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ 1+arg2P_23<=arg2 && arg1>0 && arg2>0 && arg3>0 && arg1P_23>0 && arg2P_23>-1 && arg1P_26<=arg1P_23 && arg3P_26<=arg1P_23 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 2 55: __init -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 ], cost: 2 56: __init -> f2292_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 ], cost: 2 57: __init -> f548_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_29>0 && arg2P_29>-1 ], cost: 2 Accelerating simple loops of location 9. [accelerate] Removed some duplicate simple loops Simplified some of the simple loops (and removed duplicate rules). Accelerating the following rules: 60: f1394_0_less_leaves_NULL -> f1394_0_less_leaves_NULL : arg1'=arg1P_25, arg2'=arg2P_25, arg3'=arg3P_25, arg4'=arg4P_25, [ arg1>0 && arg2>0 && arg3>0 && arg1P_25>-1 && arg2P_25>-1 && arg3P_25>-1 ], cost: 2 61: f1394_0_less_leaves_NULL -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1>0 && arg2>0 && arg3>0 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 2 [test] deduced pseudo-invariant -arg3+arg3P_25<=0, also trying arg3-arg3P_25<=-1 [test] deduced invariant -1-arg2<=0 [test] deduced pseudo-invariant 1-arg1P_25<=0, also trying -1+arg1P_25<=-1 Accelerated rule 60 with non-termination, yielding the new rule 62. Accelerated rule 60 with non-termination, yielding the new rule 63. [test] deduced pseudo-invariant arg3P_26-arg3<=0, also trying -arg3P_26+arg3<=-1 [test] deduced pseudo-invariant arg1P_26-arg1<=0, also trying -arg1P_26+arg1<=-1 Accelerated rule 61 with non-termination, yielding the new rule 64. Accelerated rule 61 with non-termination, yielding the new rule 65. Accelerated rule 61 with backward acceleration, yielding the new rule 66. [accelerate] Nesting with 1 inner and 2 outer candidates Nested simple loops 60 (outer loop) and 66 (inner loop) with Rule(9 | arg1>0, arg2>0, arg3>0, arg2P_26>0, k_17>=1, arg1P_26>0, arg3P_26>0, | NONTERM || 16 | ), resulting in the new rules: 67, 68. Removing the simple loops: 60. Accelerated all simple loops using metering functions (where possible): Start location: __init 7: f295_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1 16: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1 54: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 && 1+arg1P_18<=arg1P_5 && 1+arg1P_18<=arg2P_5 && arg2P_18<=arg2P_5 && 1+arg3P_18<=arg1P_5 && 1+arg3P_18<=arg2P_5 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3P_5<=arg2P_5 ], cost: 2 8: f2292_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1 18: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1 19: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1 45: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 1+2*k_7 46: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 2+2*k_7 47: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8 50: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9 51: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 1+2*k_10 61: f1394_0_less_leaves_NULL -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1>0 && arg2>0 && arg3>0 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 2 62: f1394_0_less_leaves_NULL -> [16] : [ arg1>0 && arg2>0 && arg3>0 && arg1P_25>0 && arg2P_25>0 && arg3P_25>0 ], cost: NONTERM 63: f1394_0_less_leaves_NULL -> [16] : [ arg1>0 && arg2>0 && arg3>0 && -arg3+arg3P_25<=0 && 1-arg1P_25<=0 && arg2P_25>0 && arg3P_25>0 ], cost: NONTERM 64: f1394_0_less_leaves_NULL -> [16] : [ arg1>0 && arg2>0 && arg3>0 && arg2P_26>0 && arg1P_26>0 && arg3P_26>0 ], cost: NONTERM 65: f1394_0_less_leaves_NULL -> [16] : [ arg1>0 && arg2>0 && arg3>0 && arg2P_26>0 && arg3P_26-arg3<=0 && arg1P_26-arg1<=0 && arg1P_26>0 && arg3P_26>0 ], cost: NONTERM 66: f1394_0_less_leaves_NULL -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg2>0 && arg2P_26>0 && arg3P_26-arg3<=0 && arg1P_26-arg1<=0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 ], cost: 2*k_17 67: f1394_0_less_leaves_NULL -> [16] : [ arg1>0 && arg2>0 && arg3>0 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 ], cost: NONTERM 68: f1394_0_less_leaves_NULL -> [16] : [ arg2>0 && arg2P_26>0 && arg3P_26-arg3<=0 && arg1P_26-arg1<=0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 ], cost: NONTERM 55: __init -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 ], cost: 2 56: __init -> f2292_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 ], cost: 2 57: __init -> f548_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_29>0 && arg2P_29>-1 ], cost: 2 Chained accelerated rules (with incoming rules): Start location: __init 7: f295_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1 16: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_17, arg2'=arg2P_17, arg3'=arg3P_17, arg4'=arg4P_17, [ arg2>0 && 1+arg1P_17<=arg1 && 1+arg2P_17<=arg1 && 1+arg3P_17<=arg1 && arg1>0 && arg1P_17>-1 && arg2P_17>-1 && arg3P_17>-1 ], cost: 1 54: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_18, arg2'=arg2P_18, arg3'=arg3P_18, arg4'=arg4P_18, [ arg1P_5<=arg1 && arg2>0 && arg1>0 && arg1P_5>0 && arg2P_5>0 && 1+arg1P_18<=arg1P_5 && 1+arg1P_18<=arg2P_5 && arg2P_18<=arg2P_5 && 1+arg3P_18<=arg1P_5 && 1+arg3P_18<=arg2P_5 && arg1P_18>-1 && arg2P_18>0 && arg3P_18>-1 && 2+arg3P_5<=arg2P_5 ], cost: 2 69: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg2>0 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 && 1<=-1+arg1 ], cost: 3 72: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg2>0 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 && 2<=arg1 ], cost: 4 73: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM 76: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 2<=arg1 ], cost: NONTERM 77: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM 80: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 2<=arg1 ], cost: NONTERM 81: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM 84: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 2<=arg1 ], cost: NONTERM 85: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM 88: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 2<=arg1 ], cost: NONTERM 89: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg2>0 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && 1<=-1+arg1 && arg3P_26<=-1+arg1 && arg1P_26<=-1+arg1 ], cost: 1+2*k_17 92: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg2>0 && arg1>0 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && 1+arg3P_26<=arg1 && 1+arg1P_26<=arg1 ], cost: 2+2*k_17 93: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM 96: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 2<=arg1 ], cost: NONTERM 97: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM 100: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 2<=arg1 ], cost: NONTERM 8: f2292_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1 18: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_19, arg2'=arg2P_19, arg3'=arg3P_19, arg4'=arg4P_19, [ arg1P_19<=arg2 && 1+arg2P_19<=arg1 && 1+arg2P_19<=arg2 && arg3P_19<=arg2 && arg1>0 && arg2>0 && arg1P_19>0 && arg2P_19>-1 && arg3P_19>0 && 2+arg4<=arg2 ], cost: 1 19: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_20, arg2'=arg2P_20, arg3'=arg3P_20, arg4'=arg4P_20, [ arg1P_20<=arg2 && arg3P_20<=arg2 && arg1>0 && arg2>0 && arg1P_20>0 && arg2P_20>0 && arg3P_20>0 && 2+arg4<=arg2 ], cost: 1 70: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ 2+arg4<=arg2 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: 3 71: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1>0 && arg2>0 && 2+arg4<=arg2 && arg1P_26>-1 && arg2P_26>0 && arg3P_26>-1 ], cost: 3 74: f2292_0_main_InvokeMethod -> [16] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM 75: f2292_0_main_InvokeMethod -> [16] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM 78: f2292_0_main_InvokeMethod -> [16] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM 79: f2292_0_main_InvokeMethod -> [16] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM 82: f2292_0_main_InvokeMethod -> [16] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM 83: f2292_0_main_InvokeMethod -> [16] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM 86: f2292_0_main_InvokeMethod -> [16] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM 87: f2292_0_main_InvokeMethod -> [16] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM 90: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ 2+arg4<=arg2 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && arg3P_26<=arg2 && arg1P_26<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: 1+2*k_17 91: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1>0 && arg2>0 && 2+arg4<=arg2 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && arg3P_26<=arg2 && arg1P_26<=arg2 ], cost: 1+2*k_17 94: f2292_0_main_InvokeMethod -> [16] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM 95: f2292_0_main_InvokeMethod -> [16] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM 98: f2292_0_main_InvokeMethod -> [16] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM 99: f2292_0_main_InvokeMethod -> [16] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM 45: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 1+2*k_7 46: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 2+2*k_7 47: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8 50: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9 51: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 1+2*k_10 55: __init -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 ], cost: 2 56: __init -> f2292_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 ], cost: 2 57: __init -> f548_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_29>0 && arg2P_29>-1 ], cost: 2 Removed unreachable locations (and leaf rules with constant cost): Start location: __init 7: f295_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_8, arg2'=arg2P_8, arg3'=arg3P_8, arg4'=arg4P_8, [ arg2>0 && arg1>0 ], cost: 1 73: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM 76: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 2<=arg1 ], cost: NONTERM 77: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM 80: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 2<=arg1 ], cost: NONTERM 81: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM 84: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 2<=arg1 ], cost: NONTERM 85: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM 88: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 2<=arg1 ], cost: NONTERM 89: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg2>0 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && 1<=-1+arg1 && arg3P_26<=-1+arg1 && arg1P_26<=-1+arg1 ], cost: 1+2*k_17 92: f295_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg2>0 && arg1>0 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && 1+arg3P_26<=arg1 && 1+arg1P_26<=arg1 ], cost: 2+2*k_17 93: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM 96: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 2<=arg1 ], cost: NONTERM 97: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 1<=-1+arg1 ], cost: NONTERM 100: f295_0_main_InvokeMethod -> [16] : [ arg2>0 && 2<=arg1 ], cost: NONTERM 8: f2292_0_main_InvokeMethod -> f548_0_random_ArrayAccess : arg1'=arg1P_9, arg2'=arg2P_9, arg3'=arg3P_9, arg4'=arg4P_9, [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: 1 74: f2292_0_main_InvokeMethod -> [16] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM 75: f2292_0_main_InvokeMethod -> [16] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM 78: f2292_0_main_InvokeMethod -> [16] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM 79: f2292_0_main_InvokeMethod -> [16] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM 82: f2292_0_main_InvokeMethod -> [16] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM 83: f2292_0_main_InvokeMethod -> [16] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM 86: f2292_0_main_InvokeMethod -> [16] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM 87: f2292_0_main_InvokeMethod -> [16] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM 90: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ 2+arg4<=arg2 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && arg3P_26<=arg2 && arg1P_26<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: 1+2*k_17 91: f2292_0_main_InvokeMethod -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1>0 && arg2>0 && 2+arg4<=arg2 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && arg3P_26<=arg2 && arg1P_26<=arg2 ], cost: 1+2*k_17 94: f2292_0_main_InvokeMethod -> [16] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM 95: f2292_0_main_InvokeMethod -> [16] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM 98: f2292_0_main_InvokeMethod -> [16] : [ 2+arg4<=arg2 && 1<=-1+arg1 && 1<=-1+arg2 ], cost: NONTERM 99: f2292_0_main_InvokeMethod -> [16] : [ arg1>0 && arg2>0 && 2+arg4<=arg2 ], cost: NONTERM 45: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 1+2*k_7 46: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 2+2*k_7 47: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 1+2*k_8 50: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 2+2*k_9 51: f548_0_random_ArrayAccess -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 1+2*k_10 55: __init -> f295_0_main_InvokeMethod : arg1'=arg1P_2, arg2'=arg2P_2, arg3'=arg3P_2, arg4'=arg4P_2, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 ], cost: 2 56: __init -> f2292_0_main_InvokeMethod : arg1'=arg1P_3, arg2'=arg2P_3, arg3'=arg3P_3, arg4'=arg4P_3, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 ], cost: 2 57: __init -> f548_0_random_ArrayAccess : arg1'=arg1P_7, arg2'=arg2P_7, arg3'=arg3P_7, arg4'=arg4P_7, [ arg1P_29>0 && arg2P_29>-1 ], cost: 2 Eliminated locations (on tree-shaped paths): Start location: __init 102: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 1<=-1+arg1P_2 ], cost: NONTERM 103: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 2<=arg1P_2 ], cost: NONTERM 104: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 1<=-1+arg1P_2 ], cost: NONTERM 105: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 2<=arg1P_2 ], cost: NONTERM 106: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 1<=-1+arg1P_2 ], cost: NONTERM 107: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 2<=arg1P_2 ], cost: NONTERM 108: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 1<=-1+arg1P_2 ], cost: NONTERM 109: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 2<=arg1P_2 ], cost: NONTERM 110: __init -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && 1<=-1+arg1P_2 && arg3P_26<=-1+arg1P_2 && arg1P_26<=-1+arg1P_2 ], cost: 3+2*k_17 111: __init -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 && arg2P_2>0 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && 1+arg3P_26<=arg1P_2 && 1+arg1P_26<=arg1P_2 ], cost: 4+2*k_17 112: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 1<=-1+arg1P_2 ], cost: NONTERM 113: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 2<=arg1P_2 ], cost: NONTERM 114: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 1<=-1+arg1P_2 ], cost: NONTERM 115: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 2<=arg1P_2 ], cost: NONTERM 117: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && 2+arg4P_3<=arg2P_3 && 1<=-1+arg1P_3 && 1<=-1+arg2P_3 ], cost: NONTERM 118: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 ], cost: NONTERM 119: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && 2+arg4P_3<=arg2P_3 && 1<=-1+arg1P_3 && 1<=-1+arg2P_3 ], cost: NONTERM 120: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 ], cost: NONTERM 121: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && 2+arg4P_3<=arg2P_3 && 1<=-1+arg1P_3 && 1<=-1+arg2P_3 ], cost: NONTERM 122: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 ], cost: NONTERM 123: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && 2+arg4P_3<=arg2P_3 && 1<=-1+arg1P_3 && 1<=-1+arg2P_3 ], cost: NONTERM 124: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 ], cost: NONTERM 125: __init -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_29>=arg1P_3 && arg1P_29>0 && 2+arg4P_3<=arg2P_3 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && arg3P_26<=arg2P_3 && arg1P_26<=arg2P_3 && 1<=-1+arg1P_3 && 1<=-1+arg2P_3 ], cost: 3+2*k_17 126: __init -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && arg3P_26<=arg2P_3 && arg1P_26<=arg2P_3 ], cost: 3+2*k_17 127: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && 2+arg4P_3<=arg2P_3 && 1<=-1+arg1P_3 && 1<=-1+arg2P_3 ], cost: NONTERM 128: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 ], cost: NONTERM 129: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && 2+arg4P_3<=arg2P_3 && 1<=-1+arg1P_3 && 1<=-1+arg2P_3 ], cost: NONTERM 130: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 ], cost: NONTERM 131: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg1P_29>0 && arg2P_29>-1 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 3+2*k_7 132: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg1P_29>0 && arg2P_29>-1 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 4+2*k_7 133: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg1P_29>0 && arg2P_29>-1 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 3+2*k_8 134: __init -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg1P_29>0 && arg2P_29>-1 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 4+2*k_9 135: __init -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg1P_29>0 && arg2P_29>-1 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 3+2*k_10 136: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 4+2*k_7 137: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 5+2*k_7 138: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 4+2*k_8 139: __init -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 5+2*k_9 140: __init -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 4+2*k_10 141: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 4+2*k_7 142: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 5+2*k_7 143: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 4+2*k_8 144: __init -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 5+2*k_9 145: __init -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 4+2*k_10 Aborted due to lack of remaining time ### Computing asymptotic complexity ### Fully simplified ITS problem Start location: __init 110: __init -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && 1<=-1+arg1P_2 && arg3P_26<=-1+arg1P_2 && arg1P_26<=-1+arg1P_2 ], cost: 3+2*k_17 111: __init -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 && arg2P_2>0 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && 1+arg3P_26<=arg1P_2 && 1+arg1P_26<=arg1P_2 ], cost: 4+2*k_17 114: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 1<=-1+arg1P_2 ], cost: NONTERM 115: __init -> [16] : [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 2<=arg1P_2 ], cost: NONTERM 125: __init -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_29>=arg1P_3 && arg1P_29>0 && 2+arg4P_3<=arg2P_3 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && arg3P_26<=arg2P_3 && arg1P_26<=arg2P_3 && 1<=-1+arg1P_3 && 1<=-1+arg2P_3 ], cost: 3+2*k_17 126: __init -> f1394_0_less_leaves_NULL : arg1'=arg1P_26, arg2'=arg2P_26, arg3'=arg3P_26, arg4'=arg4P_26, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg2P_26>0 && k_17>=1 && arg1P_26>0 && arg3P_26>0 && arg3P_26<=arg2P_3 && arg1P_26<=arg2P_3 ], cost: 3+2*k_17 129: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && 2+arg4P_3<=arg2P_3 && 1<=-1+arg1P_3 && 1<=-1+arg2P_3 ], cost: NONTERM 130: __init -> [16] : [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 ], cost: NONTERM 131: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg1P_29>0 && arg2P_29>-1 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 3+2*k_7 132: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg1P_29>0 && arg2P_29>-1 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 4+2*k_7 133: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg1P_29>0 && arg2P_29>-1 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 3+2*k_8 134: __init -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg1P_29>0 && arg2P_29>-1 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 4+2*k_9 135: __init -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg1P_29>0 && arg2P_29>-1 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 3+2*k_10 136: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 4+2*k_7 137: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 5+2*k_7 138: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 4+2*k_8 139: __init -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 5+2*k_9 140: __init -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg1P_2>0 && arg2P_2>0 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 4+2*k_10 141: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-2*k_7+arg3P_10, arg4'=1+2*k_7+x43_1, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && 1-2*k_7+arg3P_10>0 ], cost: 4+2*k_7 142: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=-1-2*k_7+arg3P_10, arg4'=2+2*k_7+x43_1, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_7>=1 && -2*k_7+arg3P_10>0 ], cost: 5+2*k_7 143: __init -> f2274_0_createTree_LE : arg1'=arg1P_15, arg2'=arg2P_15, arg3'=arg3P_10-2*k_8, arg4'=1+x43_1+2*k_8, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_15>3 && arg2P_15>3 && k_8>=1 && 1+arg3P_10-2*k_8>0 ], cost: 4+2*k_8 144: __init -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=-1+arg3P_10-2*k_9, arg4'=2+2*k_9+x43_1, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_9>=1 && arg3P_10-2*k_9>0 ], cost: 5+2*k_9 145: __init -> f2274_0_createTree_LE : arg1'=arg1P_16, arg2'=arg2P_16, arg3'=arg3P_10-2*k_10, arg4'=1+x43_1+2*k_10, [ arg1P_29>=arg1P_3 && arg1P_29>0 && arg1P_3>0 && arg2P_3>0 && 2+arg4P_3<=arg2P_3 && arg3P_10>0 && x43_1>-1 && arg1P_16>3 && arg2P_16>3 && k_10>=1 && 1+arg3P_10-2*k_10>0 ], cost: 4+2*k_10 Computing asymptotic complexity for rule 114 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: [ arg1P_2<=arg1P_29 && arg1P_29>0 && arg2P_2>0 && 1<=-1+arg1P_2 ] NO