/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, 96 ms]
(2) JBC problem
(3) JBCNonTerm [COMPLETE, 176 ms]
(4) NO


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

(0)
Obligation:
need to prove termination of the following program:
public class NO_21 {
    public static void main(String args[]) {
	int i = 0;
	while (i < 100) {
	    i++;
	    i--;
	}
    }
}



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

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

(2)
Obligation:
need to prove termination of the following program:
public class NO_21 {
    public static void main(String args[]) {
	int i = 0;
	while (i < 100) {
	    i++;
	    i--;
	}
    }
}



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

(3) JBCNonTerm (COMPLETE)
Constructed a run with a repetition. States 2 and 8 are repetitions (when considering only the interesting positions []).

0:<NO_21.main||0: push 0|| - || ->
YES:  (JL1)
1:<NO_21.main||1: store INT to #1|| - ||0>
YES:  (JL1)
2:<NO_21.main||2: load INT #1||#1: 0|| ->
YES:  (JL1)
3:<NO_21.main||3: push 100||#1: 0||0>
YES:  (JL1)
4:<NO_21.main||5: GE||#1: 0||0, 100>
YES:  (JL1)
5:<NO_21.main||8: increment #1 by 1||#1: 0|| ->
YES:  (JL1)
6:<NO_21.main||11: increment #1 by -1||#1: 1|| ->
YES:  (JL1)
7:<NO_21.main||14: jmp||#1: 0|| ->
YES:  (JL1)
8:<NO_21.main||2: load INT #1||#1: 0|| ->
YES:  (JL1)

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

(4)
NO