Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919270
details
property
value
status
complete
benchmark
TreeLeftmostDepth.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n050.star.cs.uiowa.edu
space
AProVE_11_iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.44091796875 seconds
cpu usage
13.279477346
max memory
7.33913088E8
stage attributes
key
value
output-size
103562
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty termination of the given Bare JBC problem could be proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 97 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 1021 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToIRSProof [SOUND, 302 ms] (9) IRSwT (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (11) IRSwT (12) IRSwTTerminationDigraphProof [EQUIVALENT, 319 ms] (13) IRSwT (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] (15) IRSwT (16) TempFilterProof [SOUND, 82 ms] (17) IntTRS (18) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (19) YES (20) JBCTerminationSCC (21) SCCToQDPProof [SOUND, 256 ms] (22) QDP (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] (24) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: package TreeLeftmostDepth; public class Random { static String[] args; static int index = 0; public static int random() { String string = args[index]; index++; return string.length(); } } package TreeLeftmostDepth; public class Tree { Tree left; Tree right; Object value; public Tree(Tree l, Tree r) { this.left = l; this.right = r; } public Tree() { } public static Tree createNode() { Tree result = new Tree(); result.value = new Object(); return result; } public static Tree createTree() { int counter = Random.random(); if (counter == 0) { return null; } Tree result = createNode(); Tree t = result; while (counter > 0) { int branch = Random.random(); if (branch > 0) { if (t.left == null) { t.left = createNode(); t = result; } else { t = t.left; } } else { if (t.right == null) { t.right = createNode();
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199