details

property	value
status	complete
benchmark	alternDiv_rec.jar
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n035.star.cs.uiowa.edu
space	Julia_12_recursive

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.18178009987 seconds
cpu usage	5.465000705
max memory	4.71810048E8

stage attributes

key	value
output-size	4535
starexec-result	NO

output

/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, 199 ms] (4) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class AlternDiv { public static void loop(int i) { if (i != 0) { if (i < 0) loop(-1 * (i - 1)); else loop(-1 * (i + 1)); } } public static void main(String args[]) { loop(args.length); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class AlternDiv { public static void loop(int i) { if (i != 0) { if (i < 0) loop(-1 * (i - 1)); else loop(-1 * (i + 1)); } } public static void main(String args[]) { loop(args.length); } } ---------------------------------------- (3) JBCNonTerm (COMPLETE) Reached a loop using the following run: 0:<AlternDiv.main||0: load ADDR #0||#0: a2|| -> a2([java.lang.String...]): length 1 -->{java.lang.Object...} YES: (JL1) 1:<AlternDiv.main||1: arraylength|| - ||a2> a2([java.lang.String...]): length 1 -->{java.lang.Object...} YES: (JL1) 2:<AlternDiv.main||2: AlternDiv.loop(I)V|| - ||1> YES: (JL1) 3:<AlternDiv.loop||0: load INT #0||#0: 1|| -> YES: (JL1) Start state of loop: [i20(lv_0_0)] <AlternDiv.loop||0: load INT #0||#0: i20|| -> i20: # YES: (JL1) In the loop head node, references [i20] 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 ((((path1_i20 = path1_i23 and path1_i23 = path1_i24 and path1_i28 = (path1_i24 - 1) and path1_i32 = (-1 * path1_i28) and path1_i32 = res_i20 and path1_i20 = initial_i20) and (path1_i23 != 0 and path1_i24 < 0)) or ((path2_i20 = path2_i23 and path2_i23 = path2_i25 and path2_i31 = (path2_i25 + 1) and path2_i33 = (-1 * path2_i31) and path2_i33 = res_i20 and path2_i20 = initial_i20) and (path2_i23 != 0 and path2_i25 >= 0)) or ((path1_i20 = path1_i23 and path1_i23 = path1_i24 and path1_i28 = (path1_i24 - 1) and path1_i32 = (-1 * path1_i28) and path1_i32 = res_i20 and path1_i20 = initial_i20) and (path1_i24 < 0 and path1_i23 < 0)) or ((path1_i20 = path1_i23 and path1_i23 = path1_i24 and path1_i28 = (path1_i24 - 1) and path1_i32 = (-1 * path1_i28) and path1_i32 = res_i20 and path1_i20 = initial_i20) and (path1_i24 < 0 and path1_i23 > 0)) or ((path2_i20 = path2_i23 and path2_i23 = path2_i25 and path2_i31 = (path2_i25 + 1) and path2_i33 = (-1 * path2_i31) and path2_i33 = res_i20 and path2_i20 = initial_i20) and (path2_i25 >= 0 and path2_i23 < 0)) or ((path2_i20 = path2_i23 and path2_i23 = path2_i25 and path2_i31 = (path2_i25 + 1) and path2_i33 = (-1 * path2_i31) and path2_i33 = res_i20 and path2_i20 = initial_i20) and (path2_i25 >= 0 and path2_i23 > 0))) and (((res1_i20 = res1_i23 and res1_i23 = res1_i24 and res1_i28 = (res1_i24 - 1) and res1_i32 = (-1 * res1_i28) and res_i20 = res1_i20) and !(res1_i23 != 0 and res1_i24 < 0)) and ((res2_i20 = res2_i23 and res2_i23 = res2_i25 and res2_i31 = (res2_i25 + 1) and res2_i33 = (-1 * res2_i31) and res_i20 = res2_i20) and !(res2_i23 != 0 and res2_i25 >= 0)) and ((res1_i20 = res1_i23 and res1_i23 = res1_i24 and res1_i28 = (res1_i24 - 1) and res1_i32 = (-1 * res1_i28) and res_i20 = res1_i20) and !(res1_i24 < 0 and res1_i23 < 0)) and ((res1_i20 = res1_i23 and res1_i23 = res1_i24 and res1_i28 = (res1_i24 - 1) and res1_i32 = (-1 * res1_i28) and res_i20 = res1_i20) and !(res1_i24 < 0 and res1_i23 > 0)) and ((res2_i20 = res2_i23 and res2_i23 = res2_i25 and res2_i31 = (res2_i25 + 1) and res2_i33 = (-1 * res2_i31) and res_i20 = res2_i20) and !(res2_i25 >= 0 and res2_i23 < 0)) and ((res2_i20 = res2_i23 and res2_i23 = res2_i25 and res2_i31 = (res2_i25 + 1) and res2_i33 = (-1 * res2_i31) and res_i20 = res2_i20) and !(res2_i25 >= 0 and res2_i23 > 0))))) to be UNSAT. Consequently, the loop will not terminate. ---------------------------------------- (4) NO popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Java Bytec 64199