/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, 509 ms]
(4) NO


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

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

    public static void loop(int i) {
	if (i > 10) {
	    if (i == 25) i = 30;
	    if (i <= 30) i--;
	    else i = 20;
	    loop(i);
	}
    }

    public static void main(String[] args) {
	loop(args.length + 20);
    }
}



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

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

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

    public static void loop(int i) {
	if (i > 10) {
	    if (i == 25) i = 30;
	    if (i <= 30) i--;
	    else i = 20;
	    loop(i);
	}
    }

    public static void main(String[] args) {
	loop(args.length + 20);
    }
}



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

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

0:<Sunset.main||0: load ADDR #0||#0: a2|| ->
	a2([java.lang.String...]): length 6 -->{java.lang.Object...}
YES:  (JL1)
1:<Sunset.main||1: arraylength|| - ||a2>
	a2([java.lang.String...]): length 6 -->{java.lang.Object...}
YES:  (JL1)
2:<Sunset.main||2: push 20|| - ||6>
YES:  (JL1)
3:<Sunset.main||4: ADD|| - ||6, 20>
YES:  (JL1)
4:<Sunset.main||5: Sunset.loop(I)V|| - ||26>
YES:  (JL1)
5:<Sunset.loop||0: load INT #0||#0: 26|| ->
YES:  (JL1)
Start state of loop: 

[i49(lv_0_0)]
<Sunset.loop||0: load INT #0||#0: i49|| ->
	i49: #\{0}
YES:  (JL1)


In the loop head node, references [i49] were interesting.

All methods calls in the loop body are side-effect free, hence they can be ignored.

By SMT, we could prove

(T and ((((path2_i49 = path2_i51 and path2_i51 = path2_i57 and path2_i57 = path2_i60 and path2_i65 = (path2_i60 + -1) and path2_i65 = res_i49 and path2_i49 = initial_i49) and (T and 10 = 10 and path2_i51 > 10 and T and 25 = 25 and path2_i57 > 25 and T and 30 = 30 and path2_i60 <= 30)) or ((path4_i49 = path4_i51 and 29 = res_i49 and path4_i49 = initial_i49) and (T and 10 = 10 and path4_i51 > 10 and path4_i51 = 25 and path4_i51 = 25 and 25 = 25))) and (((res2_i49 = res2_i51 and res2_i51 = res2_i57 and res2_i57 = res2_i60 and res2_i65 = (res2_i60 + -1) and res_i49 = res2_i49) and !(T and 10 = 10 and res2_i51 > 10 and T and 25 = 25 and res2_i57 > 25 and T and 30 = 30 and res2_i60 <= 30)) and ((res4_i49 = res4_i51 and res_i49 = res4_i49) and !(T and 10 = 10 and res4_i51 > 10 and res4_i51 = 25 and res4_i51 = 25 and 25 = 25)))))

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

(4)
NO