details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.43913 seconds
cpu usage	5.93748
user time	5.6236
system time	0.313887
max virtual memory	4.0840072E7
max residence set size	451448.0

stage attributes

key	value
starexec-result	NO

output

5.60/2.38 NO 5.60/2.41 proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar 5.60/2.41 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 5.60/2.41 5.60/2.41 5.60/2.41 termination of the given Bare JBC problem could be disproven: 5.60/2.41 5.60/2.41 (0) Bare JBC problem 5.60/2.41 (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] 5.60/2.41 (2) JBC problem 5.60/2.41 (3) JBCToGraph [EQUIVALENT, 338 ms] 5.60/2.41 (4) JBCTerminationGraph 5.60/2.41 (5) JBCNonTerm [COMPLETE, 108 ms] 5.60/2.41 (6) NO 5.60/2.41 5.60/2.41 5.60/2.41 ---------------------------------------- 5.60/2.41 5.60/2.41 (0) 5.60/2.41 Obligation: 5.60/2.41 need to prove termination of the following program: 5.60/2.41 public class NO_11 { 5.60/2.41 public static void main(String args[]) { 5.60/2.41 int j = 100; 5.60/2.41 for (int i = 0; i < j; i++) { 5.60/2.41 if (i < j - 2) continue; 5.60/2.41 if (i > j - 2) break; 5.60/2.41 j++; 5.60/2.41 } 5.60/2.41 } 5.60/2.41 } 5.60/2.41 5.60/2.41 5.60/2.41 ---------------------------------------- 5.60/2.41 5.60/2.41 (1) BareJBCToJBCProof (EQUIVALENT) 5.60/2.41 initialized classpath 5.60/2.41 ---------------------------------------- 5.60/2.41 5.60/2.41 (2) 5.60/2.41 Obligation: 5.60/2.41 need to prove termination of the following program: 5.60/2.41 public class NO_11 { 5.60/2.41 public static void main(String args[]) { 5.60/2.41 int j = 100; 5.60/2.41 for (int i = 0; i < j; i++) { 5.60/2.41 if (i < j - 2) continue; 5.60/2.41 if (i > j - 2) break; 5.60/2.41 j++; 5.60/2.41 } 5.60/2.41 } 5.60/2.41 } 5.60/2.41 5.60/2.41 5.60/2.41 ---------------------------------------- 5.60/2.41 5.60/2.41 (3) JBCToGraph (EQUIVALENT) 5.60/2.41 Constructed TerminationGraph. 5.60/2.41 ---------------------------------------- 5.60/2.41 5.60/2.41 (4) 5.60/2.41 Obligation: 5.60/2.41 Termination Graph based on JBC Program: 5.60/2.41 NO_11.main([Ljava/lang/String;)V: Graph of 41 nodes with 1 SCC. 5.60/2.41 5.60/2.41 5.60/2.41 5.60/2.41 5.60/2.41 5.60/2.41 ---------------------------------------- 5.60/2.41 5.60/2.41 (5) JBCNonTerm (COMPLETE) 5.60/2.41 Reached a loop using the following run: 5.60/2.41 5.60/2.41 0:<NO_11.main||0: push 100|| - || -> 5.60/2.41 YES: (JL1) 5.60/2.41 1:<NO_11.main||2: store INT to #1|| - ||100> 5.60/2.41 YES: (JL1) 5.60/2.41 2:<NO_11.main||3: push 0||#1: 100|| -> 5.60/2.41 YES: (JL1) 5.60/2.41 3:<NO_11.main||4: store INT to #2||#1: 100||0> 5.60/2.41 YES: (JL1) 5.60/2.41 4:<NO_11.main||5: load INT #2||#1: 100, #2: 0|| -> 5.60/2.41 YES: (JL1) 5.60/2.41 Start state of loop: 5.60/2.41 5.60/2.41 [o36(lv_0_0)] 5.60/2.41 <NO_11.main||5: load INT #2||#1: i35, #2: i36|| -> 5.60/2.41 o36([java.lang.String...]): Object() -->{java.lang.Object...} 5.60/2.41 i35: [100,+inf)(l3) 5.60/2.41 i36: # 5.60/2.41 YES: (JL1) 5.60/2.41 5.60/2.41 5.60/2.41 In the loop head node, references [i36, i35] were interesting. 5.60/2.41 5.60/2.41 All methods calls in the loop body are side-effect free, hence they can be ignored. 5.60/2.41 5.60/2.41 By SMT, we could prove 5.60/2.41 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