details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	5.06703 seconds
cpu usage	13.4294
user time	12.6875
system time	0.741941
max virtual memory	3.937772E7
max residence set size	1456368.0

stage attributes

key	value
starexec-result	NO

output

12.95/4.35 NO 13.09/4.42 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 13.09/4.42 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.09/4.42 13.09/4.42 13.09/4.42 termination of the given Bare JBC problem could be disproven: 13.09/4.42 13.09/4.42 (0) Bare JBC problem 13.09/4.42 (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] 13.09/4.42 (2) JBC problem 13.09/4.42 (3) JBCToGraph [EQUIVALENT, 310 ms] 13.09/4.42 (4) JBCTerminationGraph 13.09/4.42 (5) JBCNonTerm [COMPLETE, 3306 ms] 13.09/4.42 (6) NO 13.09/4.42 13.09/4.42 13.09/4.42 ---------------------------------------- 13.09/4.42 13.09/4.42 (0) 13.09/4.42 Obligation: 13.09/4.42 need to prove termination of the following program: 13.09/4.42 public class NO_05 { 13.09/4.42 public static void main(String args[]) { 13.09/4.42 for (int i = 0; i < 100; i++) { 13.09/4.42 if (i < 10) for (int j = 0; j < 15; j++); 13.09/4.42 else if (i < 50) continue; 13.09/4.42 else for (int j = 0; j < 15; j += 0); 13.09/4.42 } 13.09/4.42 } 13.09/4.42 } 13.09/4.42 13.09/4.42 13.09/4.42 ---------------------------------------- 13.09/4.42 13.09/4.42 (1) BareJBCToJBCProof (EQUIVALENT) 13.09/4.42 initialized classpath 13.09/4.42 ---------------------------------------- 13.09/4.42 13.09/4.42 (2) 13.09/4.42 Obligation: 13.09/4.42 need to prove termination of the following program: 13.09/4.42 public class NO_05 { 13.09/4.42 public static void main(String args[]) { 13.09/4.42 for (int i = 0; i < 100; i++) { 13.09/4.42 if (i < 10) for (int j = 0; j < 15; j++); 13.09/4.42 else if (i < 50) continue; 13.09/4.42 else for (int j = 0; j < 15; j += 0); 13.09/4.42 } 13.09/4.42 } 13.09/4.42 } 13.09/4.42 13.09/4.42 13.09/4.42 ---------------------------------------- 13.09/4.42 13.09/4.42 (3) JBCToGraph (EQUIVALENT) 13.09/4.42 Constructed TerminationGraph. 13.09/4.42 ---------------------------------------- 13.09/4.42 13.09/4.42 (4) 13.09/4.42 Obligation: 13.09/4.42 Termination Graph based on JBC Program: 13.09/4.42 NO_05.main([Ljava/lang/String;)V: Graph of 51 nodes with 2 SCCs. 13.09/4.42 13.09/4.42 13.09/4.42 13.09/4.42 13.09/4.42 13.09/4.42 ---------------------------------------- 13.09/4.42 13.09/4.42 (5) JBCNonTerm (COMPLETE) 13.09/4.42 Constructed a run with a repetition. States 1383 and 1388 are repetitions (when considering only the interesting positions []). 13.09/4.42 13.09/4.42 0:<NO_05.main||0: push 0|| - || -> 13.09/4.42 YES: (JL1) 13.09/4.42 1:<NO_05.main||1: store INT to #1|| - ||0> 13.09/4.42 YES: (JL1) 13.09/4.42 2:<NO_05.main||2: load INT #1||#1: 0|| -> 13.09/4.42 YES: (JL1) 13.09/4.42 3:<NO_05.main||3: push 100||#1: 0||0> 13.09/4.42 YES: (JL1) 13.09/4.42 4:<NO_05.main||5: GE||#1: 0||0, 100> 13.09/4.42 YES: (JL1) 13.09/4.42 5:<NO_05.main||8: load INT #1||#1: 0|| -> 13.09/4.42 YES: (JL1) 13.09/4.42 6:<NO_05.main||9: push 10||#1: 0||0> 13.09/4.42 YES: (JL1) 13.09/4.42 7:<NO_05.main||11: GE||#1: 0||0, 10> 13.09/4.42 YES: (JL1) 13.09/4.42 8:<NO_05.main||14: push 0||#1: 0|| -> 13.09/4.42 YES: (JL1) 13.09/4.42 9:<NO_05.main||15: store INT to #2||#1: 0||0> 13.09/4.42 YES: (JL1) 13.09/4.42 10:<NO_05.main||16: load INT #2||#1: 0, #2: 0|| -> 13.09/4.42 YES: (JL1) 13.09/4.42 11:<NO_05.main||17: push 15||#1: 0, #2: 0||0> 13.09/4.42 YES: (JL1) 13.09/4.42 12:<NO_05.main||19: GE||#1: 0, #2: 0||0, 15> 13.09/4.42 YES: (JL1) 13.09/4.42 13:<NO_05.main||22: increment #2 by 1||#1: 0, #2: 0|| -> 13.09/4.42 YES: (JL1) 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