/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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


termination of the given Bare JBC problem could be disproven:

(0) Bare JBC problem
(1) BareJBCToJBCProof [EQUIVALENT, 97 ms]
(2) JBC problem
(3) JBCNonTerm [COMPLETE, 273 ms]
(4) NO


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

(0)
Obligation:
need to prove termination of the following program:
public class WhileNested {

    public static void increase_aux(int j) {
	if (j > 0) increase_aux(j + 1);
    }

    public static void increase(int i) {
	if (i < 10) {
	    increase_aux(i);
	    increase(i + 1);
	}
    }

    public static void main(String[] args) {
	increase(args.length);
    }
}



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

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

(2)
Obligation:
need to prove termination of the following program:
public class WhileNested {

    public static void increase_aux(int j) {
	if (j > 0) increase_aux(j + 1);
    }

    public static void increase(int i) {
	if (i < 10) {
	    increase_aux(i);
	    increase(i + 1);
	}
    }

    public static void main(String[] args) {
	increase(args.length);
    }
}



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

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

0:<WhileNested.main||0: load ADDR #0||#0: a2|| ->
	a2([java.lang.String...]): length 1 -->{java.lang.Object...}
YES:  (JL1)
1:<WhileNested.main||1: arraylength|| - ||a2>
	a2([java.lang.String...]): length 1 -->{java.lang.Object...}
YES:  (JL1)
2:<WhileNested.main||2: WhileNested.increase(I)V|| - ||1>
YES:  (JL1)
3:<WhileNested.increase||0: load INT #0||#0: 1|| ->
YES:  (JL1)
4:<WhileNested.increase||1: push 10||#0: 1||1>
YES:  (JL1)
5:<WhileNested.increase||3: GE||#0: 1||1, 10>
YES:  (JL1)
6:<WhileNested.increase||6: load INT #0||#0: 1|| ->
YES:  (JL1)
7:<WhileNested.increase||7: WhileNested.increase_aux(I)V||#0: 1||1>
YES:  (JL1)
8:<WhileNested.increase_aux||0: load INT #0||#0: 1|| ->
YES:  (JL1)
Start state of loop: 

[i66(lv_0_0)]
<WhileNested.increase_aux||0: load INT #0||#0: i66|| ->
	i66: [0,+inf)(l3)
YES:  (JL1)


In the loop head node, references [i66] 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_i66 and (((path1_i66 = path1_i68 and path1_i69 = (path1_i68 + 1) and path1_i69 = res_i66 and path1_i66 = initial_i66) and path1_i68 > 0) and ((res1_i66 = res1_i68 and res1_i69 = (res1_i68 + 1) and res_i66 = res1_i66) and !res1_i68 > 0)))

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

(4)
NO