Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571393
details
property
value
status
complete
benchmark
FlattenTree.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n154.star.cs.uiowa.edu
space
Aprove_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.59562492371 seconds
cpu usage
13.057372715
max memory
1.003003904E9
stage attributes
key
value
output-size
93108
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/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, 1140 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 277 ms] (9) QDP (10) UsableRulesReductionPairsProof [EQUIVALENT, 45 ms] (11) QDP (12) PisEmptyProof [EQUIVALENT, 0 ms] (13) YES (14) JBCTerminationSCC (15) SCCToIRSProof [SOUND, 278 ms] (16) IRSwT (17) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (18) IRSwT (19) IRSwTTerminationDigraphProof [EQUIVALENT, 171 ms] (20) IRSwT (21) IntTRSCompressionProof [EQUIVALENT, 0 ms] (22) IRSwT (23) TempFilterProof [SOUND, 17 ms] (24) IntTRS (25) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (26) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class FlattenTree { public static void main(String[] args) { Random.args = args; Tree tree = Tree.createTree(); flatten(tree); } public static Tree flatten(Tree start) { Tree result = null; Tree s,t,u; while (start != null) { if (start.left == null) { result = new Tree(null,result); start = start.right; } else { s = start.left.left; t = start.left.right; u = start.right; start = new Tree(s, new Tree(t,u)); } } return result; } } public class Random { static String[] args; static int index = 0; public static int random() { String string = args[index]; index++; return string.length(); } } public class Tree { Tree left; Tree right; Object value; public Tree(Tree l, Tree r) { this.left = l; this.right = r; }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode