Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571558
details
property
value
status
complete
benchmark
NO_01.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.43369007111 seconds
cpu usage
5.263596746
max memory
3.63618304E8
stage attributes
key
value
output-size
2777
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox/benchmark/theBenchmark.jar # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 192 ms] (4) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class NO_01 { public static void main(String args[]) { int c = 24*60*60/100; if (c <= 10) for (int i = 0; i < 100; i++); else { if (c <= 50) for (int i = 0; i < 101; i++); if (c <= 100) for (int i = 0; i < 102; i++); else for (int i = 0; i < 103; i += 0); } } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class NO_01 { public static void main(String args[]) { int c = 24*60*60/100; if (c <= 10) for (int i = 0; i < 100; i++); else { if (c <= 50) for (int i = 0; i < 101; i++); if (c <= 100) for (int i = 0; i < 102; i++); else for (int i = 0; i < 103; i += 0); } } } ---------------------------------------- (3) JBCNonTerm (COMPLETE) Constructed a run with a repetition. States 13 and 18 are repetitions (when considering only the interesting positions []). 0:<NO_01.main||0: push 864|| - || -> YES: (JL1) 1:<NO_01.main||3: store INT to #1|| - ||864> YES: (JL1) 2:<NO_01.main||4: load INT #1||#1: 864|| -> YES: (JL1) 3:<NO_01.main||5: push 10||#1: 864||864> YES: (JL1) 4:<NO_01.main||7: GT||#1: 864||864, 10> YES: (JL1) 5:<NO_01.main||27: load INT #1||#1: 864|| -> YES: (JL1) 6:<NO_01.main||28: push 50||#1: 864||864> YES: (JL1) 7:<NO_01.main||30: GT||#1: 864||864, 50> YES: (JL1) 8:<NO_01.main||47: load INT #1||#1: 864|| -> YES: (JL1) 9:<NO_01.main||48: push 100|| - ||864> YES: (JL1) 10:<NO_01.main||50: GT|| - ||864, 100> YES: (JL1) 11:<NO_01.main||70: push 0|| - || -> YES: (JL1) 12:<NO_01.main||71: store INT to #2|| - ||0> YES: (JL1) 13:<NO_01.main||72: load INT #2||#2: 0|| -> YES: (JL1) 14:<NO_01.main||73: push 103||#2: 0||0> YES: (JL1) 15:<NO_01.main||75: GE||#2: 0||0, 103> YES: (JL1) 16:<NO_01.main||78: increment #2 by 0||#2: 0|| ->
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode