Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571539
details
property
value
status
complete
benchmark
CyclicPair2.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n156.star.cs.uiowa.edu
space
AProVE_10_iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.9406068325 seconds
cpu usage
4.067798887
max memory
2.4815616E8
stage attributes
key
value
output-size
2945
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES 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 proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 141 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) TRUE ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class CyclicPair2 { CyclicPair2 next; public static void main(String[] args) { Random.args = args; CyclicPair2 one = new CyclicPair2(); CyclicPair2 two = new CyclicPair2(); int rand = Random.random(); if (rand != 0) { one.next = two; two.next = one; } else { one.next = two; } if (rand == 0) { one.run(); } } public void run() { CyclicPair2 current = this; while (current != null) current = current.next; } } public class Random { static String[] args; static int index = 0; public static int random() { String string = args[index]; index++; return string.length(); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class CyclicPair2 { CyclicPair2 next; public static void main(String[] args) { Random.args = args; CyclicPair2 one = new CyclicPair2(); CyclicPair2 two = new CyclicPair2(); int rand = Random.random(); if (rand != 0) { one.next = two; two.next = one; } else { one.next = two; } if (rand == 0) { one.run(); } } public void run() { CyclicPair2 current = this; while (current != null)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode