/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) JBCNonTerm [COMPLETE, 480 ms]
(4) NO


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

(0)
Obligation:
need to prove termination of the following program:
public class UpAndDownIneq {
	
    public static void upAndDown(int i, int up) {
	while (0 <= i && i <= 10) {
	    if (i >= 10) up = 0;
	    if (i <= 0) up = 1;
	    if (up >= 1) i++;
	    else i--;
	    upAndDown(i, up);
	}
    }

    public static void main(String[] args) {
	upAndDown(args.length, 0);
    }
}



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

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

(2)
Obligation:
need to prove termination of the following program:
public class UpAndDownIneq {
	
    public static void upAndDown(int i, int up) {
	while (0 <= i && i <= 10) {
	    if (i >= 10) up = 0;
	    if (i <= 0) up = 1;
	    if (up >= 1) i++;
	    else i--;
	    upAndDown(i, up);
	}
    }

    public static void main(String[] args) {
	upAndDown(args.length, 0);
    }
}



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

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

0:<UpAndDownIneq.main||0: load ADDR #0||#0: a2|| ->
	a2([java.lang.String...]): length 1 -->{java.lang.Object...}
YES:  (JL1)
1:<UpAndDownIneq.main||1: arraylength|| - ||a2>
	a2([java.lang.String...]): length 1 -->{java.lang.Object...}
YES:  (JL1)
2:<UpAndDownIneq.main||2: push 0|| - ||1>
YES:  (JL1)
3:<UpAndDownIneq.main||3: UpAndDownIneq.upAndDown(II)V|| - ||1, 0>
YES:  (JL1)
4:<UpAndDownIneq.upAndDown||0: push 0||#0: 1, #1: 0|| ->
YES:  (JL1)
Start state of loop: 

[i41(lv_0_0), i42(lv_0_1)]
<UpAndDownIneq.upAndDown||0: push 0||#0: i41, #1: i43|| ->
	i41: [0,+inf)(l1)
	i42: [0,1](1,1)
	i43: [0,1](1,1)
YES:  (JL1)


In the loop head node, references [i41, i42, i43] 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_i41 and 0 <= initial_i42 and initial_i42 <= 1 and 0 <= initial_i43 and initial_i43 <= 1) and ((((path1_i41 = path1_i44 and path1_i44 = path1_i50 and path1_i50 = path1_i52 and path1_i53 = (path1_i52 + -1) and path1_i53 = res_i41 and 0 = res_i42 and 0 = res_i43 and path1_i41 = initial_i41 and path1_i42 = initial_i42 and path1_i43 = initial_i43) and (0 <= path1_i41 and T and 10 = 10 and path1_i44 <= 10 and T and 10 = 10 and path1_i50 < 10 and path1_i52 > 0 and path1_i43 = 0 and path1_i43 = 0 and 1 = 1)) or ((path2_i41 = path2_i44 and 9 = res_i41 and 0 = res_i42 and 0 = res_i43 and path2_i41 = initial_i41 and path2_i42 = initial_i42 and path2_i43 = initial_i43) and (0 <= path2_i41 and T and 10 = 10 and path2_i44 <= 10 and path2_i44 = 10 and path2_i44 = 10 and 10 = 10 and 10 > 0)) or ((path3_i41 = path3_i44 and path3_i44 = path3_i50 and path3_i50 = path3_i52 and path3_i54 = (path3_i52 + 1) and path3_i54 = res_i41 and 1 = res_i42 and 1 = res_i43 and path3_i41 = initial_i41 and path3_i42 = initial_i42 and path3_i43 = initial_i43) and (0 <= path3_i41 and T and 10 = 10 and path3_i44 <= 10 and T and 10 = 10 and path3_i50 < 10 and path3_i52 > 0 and path3_i43 = 1 and path3_i43 = 1 and 1 = 1)) or ((path4_i41 = path4_i44 and path4_i44 = path4_i50 and 1 = res_i41 and 1 = res_i42 and 1 = res_i43 and path4_i41 = initial_i41 and path4_i42 = initial_i42 and path4_i43 = initial_i43) and (0 <= path4_i41 and T and 10 = 10 and path4_i44 <= 10 and T and 10 = 10 and path4_i50 < 10 and path4_i50 = 0 and 0 <= 0))) and (((res1_i41 = res1_i44 and res1_i44 = res1_i50 and res1_i50 = res1_i52 and res1_i53 = (res1_i52 + -1) and res_i41 = res1_i41 and res_i42 = res1_i42 and res_i43 = res1_i43) and !(0 <= res1_i41 and T and 10 = 10 and res1_i44 <= 10 and T and 10 = 10 and res1_i50 < 10 and res1_i52 > 0 and res1_i43 = 0 and res1_i43 = 0 and 1 = 1)) and ((res2_i41 = res2_i44 and res_i41 = res2_i41 and res_i42 = res2_i42 and res_i43 = res2_i43) and !(0 <= res2_i41 and T and 10 = 10 and res2_i44 <= 10 and res2_i44 = 10 and res2_i44 = 10 and 10 = 10 and 10 > 0)) and ((res3_i41 = res3_i44 and res3_i44 = res3_i50 and res3_i50 = res3_i52 and res3_i54 = (res3_i52 + 1) and res_i41 = res3_i41 and res_i42 = res3_i42 and res_i43 = res3_i43) and !(0 <= res3_i41 and T and 10 = 10 and res3_i44 <= 10 and T and 10 = 10 and res3_i50 < 10 and res3_i52 > 0 and res3_i43 = 1 and res3_i43 = 1 and 1 = 1)) and ((res4_i41 = res4_i44 and res4_i44 = res4_i50 and res_i41 = res4_i41 and res_i42 = res4_i42 and res_i43 = res4_i43) and !(0 <= res4_i41 and T and 10 = 10 and res4_i44 <= 10 and T and 10 = 10 and res4_i50 < 10 and res4_i50 = 0 and 0 <= 0)))))

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

(4)
NO