/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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


termination of the given Bare JBC problem could be disproven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 377 ms]
(4) JBCTerminationGraph
(5) JBCNonTerm [COMPLETE, 461 ms]
(6) NO


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

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

public class AlternDivWidening {

	public static void loop(int i) {
		int w = 5;
		while (i != 0) {
			if (i < -w) {
				i--;
				i = i*(-1);
			} else {
				if (i > w) {
					i++;
					i = i*(-1);
				} else {
					i = 0;
				}
			}
			w++;
		}
	}
}


package simple.alternDivWidening;

public class Main {

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

	}

}



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

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

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

public class AlternDivWidening {

	public static void loop(int i) {
		int w = 5;
		while (i != 0) {
			if (i < -w) {
				i--;
				i = i*(-1);
			} else {
				if (i > w) {
					i++;
					i = i*(-1);
				} else {
					i = 0;
				}
			}
			w++;
		}
	}
}


package simple.alternDivWidening;

public class Main {

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

	}

}



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

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

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





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

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

0:<simple.alternDivWidening.Main.main||0: load ADDR args||args: a34|| ->
	a34([java.lang.String...]): length 6 -->{java.lang.Object...}
YES:  (JL1)
1:<simple.alternDivWidening.Main.main||1: arraylength|| - ||a34>
	a34([java.lang.String...]): length 6 -->{java.lang.Object...}
YES:  (JL1)
2:<simple.alternDivWidening.Main.main||2: simple.alternDivWidening.AlternDivWidening.loop(I)V|| - ||6>
YES:  (JL1)
3:<simple.alternDivWidening.AlternDivWidening.loop||0: push 5||i: 6|| ->
<simple.alternDivWidening.Main.main||2: simple.alternDivWidening.AlternDivWidening.loop|| - || ->
YES:  (JL1)
4:<simple.alternDivWidening.AlternDivWidening.loop||1: store INT to w||i: 6||5>
<simple.alternDivWidening.Main.main||2: simple.alternDivWidening.AlternDivWidening.loop|| - || ->
YES:  (JL1)
5:<simple.alternDivWidening.AlternDivWidening.loop||2: load INT i||i: 6, w: 5|| ->
<simple.alternDivWidening.Main.main||2: simple.alternDivWidening.AlternDivWidening.loop|| - || ->
YES:  (JL1)
Start state of loop: 

<simple.alternDivWidening.AlternDivWidening.loop||2: load INT i||i: i212, w: i213|| ->
[a14(lv_0_0)]
<simple.alternDivWidening.Main.main||2: simple.alternDivWidening.AlternDivWidening.loop|| - || ->
	i212: #
	i213: [5,+inf)(l5)
	i178: [0,+inf)(l4)
	a14([java.lang.String...]): length i178 -->{java.lang.Object...}
YES:  (JL1)


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

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

By SMT, we could prove

((5 <= initial_i213 and 0 <= initial_i178) and ((((path1_i212 = path1_i222 and path1_i223 = (-1 * path1_i213) and path1_i228 = (path1_i222 + -1) and path1_i232 = (path1_i228 * -1) and path1_i238 = (path1_i213 + 1) and path1_i232 = res_i212 and path1_i238 = res_i213 and path1_i212 = initial_i212 and path1_i213 = initial_i213) and (path1_i222 != 0 and path1_i222 < path1_i223 and path1_i222 < path1_i223)) or ((path3_i212 = path3_i222 and path3_i223 = (-1 * path3_i213) and path3_i234 = (path3_i222 + 1) and path3_i239 = (path3_i234 * -1) and path3_i244 = (path3_i213 + 1) and path3_i239 = res_i212 and path3_i244 = res_i213 and path3_i212 = initial_i212 and path3_i213 = initial_i213) and (path3_i222 != 0 and path3_i222 >= path3_i223 and path3_i222 >= path3_i223 and path3_i222 > path3_i213 and path3_i222 > path3_i213)) or ((path1_i212 = path1_i222 and path1_i223 = (-1 * path1_i213) and path1_i228 = (path1_i222 + -1) and path1_i232 = (path1_i228 * -1) and path1_i238 = (path1_i213 + 1) and path1_i232 = res_i212 and path1_i238 = res_i213 and path1_i212 = initial_i212 and path1_i213 = initial_i213) and (path1_i222 < path1_i223 and path1_i222 < path1_i223 and path1_i222 < 0)) or ((path1_i212 = path1_i222 and path1_i223 = (-1 * path1_i213) and path1_i228 = (path1_i222 + -1) and path1_i232 = (path1_i228 * -1) and path1_i238 = (path1_i213 + 1) and path1_i232 = res_i212 and path1_i238 = res_i213 and path1_i212 = initial_i212 and path1_i213 = initial_i213) and (path1_i222 < path1_i223 and path1_i222 < path1_i223 and path1_i222 > 0))) and (((res1_i212 = res1_i222 and res1_i223 = (-1 * res1_i213) and res1_i228 = (res1_i222 + -1) and res1_i232 = (res1_i228 * -1) and res1_i238 = (res1_i213 + 1) and res_i212 = res1_i212 and res_i213 = res1_i213) and !(res1_i222 != 0 and res1_i222 < res1_i223 and res1_i222 < res1_i223)) and ((res3_i212 = res3_i222 and res3_i223 = (-1 * res3_i213) and res3_i234 = (res3_i222 + 1) and res3_i239 = (res3_i234 * -1) and res3_i244 = (res3_i213 + 1) and res_i212 = res3_i212 and res_i213 = res3_i213) and !(res3_i222 != 0 and res3_i222 >= res3_i223 and res3_i222 >= res3_i223 and res3_i222 > res3_i213 and res3_i222 > res3_i213)) and ((res1_i212 = res1_i222 and res1_i223 = (-1 * res1_i213) and res1_i228 = (res1_i222 + -1) and res1_i232 = (res1_i228 * -1) and res1_i238 = (res1_i213 + 1) and res_i212 = res1_i212 and res_i213 = res1_i213) and !(res1_i222 < res1_i223 and res1_i222 < res1_i223 and res1_i222 < 0)) and ((res1_i212 = res1_i222 and res1_i223 = (-1 * res1_i213) and res1_i228 = (res1_i222 + -1) and res1_i232 = (res1_i228 * -1) and res1_i238 = (res1_i213 + 1) and res_i212 = res1_i212 and res_i213 = res1_i213) and !(res1_i222 < res1_i223 and res1_i222 < res1_i223 and res1_i222 > 0)))))

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

(6)
NO