Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode 2019-04-01 06.50 pair #433315543
details
property
value
status
complete
benchmark
NO_06.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n167.star.cs.uiowa.edu
space
Julia_11_iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.08312 seconds
cpu usage
4.4293
user time
4.21332
system time
0.215982
max virtual memory
1.8478228E7
max residence set size
332360.0
stage attributes
key
value
starexec-result
NO
output
4.28/2.03 NO 4.36/2.04 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 4.36/2.04 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 4.36/2.04 4.36/2.04 4.36/2.04 termination of the given Bare JBC problem could be disproven: 4.36/2.04 4.36/2.04 (0) Bare JBC problem 4.36/2.04 (1) BareJBCToJBCProof [EQUIVALENT, 95 ms] 4.36/2.04 (2) JBC problem 4.36/2.04 (3) JBCNonTerm [COMPLETE, 176 ms] 4.36/2.04 (4) NO 4.36/2.04 4.36/2.04 4.36/2.04 ---------------------------------------- 4.36/2.04 4.36/2.04 (0) 4.36/2.04 Obligation: 4.36/2.04 need to prove termination of the following program: 4.36/2.04 public class NO_06 { 4.36/2.04 public static void main(String args[]) { 4.36/2.04 for (int i = 0; i < 100; i++) { 4.36/2.04 if (i < 0) { 4.36/2.04 for (int j = 0; j < 15; j++); 4.36/2.04 break; 4.36/2.04 } 4.36/2.04 else for (int j = 0; j < 15; j += 0); 4.36/2.04 } 4.36/2.04 } 4.36/2.04 } 4.36/2.04 4.36/2.04 4.36/2.04 ---------------------------------------- 4.36/2.04 4.36/2.04 (1) BareJBCToJBCProof (EQUIVALENT) 4.36/2.04 initialized classpath 4.36/2.04 ---------------------------------------- 4.36/2.04 4.36/2.04 (2) 4.36/2.04 Obligation: 4.36/2.04 need to prove termination of the following program: 4.36/2.04 public class NO_06 { 4.36/2.04 public static void main(String args[]) { 4.36/2.04 for (int i = 0; i < 100; i++) { 4.36/2.04 if (i < 0) { 4.36/2.04 for (int j = 0; j < 15; j++); 4.36/2.04 break; 4.36/2.04 } 4.36/2.04 else for (int j = 0; j < 15; j += 0); 4.36/2.04 } 4.36/2.04 } 4.36/2.04 } 4.36/2.04 4.36/2.04 4.36/2.04 ---------------------------------------- 4.36/2.04 4.36/2.04 (3) JBCNonTerm (COMPLETE) 4.36/2.04 Constructed a run with a repetition. States 9 and 14 are repetitions (when considering only the interesting positions []). 4.36/2.04 4.36/2.04 0:<NO_06.main||0: push 0|| - || -> 4.36/2.04 YES: (JL1) 4.36/2.04 1:<NO_06.main||1: store INT to #1|| - ||0> 4.36/2.04 YES: (JL1) 4.36/2.04 2:<NO_06.main||2: load INT #1||#1: 0|| -> 4.36/2.04 YES: (JL1) 4.36/2.04 3:<NO_06.main||3: push 100||#1: 0||0> 4.36/2.04 YES: (JL1) 4.36/2.04 4:<NO_06.main||5: GE||#1: 0||0, 100> 4.36/2.04 YES: (JL1) 4.36/2.04 5:<NO_06.main||8: load INT #1||#1: 0|| -> 4.36/2.04 YES: (JL1) 4.36/2.04 6:<NO_06.main||9: GE 0||#1: 0||0> 4.36/2.04 YES: (JL1) 4.36/2.04 7:<NO_06.main||29: push 0||#1: 0|| -> 4.36/2.04 YES: (JL1) 4.36/2.04 8:<NO_06.main||30: store INT to #2||#1: 0||0> 4.36/2.04 YES: (JL1) 4.36/2.04 9:<NO_06.main||31: load INT #2||#1: 0, #2: 0|| -> 4.36/2.04 YES: (JL1) 4.36/2.04 10:<NO_06.main||32: push 15||#1: 0, #2: 0||0> 4.36/2.04 YES: (JL1) 4.36/2.04 11:<NO_06.main||34: GE||#1: 0, #2: 0||0, 15> 4.36/2.04 YES: (JL1) 4.36/2.04 12:<NO_06.main||37: increment #2 by 0||#1: 0, #2: 0|| -> 4.36/2.04 YES: (JL1) 4.36/2.04 13:<NO_06.main||40: jmp||#1: 0, #2: 0|| -> 4.36/2.04 YES: (JL1) 4.36/2.04 14:<NO_06.main||31: load INT #2||#1: 0, #2: 0|| -> 4.36/2.04 YES: (JL1) 4.36/2.04 4.36/2.04 ---------------------------------------- 4.36/2.04 4.36/2.04 (4) 4.36/2.04 NO 4.36/2.08 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