/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, 332 ms]
(4) JBCTerminationGraph
(5) JBCNonTerm [COMPLETE, 474 ms]
(6) NO


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

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

public class AlternDivWide {

	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;
				}
			}
		}
	}
}


package simple.alternDivWide;

public class Main {

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

	}

}



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

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

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

public class AlternDivWide {

	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;
				}
			}
		}
	}
}


package simple.alternDivWide;

public class Main {

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

	}

}



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

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

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





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

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

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

<simple.alternDivWide.AlternDivWide.loop||2: load INT i||i: i138, w: iconst_5|| ->
[a11(lv_0_0)]
<simple.alternDivWide.Main.main||2: simple.alternDivWide.AlternDivWide.loop|| - || ->
	i138: #
	i102: [0,+inf)(l2)
	a11([java.lang.String...]): length i102 -->{java.lang.Object...}
YES:  (JL1)


In the loop head node, references [i138, iconst_5] 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_i102 and ((((path1_i138 = path1_i146 and -5 = (-1 * 5) and path1_i146 = path1_i149 and path1_i153 = (path1_i149 + -1) and path1_i158 = (path1_i153 * -1) and path1_i158 = res_i138 and path1_i138 = initial_i138) and (path1_i146 != 0 and T and -5 = -5 and path1_i149 < -5)) or ((path3_i138 = path3_i146 and -5 = (-1 * 5) and path3_i146 = path3_i150 and path3_i150 = path3_i157 and path3_i161 = (path3_i157 + 1) and path3_i168 = (path3_i161 * -1) and path3_i168 = res_i138 and path3_i138 = initial_i138) and (path3_i146 != 0 and T and -5 = -5 and path3_i150 >= -5 and T and 5 = 5 and path3_i157 > 5)) or ((path1_i138 = path1_i146 and -5 = (-1 * 5) and path1_i146 = path1_i149 and path1_i153 = (path1_i149 + -1) and path1_i158 = (path1_i153 * -1) and path1_i158 = res_i138 and path1_i138 = initial_i138) and (T and -5 = -5 and path1_i149 < -5 and path1_i146 < 0)) or ((path1_i138 = path1_i146 and -5 = (-1 * 5) and path1_i146 = path1_i149 and path1_i153 = (path1_i149 + -1) and path1_i158 = (path1_i153 * -1) and path1_i158 = res_i138 and path1_i138 = initial_i138) and (T and -5 = -5 and path1_i149 < -5 and path1_i146 > 0))) and (((res1_i138 = res1_i146 and -5 = (-1 * 5) and res1_i146 = res1_i149 and res1_i153 = (res1_i149 + -1) and res1_i158 = (res1_i153 * -1) and res_i138 = res1_i138) and !(res1_i146 != 0 and T and -5 = -5 and res1_i149 < -5)) and ((res3_i138 = res3_i146 and -5 = (-1 * 5) and res3_i146 = res3_i150 and res3_i150 = res3_i157 and res3_i161 = (res3_i157 + 1) and res3_i168 = (res3_i161 * -1) and res_i138 = res3_i138) and !(res3_i146 != 0 and T and -5 = -5 and res3_i150 >= -5 and T and 5 = 5 and res3_i157 > 5)) and ((res1_i138 = res1_i146 and -5 = (-1 * 5) and res1_i146 = res1_i149 and res1_i153 = (res1_i149 + -1) and res1_i158 = (res1_i153 * -1) and res_i138 = res1_i138) and !(T and -5 = -5 and res1_i149 < -5 and res1_i146 < 0)) and ((res1_i138 = res1_i146 and -5 = (-1 * 5) and res1_i146 = res1_i149 and res1_i153 = (res1_i149 + -1) and res1_i158 = (res1_i153 * -1) and res_i138 = res1_i138) and !(T and -5 = -5 and res1_i149 < -5 and res1_i146 > 0)))))

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

(6)
NO