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


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

(0)
Obligation:
need to prove termination of the following program:
public class TerminatorRec04 {
	public static void main(String[] args) {
		int x = args.length;
		while (x > 0) {
			f(x);
			x = x + 1;
		}
	}

	public static void f(int x) {
		if (x > 0) {
			f(x - 1);
		}
		return;
	}
}



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

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

(2)
Obligation:
need to prove termination of the following program:
public class TerminatorRec04 {
	public static void main(String[] args) {
		int x = args.length;
		while (x > 0) {
			f(x);
			x = x + 1;
		}
	}

	public static void f(int x) {
		if (x > 0) {
			f(x - 1);
		}
		return;
	}
}



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

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

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



TerminatorRec04.f(I)V: Graph of 16 nodes with 0 SCCs.





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

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

0:<TerminatorRec04.main||0: load ADDR args||args: a10|| ->
	a10([java.lang.String...]): length 1 -->{java.lang.Object...}
YES:  (JL1)
1:<TerminatorRec04.main||1: arraylength|| - ||a10>
	a10([java.lang.String...]): length 1 -->{java.lang.Object...}
YES:  (JL1)
2:<TerminatorRec04.main||2: store INT to x|| - ||1>
YES:  (JL1)
3:<TerminatorRec04.main||3: load INT x||x: 1|| ->
YES:  (JL1)
Start state of loop: 

[a4(lv_0_0)]
<TerminatorRec04.main||3: load INT x||x: i130|| ->
	i128: [0,+inf)(l1)
	a4([java.lang.String...]): length i128 -->{java.lang.Object...}
	i130: [0,+inf)(l1)
YES:  (JL1)


In the loop head node, references [i130] 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_i130 and 0 <= initial_i128) and (((path1_i130 = path1_i227 and path1_i227 = path1_i234 and path1_i349 = (path1_i234 + 1) and path1_i349 = res_i130 and path1_i130 = initial_i130) and path1_i227 > 0) and ((res1_i130 = res1_i227 and res1_i227 = res1_i234 and res1_i349 = (res1_i234 + 1) and res_i130 = res1_i130) and !res1_i227 > 0)))

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

(6)
NO