/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, 96 ms]
(2) JBC problem
(3) JBCToGraph [EQUIVALENT, 177 ms]
(4) JBCTerminationGraph
(5) JBCNonTerm [COMPLETE, 80 ms]
(6) NO


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

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

public class Main {

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

	}

}


package simple.whileIncr;

public class WhileIncr {

	public static void increase(int i) {
		while (i > 0) {
			i++;
		}
	}
}



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

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

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

public class Main {

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

	}

}


package simple.whileIncr;

public class WhileIncr {

	public static void increase(int i) {
		while (i > 0) {
			i++;
		}
	}
}



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

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

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





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

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

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

<simple.whileIncr.WhileIncr.increase||0: load INT i||i: i17|| ->
[a4(lv_0_0)]
<simple.whileIncr.Main.main||2: simple.whileIncr.WhileIncr.increase|| - || ->
	i17: [0,+inf)(l1)
	i18: [0,+inf)(l1)
	a4([java.lang.String...]): length i18 -->{java.lang.Object...}
YES:  (JL1)


In the loop head node, references [i17] 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_i17 and 0 <= initial_i18) and (((path1_i17 = path1_i132 and path1_i139 = (path1_i132 + 1) and path1_i139 = res_i17 and path1_i17 = initial_i17) and path1_i132 > 0) and ((res1_i17 = res1_i132 and res1_i139 = (res1_i132 + 1) and res_i17 = res1_i17) and !res1_i132 > 0)))

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

(6)
NO