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


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


NO
proof of /export/starexec/sandbox2/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, 95 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 330 ms]
(4) JBCTerminationGraph
(5) JBCNonTerm [COMPLETE, 220 ms]
(6) NO


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

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

public class Main {

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

	}

}


package simple.upAndDownIneq;

public class UpAndDownIneq {
	
	public static void upAndDown(int i) {
		int up = 0;
		while (0 <= i && i <= 10) {
			if (i >= 10) {
				up = 0;
			}
			if (i <= 0) {
				up = 1;
			}
			if (up >= 1) {
				i++;
			} else {
				i--;
			}
		}
	}
	
}



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

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

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

public class Main {

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

	}

}


package simple.upAndDownIneq;

public class UpAndDownIneq {
	
	public static void upAndDown(int i) {
		int up = 0;
		while (0 <= i && i <= 10) {
			if (i >= 10) {
				up = 0;
			}
			if (i <= 0) {
				up = 1;
			}
			if (up >= 1) {
				i++;
			} else {
				i--;
			}
		}
	}
	
}



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

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

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





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

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

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

<simple.upAndDownIneq.UpAndDownIneq.upAndDown||2: push 0||i: i53, up: i54|| ->
[a14(lv_0_0)]
<simple.upAndDownIneq.Main.main||2: simple.upAndDownIneq.UpAndDownIneq.upAndDown|| - || ->
	i53: [0,+inf)(l2)
	i54: [0,1](1,1)
	i16: [0,+inf)(l1)
	a14([java.lang.String...]): length i16 -->{java.lang.Object...}
YES:  (JL1)


In the loop head node, references [i53, i54] 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_i53 and 0 <= initial_i54 and initial_i54 <= 1 and 0 <= initial_i16) and ((((path1_i53 = path1_i58 and path1_i58 = path1_i60 and path1_i60 = path1_i61 and path1_i63 = (path1_i61 + -1) and path1_i63 = res_i53 and 0 = res_i54 and path1_i53 = initial_i53 and path1_i54 = initial_i54) and (0 <= path1_i53 and T and 10 = 10 and path1_i58 <= 10 and T and 10 = 10 and path1_i60 < 10 and path1_i61 > 0 and path1_i54 = 0 and path1_i54 = 0 and 1 = 1)) or ((path2_i53 = path2_i58 and path2_i58 = path2_i60 and path2_i60 = path2_i61 and path2_i64 = (path2_i61 + 1) and path2_i64 = res_i53 and 1 = res_i54 and path2_i53 = initial_i53 and path2_i54 = initial_i54) and (0 <= path2_i53 and T and 10 = 10 and path2_i58 <= 10 and T and 10 = 10 and path2_i60 < 10 and path2_i61 > 0 and path2_i54 = 1 and path2_i54 = 1 and 1 = 1)) or ((path3_i53 = path3_i58 and 9 = res_i53 and 0 = res_i54 and path3_i53 = initial_i53 and path3_i54 = initial_i54) and (0 <= path3_i53 and T and 10 = 10 and path3_i58 <= 10 and path3_i58 = 10 and path3_i58 = 10 and 10 = 10 and 10 > 0)) or ((path4_i53 = path4_i58 and path4_i58 = path4_i60 and 1 = res_i53 and 1 = res_i54 and path4_i53 = initial_i53 and path4_i54 = initial_i54) and (0 <= path4_i53 and T and 10 = 10 and path4_i58 <= 10 and T and 10 = 10 and path4_i60 < 10 and path4_i60 = 0 and 0 <= 0))) and (((res1_i53 = res1_i58 and res1_i58 = res1_i60 and res1_i60 = res1_i61 and res1_i63 = (res1_i61 + -1) and res_i53 = res1_i53 and res_i54 = res1_i54) and !(0 <= res1_i53 and T and 10 = 10 and res1_i58 <= 10 and T and 10 = 10 and res1_i60 < 10 and res1_i61 > 0 and res1_i54 = 0 and res1_i54 = 0 and 1 = 1)) and ((res2_i53 = res2_i58 and res2_i58 = res2_i60 and res2_i60 = res2_i61 and res2_i64 = (res2_i61 + 1) and res_i53 = res2_i53 and res_i54 = res2_i54) and !(0 <= res2_i53 and T and 10 = 10 and res2_i58 <= 10 and T and 10 = 10 and res2_i60 < 10 and res2_i61 > 0 and res2_i54 = 1 and res2_i54 = 1 and 1 = 1)) and ((res3_i53 = res3_i58 and res_i53 = res3_i53 and res_i54 = res3_i54) and !(0 <= res3_i53 and T and 10 = 10 and res3_i58 <= 10 and res3_i58 = 10 and res3_i58 = 10 and 10 = 10 and 10 > 0)) and ((res4_i53 = res4_i58 and res4_i58 = res4_i60 and res_i53 = res4_i53 and res_i54 = res4_i54) and !(0 <= res4_i53 and T and 10 = 10 and res4_i58 <= 10 and T and 10 = 10 and res4_i60 < 10 and res4_i60 = 0 and 0 <= 0)))))

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

(6)
NO