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


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


NO
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 disproven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 97 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 292 ms]
(4) JBCTerminationGraph
(5) JBCNonTerm [COMPLETE, 100 ms]
(6) NO


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

(0)
Obligation:
need to prove termination of the following program:
package simple.whileBreak;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		WhileBreak.loop(args.length);

	}

}


package simple.whileBreak;

public class WhileBreak {

	public static void loop(int i) {
		while (i > 10) {
			if (i > 20) {
				i++;
			} else {
				i--;
			}
			if (i == 30) {
				break;
			}
		}
	}
}



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

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

(2)
Obligation:
need to prove termination of the following program:
package simple.whileBreak;

public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		WhileBreak.loop(args.length);

	}

}


package simple.whileBreak;

public class WhileBreak {

	public static void loop(int i) {
		while (i > 10) {
			if (i > 20) {
				i++;
			} else {
				i--;
			}
			if (i == 30) {
				break;
			}
		}
	}
}



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

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

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





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

(5) JBCNonTerm (COMPLETE)
Reached a loop using the following run: 

0:<simple.whileBreak.Main.main||0: load ADDR args||args: a22|| ->
	a22([java.lang.String...]): length 30 -->{java.lang.Object...}
YES:  (JL1)
1:<simple.whileBreak.Main.main||1: arraylength|| - ||a22>
	a22([java.lang.String...]): length 30 -->{java.lang.Object...}
YES:  (JL1)
2:<simple.whileBreak.Main.main||2: simple.whileBreak.WhileBreak.loop(I)V|| - ||30>
YES:  (JL1)
3:<simple.whileBreak.WhileBreak.loop||0: load INT i||i: 30|| ->
<simple.whileBreak.Main.main||2: simple.whileBreak.WhileBreak.loop|| - || ->
YES:  (JL1)
Start state of loop: 

<simple.whileBreak.WhileBreak.loop||0: load INT i||i: i82|| ->
[a10(lv_0_0)]
<simple.whileBreak.Main.main||2: simple.whileBreak.WhileBreak.loop|| - || ->
	i82: [0,+inf)(l2)
	i83: [0,+inf)(l2)
	a10([java.lang.String...]): length i83 -->{java.lang.Object...}
YES:  (JL1)


In the loop head node, references [i82] were interesting.

All methods calls in the loop body are side-effect free, hence they can be ignored.

By SMT, we could prove

((0 <= initial_i82 and 0 <= initial_i83) and (((path3_i82 = path3_i89 and path3_i89 = path3_i91 and path3_i94 = (path3_i91 + 1) and path3_i94 = path3_i113 and path3_i113 = res_i82 and path3_i82 = initial_i82) and (T and 10 = 10 and path3_i89 > 10 and T and 20 = 20 and path3_i91 > 20 and T and 30 = 30 and path3_i113 > 30)) and ((res3_i82 = res3_i89 and res3_i89 = res3_i91 and res3_i94 = (res3_i91 + 1) and res3_i94 = res3_i113 and res_i82 = res3_i82) and !(T and 10 = 10 and res3_i89 > 10 and T and 20 = 20 and res3_i91 > 20 and T and 30 = 30 and res3_i113 > 30))))

to be UNSAT. Consequently, the loop will not terminate.
----------------------------------------

(6)
NO