details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.23633 seconds
cpu usage	4.87943
user time	4.6312
system time	0.248234
max virtual memory	1.8478228E7
max residence set size	359052.0

stage attributes

key	value
starexec-result	NO

output

4.74/2.19 NO 4.84/2.20 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 4.84/2.20 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.84/2.20 4.84/2.20 4.84/2.20 termination of the given Bare JBC problem could be disproven: 4.84/2.20 4.84/2.20 (0) Bare JBC problem 4.84/2.20 (1) BareJBCToJBCProof [EQUIVALENT, 95 ms] 4.84/2.20 (2) JBC problem 4.84/2.20 (3) JBCNonTerm [COMPLETE, 247 ms] 4.84/2.20 (4) NO 4.84/2.20 4.84/2.20 4.84/2.20 ---------------------------------------- 4.84/2.20 4.84/2.20 (0) 4.84/2.20 Obligation: 4.84/2.20 need to prove termination of the following program: 4.84/2.20 public class NO_10 { 4.84/2.20 public static void main(String args[]) { 4.84/2.20 int j = 100; 4.84/2.20 for (int i = 0; i < j; i++) j++; 4.84/2.20 } 4.84/2.20 } 4.84/2.20 4.84/2.20 4.84/2.20 ---------------------------------------- 4.84/2.20 4.84/2.20 (1) BareJBCToJBCProof (EQUIVALENT) 4.84/2.20 initialized classpath 4.84/2.20 ---------------------------------------- 4.84/2.20 4.84/2.20 (2) 4.84/2.20 Obligation: 4.84/2.20 need to prove termination of the following program: 4.84/2.20 public class NO_10 { 4.84/2.20 public static void main(String args[]) { 4.84/2.20 int j = 100; 4.84/2.20 for (int i = 0; i < j; i++) j++; 4.84/2.20 } 4.84/2.20 } 4.84/2.20 4.84/2.20 4.84/2.20 ---------------------------------------- 4.84/2.20 4.84/2.20 (3) JBCNonTerm (COMPLETE) 4.84/2.20 Reached a loop using the following run: 4.84/2.20 4.84/2.20 0:<NO_10.main||0: push 100|| - || -> 4.84/2.20 YES: (JL1) 4.84/2.20 1:<NO_10.main||2: store INT to #1|| - ||100> 4.84/2.20 YES: (JL1) 4.84/2.20 2:<NO_10.main||3: push 0||#1: 100|| -> 4.84/2.20 YES: (JL1) 4.84/2.20 3:<NO_10.main||4: store INT to #2||#1: 100||0> 4.84/2.20 YES: (JL1) 4.84/2.20 4:<NO_10.main||5: load INT #2||#1: 100, #2: 0|| -> 4.84/2.20 YES: (JL1) 4.84/2.20 Start state of loop: 4.84/2.20 4.84/2.20 [o16(lv_0_0)] 4.84/2.20 <NO_10.main||5: load INT #2||#1: i21, #2: i22|| -> 4.84/2.20 o16([java.lang.String...]): Object() -->{java.lang.Object...} 4.84/2.20 i21: [100,+inf)(l4) 4.84/2.20 i22: [0,+inf)(l4) 4.84/2.20 YES: (JL1) 4.84/2.20 4.84/2.20 4.84/2.20 In the loop head node, references [i22, i21] were interesting. 4.84/2.20 4.84/2.20 All methods calls in the loop body are side-effect free, hence they can be ignored. 4.84/2.20 4.84/2.20 By SMT, we could prove 4.84/2.20 4.84/2.20 ((100 <= initial_i21 and 0 <= initial_i22) and (((path1_i27 = (path1_i21 + 1) and path1_i28 = (path1_i22 + 1) and path1_i27 = res_i21 and path1_i28 = res_i22 and path1_i21 = initial_i21 and path1_i22 = initial_i22) and (path1_i22 < path1_i21 and path1_i22 < path1_i21)) and ((res1_i27 = (res1_i21 + 1) and res1_i28 = (res1_i22 + 1) and res_i21 = res1_i21 and res_i22 = res1_i22) and !(res1_i22 < res1_i21 and res1_i22 < res1_i21)))) 4.84/2.20 4.84/2.20 to be UNSAT. Consequently, the loop will not terminate. 4.84/2.20 ---------------------------------------- 4.84/2.20 4.84/2.20 (4) 4.84/2.20 NO 4.86/2.23 EOF popout

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

job log

popout

actions

all output return to Java_Bytecode 2019-04-01 06.50