/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES
proof of /export/starexec/sandbox/benchmark/theBenchmark.jar
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


termination of the given Bare JBC problem could be proven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 97 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 466 ms]
(4) JBCTerminationGraph
(5) TerminationGraphToSCCProof [SOUND, 0 ms]
(6) JBCTerminationSCC
(7) SCCToIRSProof [SOUND, 0 ms]
(8) IRSwT
(9) IRSFormatTransformerProof [EQUIVALENT, 1 ms]
(10) IRSwT
(11) IRSwTTerminationDigraphProof [EQUIVALENT, 121 ms]
(12) IRSwT
(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(14) IRSwT
(15) TempFilterProof [SOUND, 62 ms]
(16) IntTRS
(17) RankingReductionPairProof [EQUIVALENT, 0 ms]
(18) YES


----------------------------------------

(0)
Obligation:
need to prove termination of the following program:
public class Test2 {
    public static void main(String[] args) {
	iter(args.length, args.length % 5, args.length % 4);
    }

    private static void iter(int x, int y, int z) {
	while (x + y + 3 * z >= 0) {
	    if (x > y)
		x--;
	    else if (y > z) {
		x++;
		y -= 2;
	    }
	    else if (y <= z) {
		x = add(x, 1);
		y = add(y, 1);
		z = z - 1;
	    }
	}
    }

    private static int add(int v, int w) {
	return v + w;
    }
}



----------------------------------------

(1) BareJBCToJBCProof (EQUIVALENT)
initialized classpath
----------------------------------------

(2)
Obligation:
need to prove termination of the following program:
public class Test2 {
    public static void main(String[] args) {
	iter(args.length, args.length % 5, args.length % 4);
    }

    private static void iter(int x, int y, int z) {
	while (x + y + 3 * z >= 0) {
	    if (x > y)
		x--;
	    else if (y > z) {
		x++;
		y -= 2;
	    }
	    else if (y <= z) {
		x = add(x, 1);
		y = add(y, 1);
		z = z - 1;
	    }
	}
    }

    private static int add(int v, int w) {
	return v + w;
    }
}



----------------------------------------

(3) JBCToGraph (EQUIVALENT)
Constructed TerminationGraph.
----------------------------------------

(4)
Obligation:
Termination Graph based on JBC Program:
Test2.main([Ljava/lang/String;)V: Graph of 76 nodes with 1 SCC.





----------------------------------------

(5) TerminationGraphToSCCProof (SOUND)
Splitted TerminationGraph to 1 SCCs.
----------------------------------------

(6)
Obligation:
SCC of termination graph based on JBC Program.
SCC contains nodes from the following methods: Test2.main([Ljava/lang/String;)V
SCC calls the following helper methods: 
Performed SCC analyses:
*Used field analysis yielded the following read fields:

*Marker field analysis yielded the following relations that could be markers:

----------------------------------------

(7) SCCToIRSProof (SOUND)
Transformed FIGraph SCCs to intTRSs. Log: 
Generated rules. Obtained 54 IRulesP rules:
f1046_0_iter_Load(EOS(STATIC_1046), i287, i288, i289, i287) -> f1048_0_iter_IntArithmetic(EOS(STATIC_1048), i287, i288, i289, i287, i288) :|: TRUE
f1048_0_iter_IntArithmetic(EOS(STATIC_1048), i287, i288, i289, i287, i288) -> f1051_0_iter_ConstantStackPush(EOS(STATIC_1051), i287, i288, i289, i287 + i288) :|: TRUE
f1051_0_iter_ConstantStackPush(EOS(STATIC_1051), i287, i288, i289, i296) -> f1054_0_iter_Load(EOS(STATIC_1054), i287, i288, i289, i296, 3) :|: TRUE
f1054_0_iter_Load(EOS(STATIC_1054), i287, i288, i289, i296, matching1) -> f1055_0_iter_IntArithmetic(EOS(STATIC_1055), i287, i288, i289, i296, 3, i289) :|: TRUE && matching1 = 3
f1055_0_iter_IntArithmetic(EOS(STATIC_1055), i287, i288, i289, i296, matching1, i289) -> f1056_0_iter_IntArithmetic(EOS(STATIC_1056), i287, i288, i289, i296, 3 * i289) :|: TRUE && matching1 = 3
f1056_0_iter_IntArithmetic(EOS(STATIC_1056), i287, i288, i289, i296, i297) -> f1057_0_iter_LT(EOS(STATIC_1057), i287, i288, i289, i296 + i297) :|: TRUE
f1057_0_iter_LT(EOS(STATIC_1057), i287, i288, i289, i300) -> f1059_0_iter_LT(EOS(STATIC_1059), i287, i288, i289, i300) :|: TRUE
f1059_0_iter_LT(EOS(STATIC_1059), i287, i288, i289, i300) -> f1061_0_iter_Load(EOS(STATIC_1061), i287, i288, i289) :|: i300 >= 0
f1061_0_iter_Load(EOS(STATIC_1061), i287, i288, i289) -> f1063_0_iter_Load(EOS(STATIC_1063), i287, i288, i289, i287) :|: TRUE
f1063_0_iter_Load(EOS(STATIC_1063), i287, i288, i289, i287) -> f1065_0_iter_LE(EOS(STATIC_1065), i287, i288, i289, i287, i288) :|: TRUE
f1065_0_iter_LE(EOS(STATIC_1065), i287, i288, i289, i287, i288) -> f1073_0_iter_LE(EOS(STATIC_1073), i287, i288, i289, i287, i288) :|: i287 <= i288
f1065_0_iter_LE(EOS(STATIC_1065), i287, i288, i289, i287, i288) -> f1074_0_iter_LE(EOS(STATIC_1074), i287, i288, i289, i287, i288) :|: i287 > i288
f1073_0_iter_LE(EOS(STATIC_1073), i287, i288, i289, i287, i288) -> f1079_0_iter_Load(EOS(STATIC_1079), i287, i288, i289) :|: i287 <= i288
f1079_0_iter_Load(EOS(STATIC_1079), i287, i288, i289) -> f1082_0_iter_Load(EOS(STATIC_1082), i287, i288, i289, i288) :|: TRUE
f1082_0_iter_Load(EOS(STATIC_1082), i287, i288, i289, i288) -> f1084_0_iter_LE(EOS(STATIC_1084), i287, i288, i289, i288, i289) :|: TRUE
f1084_0_iter_LE(EOS(STATIC_1084), i287, i288, i289, i288, i289) -> f1091_0_iter_LE(EOS(STATIC_1091), i287, i288, i289, i288, i289) :|: i288 <= i289
f1084_0_iter_LE(EOS(STATIC_1084), i287, i288, i289, i288, i289) -> f1092_0_iter_LE(EOS(STATIC_1092), i287, i288, i289, i288, i289) :|: i288 > i289
f1091_0_iter_LE(EOS(STATIC_1091), i287, i288, i289, i288, i289) -> f1097_0_iter_Load(EOS(STATIC_1097), i287, i288, i289) :|: i288 <= i289
f1097_0_iter_Load(EOS(STATIC_1097), i287, i288, i289) -> f1101_0_iter_Load(EOS(STATIC_1101), i287, i288, i289, i288) :|: TRUE
f1101_0_iter_Load(EOS(STATIC_1101), i287, i288, i289, i288) -> f1103_0_iter_GT(EOS(STATIC_1103), i287, i288, i289, i288, i289) :|: TRUE
f1103_0_iter_GT(EOS(STATIC_1103), i287, i288, i289, i288, i289) -> f1105_0_iter_GT(EOS(STATIC_1105), i287, i288, i289, i288, i289) :|: i288 <= i289
f1105_0_iter_GT(EOS(STATIC_1105), i287, i288, i289, i288, i289) -> f1107_0_iter_Load(EOS(STATIC_1107), i287, i288, i289) :|: i288 <= i289
f1107_0_iter_Load(EOS(STATIC_1107), i287, i288, i289) -> f1108_0_iter_ConstantStackPush(EOS(STATIC_1108), i288, i289, i287) :|: TRUE
f1108_0_iter_ConstantStackPush(EOS(STATIC_1108), i288, i289, i287) -> f1109_0_iter_InvokeMethod(EOS(STATIC_1109), i288, i289, i287, 1) :|: TRUE
f1109_0_iter_InvokeMethod(EOS(STATIC_1109), i288, i289, i287, matching1) -> f1110_0_add_Load(EOS(STATIC_1110), i288, i289, i287, 1) :|: TRUE && matching1 = 1
f1110_0_add_Load(EOS(STATIC_1110), i288, i289, i287, matching1) -> f1111_0_add_Load(EOS(STATIC_1111), i288, i289, 1, i287) :|: TRUE && matching1 = 1
f1111_0_add_Load(EOS(STATIC_1111), i288, i289, matching1, i287) -> f1112_0_add_IntArithmetic(EOS(STATIC_1112), i288, i289, i287, 1) :|: TRUE && matching1 = 1
f1112_0_add_IntArithmetic(EOS(STATIC_1112), i288, i289, i287, matching1) -> f1113_0_add_Return(EOS(STATIC_1113), i288, i289, i287 + 1) :|: TRUE && matching1 = 1
f1113_0_add_Return(EOS(STATIC_1113), i288, i289, i311) -> f1114_0_iter_Store(EOS(STATIC_1114), i288, i289, i311) :|: TRUE
f1114_0_iter_Store(EOS(STATIC_1114), i288, i289, i311) -> f1115_0_iter_Load(EOS(STATIC_1115), i311, i288, i289) :|: TRUE
f1115_0_iter_Load(EOS(STATIC_1115), i311, i288, i289) -> f1116_0_iter_ConstantStackPush(EOS(STATIC_1116), i311, i289, i288) :|: TRUE
f1116_0_iter_ConstantStackPush(EOS(STATIC_1116), i311, i289, i288) -> f1117_0_iter_InvokeMethod(EOS(STATIC_1117), i311, i289, i288, 1) :|: TRUE
f1117_0_iter_InvokeMethod(EOS(STATIC_1117), i311, i289, i288, matching1) -> f1118_0_add_Load(EOS(STATIC_1118), i311, i289, i288, 1) :|: TRUE && matching1 = 1
f1118_0_add_Load(EOS(STATIC_1118), i311, i289, i288, matching1) -> f1119_0_add_Load(EOS(STATIC_1119), i311, i289, 1, i288) :|: TRUE && matching1 = 1
f1119_0_add_Load(EOS(STATIC_1119), i311, i289, matching1, i288) -> f1120_0_add_IntArithmetic(EOS(STATIC_1120), i311, i289, i288, 1) :|: TRUE && matching1 = 1
f1120_0_add_IntArithmetic(EOS(STATIC_1120), i311, i289, i288, matching1) -> f1121_0_add_Return(EOS(STATIC_1121), i311, i289, i288 + 1) :|: TRUE && matching1 = 1
f1121_0_add_Return(EOS(STATIC_1121), i311, i289, i314) -> f1122_0_iter_Store(EOS(STATIC_1122), i311, i289, i314) :|: TRUE
f1122_0_iter_Store(EOS(STATIC_1122), i311, i289, i314) -> f1123_0_iter_Load(EOS(STATIC_1123), i311, i314, i289) :|: TRUE
f1123_0_iter_Load(EOS(STATIC_1123), i311, i314, i289) -> f1124_0_iter_ConstantStackPush(EOS(STATIC_1124), i311, i314, i289) :|: TRUE
f1124_0_iter_ConstantStackPush(EOS(STATIC_1124), i311, i314, i289) -> f1125_0_iter_IntArithmetic(EOS(STATIC_1125), i311, i314, i289, 1) :|: TRUE
f1125_0_iter_IntArithmetic(EOS(STATIC_1125), i311, i314, i289, matching1) -> f1126_0_iter_Store(EOS(STATIC_1126), i311, i314, i289 - 1) :|: TRUE && matching1 = 1
f1126_0_iter_Store(EOS(STATIC_1126), i311, i314, i316) -> f1127_0_iter_JMP(EOS(STATIC_1127), i311, i314, i316) :|: TRUE
f1127_0_iter_JMP(EOS(STATIC_1127), i311, i314, i316) -> f1128_0_iter_Load(EOS(STATIC_1128), i311, i314, i316) :|: TRUE
f1128_0_iter_Load(EOS(STATIC_1128), i311, i314, i316) -> f1041_0_iter_Load(EOS(STATIC_1041), i311, i314, i316) :|: TRUE
f1041_0_iter_Load(EOS(STATIC_1041), i287, i288, i289) -> f1046_0_iter_Load(EOS(STATIC_1046), i287, i288, i289, i287) :|: TRUE
f1092_0_iter_LE(EOS(STATIC_1092), i287, i288, i289, i288, i289) -> f1100_0_iter_Inc(EOS(STATIC_1100), i287, i288, i289) :|: i288 > i289
f1100_0_iter_Inc(EOS(STATIC_1100), i287, i288, i289) -> f1102_0_iter_Inc(EOS(STATIC_1102), i287 + 1, i288, i289) :|: TRUE
f1102_0_iter_Inc(EOS(STATIC_1102), i307, i288, i289) -> f1104_0_iter_JMP(EOS(STATIC_1104), i307, i288 + -2, i289) :|: TRUE
f1104_0_iter_JMP(EOS(STATIC_1104), i307, i308, i289) -> f1106_0_iter_Load(EOS(STATIC_1106), i307, i308, i289) :|: TRUE
f1106_0_iter_Load(EOS(STATIC_1106), i307, i308, i289) -> f1041_0_iter_Load(EOS(STATIC_1041), i307, i308, i289) :|: TRUE
f1074_0_iter_LE(EOS(STATIC_1074), i287, i288, i289, i287, i288) -> f1081_0_iter_Inc(EOS(STATIC_1081), i287, i288, i289) :|: i287 > i288
f1081_0_iter_Inc(EOS(STATIC_1081), i287, i288, i289) -> f1083_0_iter_JMP(EOS(STATIC_1083), i287 + -1, i288, i289) :|: TRUE
f1083_0_iter_JMP(EOS(STATIC_1083), i303, i288, i289) -> f1088_0_iter_Load(EOS(STATIC_1088), i303, i288, i289) :|: TRUE
f1088_0_iter_Load(EOS(STATIC_1088), i303, i288, i289) -> f1041_0_iter_Load(EOS(STATIC_1041), i303, i288, i289) :|: TRUE
Combined rules. Obtained 3 IRulesP rules:
f1046_0_iter_Load(EOS(STATIC_1046), i287:0, i288:0, i289:0, i287:0) -> f1046_0_iter_Load(EOS(STATIC_1046), i287:0 - 1, i288:0, i289:0, i287:0 - 1) :|: i287:0 + i288:0 + 3 * i289:0 >= 0 && i288:0 < i287:0
f1046_0_iter_Load(EOS(STATIC_1046), i287:0, i288:0, i289:0, i287:0) -> f1046_0_iter_Load(EOS(STATIC_1046), i287:0 + 1, i288:0 - 2, i289:0, i287:0 + 1) :|: i287:0 + i288:0 + 3 * i289:0 >= 0 && i288:0 >= i287:0 && i289:0 < i288:0
f1046_0_iter_Load(EOS(STATIC_1046), i287:0, i288:0, i289:0, i287:0) -> f1046_0_iter_Load(EOS(STATIC_1046), i287:0 + 1, i288:0 + 1, i289:0 - 1, i287:0 + 1) :|: i287:0 + i288:0 + 3 * i289:0 >= 0 && i288:0 >= i287:0 && i289:0 >= i288:0
Filtered constant ground arguments:
   f1046_0_iter_Load(x1, x2, x3, x4, x5) -> f1046_0_iter_Load(x2, x3, x4, x5)
   EOS(x1) -> EOS
Filtered duplicate arguments:
   f1046_0_iter_Load(x1, x2, x3, x4) -> f1046_0_iter_Load(x2, x3, x4)
Finished conversion. Obtained 3 rules.P rules:
f1046_0_iter_Load(i288:0, i289:0, i287:0) -> f1046_0_iter_Load(i288:0, i289:0, i287:0 - 1) :|: i287:0 + i288:0 + 3 * i289:0 >= 0 && i288:0 < i287:0
f1046_0_iter_Load(i288:0, i289:0, i287:0) -> f1046_0_iter_Load(i288:0 - 2, i289:0, i287:0 + 1) :|: i288:0 >= i287:0 && i289:0 < i288:0 && i287:0 + i288:0 + 3 * i289:0 >= 0
f1046_0_iter_Load(i288:0, i289:0, i287:0) -> f1046_0_iter_Load(i288:0 + 1, i289:0 - 1, i287:0 + 1) :|: i288:0 >= i287:0 && i289:0 >= i288:0 && i287:0 + i288:0 + 3 * i289:0 >= 0

----------------------------------------

(8)
Obligation:
Rules:
f1046_0_iter_Load(i288:0, i289:0, i287:0) -> f1046_0_iter_Load(i288:0, i289:0, i287:0 - 1) :|: i287:0 + i288:0 + 3 * i289:0 >= 0 && i288:0 < i287:0
f1046_0_iter_Load(x, x1, x2) -> f1046_0_iter_Load(x - 2, x1, x2 + 1) :|: x >= x2 && x1 < x && x2 + x + 3 * x1 >= 0
f1046_0_iter_Load(x3, x4, x5) -> f1046_0_iter_Load(x3 + 1, x4 - 1, x5 + 1) :|: x3 >= x5 && x4 >= x3 && x5 + x3 + 3 * x4 >= 0

----------------------------------------

(9) IRSFormatTransformerProof (EQUIVALENT)
Reformatted IRS to match normalized format (transformed away non-linear left-hand sides, !=, / and %).
----------------------------------------

(10)
Obligation:
Rules:
f1046_0_iter_Load(i288:0, i289:0, i287:0) -> f1046_0_iter_Load(i288:0, i289:0, arith) :|: i287:0 + i288:0 + 3 * i289:0 >= 0 && i288:0 < i287:0 && arith = i287:0 - 1
f1046_0_iter_Load(x6, x7, x8) -> f1046_0_iter_Load(x9, x7, x10) :|: x6 >= x8 && x7 < x6 && x8 + x6 + 3 * x7 >= 0 && x9 = x6 - 2 && x10 = x8 + 1
f1046_0_iter_Load(x11, x12, x13) -> f1046_0_iter_Load(x14, x15, x16) :|: x11 >= x13 && x12 >= x11 && x13 + x11 + 3 * x12 >= 0 && x14 = x11 + 1 && x15 = x12 - 1 && x16 = x13 + 1

----------------------------------------

(11) IRSwTTerminationDigraphProof (EQUIVALENT)
Constructed termination digraph!
Nodes:
(1) f1046_0_iter_Load(i288:0, i289:0, i287:0) -> f1046_0_iter_Load(i288:0, i289:0, arith) :|: i287:0 + i288:0 + 3 * i289:0 >= 0 && i288:0 < i287:0 && arith = i287:0 - 1
(2) f1046_0_iter_Load(x6, x7, x8) -> f1046_0_iter_Load(x9, x7, x10) :|: x6 >= x8 && x7 < x6 && x8 + x6 + 3 * x7 >= 0 && x9 = x6 - 2 && x10 = x8 + 1
(3) f1046_0_iter_Load(x11, x12, x13) -> f1046_0_iter_Load(x14, x15, x16) :|: x11 >= x13 && x12 >= x11 && x13 + x11 + 3 * x12 >= 0 && x14 = x11 + 1 && x15 = x12 - 1 && x16 = x13 + 1

Arcs:
(1) -> (1), (2), (3)
(2) -> (1), (2), (3)
(3) -> (2), (3)

This digraph is fully evaluated!
----------------------------------------

(12)
Obligation:

Termination digraph:
Nodes:
(1) f1046_0_iter_Load(i288:0, i289:0, i287:0) -> f1046_0_iter_Load(i288:0, i289:0, arith) :|: i287:0 + i288:0 + 3 * i289:0 >= 0 && i288:0 < i287:0 && arith = i287:0 - 1
(2) f1046_0_iter_Load(x6, x7, x8) -> f1046_0_iter_Load(x9, x7, x10) :|: x6 >= x8 && x7 < x6 && x8 + x6 + 3 * x7 >= 0 && x9 = x6 - 2 && x10 = x8 + 1
(3) f1046_0_iter_Load(x11, x12, x13) -> f1046_0_iter_Load(x14, x15, x16) :|: x11 >= x13 && x12 >= x11 && x13 + x11 + 3 * x12 >= 0 && x14 = x11 + 1 && x15 = x12 - 1 && x16 = x13 + 1

Arcs:
(1) -> (1), (2), (3)
(2) -> (1), (2), (3)
(3) -> (2), (3)

This digraph is fully evaluated!

----------------------------------------

(13) IntTRSCompressionProof (EQUIVALENT)
Compressed rules.
----------------------------------------

(14)
Obligation:
Rules:
f1046_0_iter_Load(x6:0, x7:0, x8:0) -> f1046_0_iter_Load(x6:0 - 2, x7:0, x8:0 + 1) :|: x8:0 <= x6:0 && x7:0 < x6:0 && x8:0 + x6:0 + 3 * x7:0 >= 0
f1046_0_iter_Load(x11:0, x12:0, x13:0) -> f1046_0_iter_Load(x11:0 + 1, x12:0 - 1, x13:0 + 1) :|: x13:0 <= x11:0 && x12:0 >= x11:0 && x13:0 + x11:0 + 3 * x12:0 >= 0
f1046_0_iter_Load(i288:0:0, i289:0:0, i287:0:0) -> f1046_0_iter_Load(i288:0:0, i289:0:0, i287:0:0 - 1) :|: i287:0:0 + i288:0:0 + 3 * i289:0:0 >= 0 && i288:0:0 < i287:0:0

----------------------------------------

(15) TempFilterProof (SOUND)
Used the following sort dictionary for filtering: 
f1046_0_iter_Load(INTEGER, INTEGER, INTEGER)
Replaced non-predefined constructor symbols by 0.
----------------------------------------

(16)
Obligation:
Rules:
f1046_0_iter_Load(x6:0, x7:0, x8:0) -> f1046_0_iter_Load(c, x7:0, c1) :|: c1 = x8:0 + 1 && c = x6:0 - 2 && (x8:0 <= x6:0 && x7:0 < x6:0 && x8:0 + x6:0 + 3 * x7:0 >= 0)
f1046_0_iter_Load(x11:0, x12:0, x13:0) -> f1046_0_iter_Load(c2, c3, c4) :|: c4 = x13:0 + 1 && (c3 = x12:0 - 1 && c2 = x11:0 + 1) && (x13:0 <= x11:0 && x12:0 >= x11:0 && x13:0 + x11:0 + 3 * x12:0 >= 0)
f1046_0_iter_Load(i288:0:0, i289:0:0, i287:0:0) -> f1046_0_iter_Load(i288:0:0, i289:0:0, c5) :|: c5 = i287:0:0 - 1 && (i287:0:0 + i288:0:0 + 3 * i289:0:0 >= 0 && i288:0:0 < i287:0:0)

----------------------------------------

(17) RankingReductionPairProof (EQUIVALENT)
Interpretation:
[ f1046_0_iter_Load ] = f1046_0_iter_Load_3 + f1046_0_iter_Load_1 + 3*f1046_0_iter_Load_2

The following rules are decreasing:
f1046_0_iter_Load(x6:0, x7:0, x8:0) -> f1046_0_iter_Load(c, x7:0, c1) :|: c1 = x8:0 + 1 && c = x6:0 - 2 && (x8:0 <= x6:0 && x7:0 < x6:0 && x8:0 + x6:0 + 3 * x7:0 >= 0)
f1046_0_iter_Load(x11:0, x12:0, x13:0) -> f1046_0_iter_Load(c2, c3, c4) :|: c4 = x13:0 + 1 && (c3 = x12:0 - 1 && c2 = x11:0 + 1) && (x13:0 <= x11:0 && x12:0 >= x11:0 && x13:0 + x11:0 + 3 * x12:0 >= 0)
f1046_0_iter_Load(i288:0:0, i289:0:0, i287:0:0) -> f1046_0_iter_Load(i288:0:0, i289:0:0, c5) :|: c5 = i287:0:0 - 1 && (i287:0:0 + i288:0:0 + 3 * i289:0:0 >= 0 && i288:0:0 < i287:0:0)

The following rules are bounded:
f1046_0_iter_Load(x6:0, x7:0, x8:0) -> f1046_0_iter_Load(c, x7:0, c1) :|: c1 = x8:0 + 1 && c = x6:0 - 2 && (x8:0 <= x6:0 && x7:0 < x6:0 && x8:0 + x6:0 + 3 * x7:0 >= 0)
f1046_0_iter_Load(x11:0, x12:0, x13:0) -> f1046_0_iter_Load(c2, c3, c4) :|: c4 = x13:0 + 1 && (c3 = x12:0 - 1 && c2 = x11:0 + 1) && (x13:0 <= x11:0 && x12:0 >= x11:0 && x13:0 + x11:0 + 3 * x12:0 >= 0)
f1046_0_iter_Load(i288:0:0, i289:0:0, i287:0:0) -> f1046_0_iter_Load(i288:0:0, i289:0:0, c5) :|: c5 = i287:0:0 - 1 && (i287:0:0 + i288:0:0 + 3 * i289:0:0 >= 0 && i288:0:0 < i287:0:0)


----------------------------------------

(18)
YES