Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571432
details
property
value
status
complete
benchmark
Flatten.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n139.star.cs.uiowa.edu
space
Aprove_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.17063808441 seconds
cpu usage
15.655107327
max memory
1.263669248E9
stage attributes
key
value
output-size
111751
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, 1407 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToIRSProof [SOUND, 253 ms] (9) IRSwT (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (11) IRSwT (12) IRSwTTerminationDigraphProof [EQUIVALENT, 141 ms] (13) IRSwT (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] (15) IRSwT (16) TempFilterProof [SOUND, 18 ms] (17) IntTRS (18) PolynomialOrderProcessor [EQUIVALENT, 5 ms] (19) YES (20) JBCTerminationSCC (21) SCCToQDPProof [SOUND, 299 ms] (22) QDP (23) UsableRulesReductionPairsProof [EQUIVALENT, 45 ms] (24) QDP (25) PisEmptyProof [EQUIVALENT, 0 ms] (26) YES (27) JBCTerminationSCC (28) SCCToIRSProof [SOUND, 162 ms] (29) IRSwT (30) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (31) IRSwT (32) IRSwTTerminationDigraphProof [EQUIVALENT, 14 ms] (33) IRSwT (34) IntTRSCompressionProof [EQUIVALENT, 0 ms] (35) IRSwT (36) TempFilterProof [SOUND, 36 ms] (37) IntTRS (38) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (39) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class Flatten { public static void main(String[] args) { Random.args = args; int listLength = Random.random(); TreeList list = null; for (int i = listLength; i > 0; i--) { Tree tree = Tree.createTree(); list = new TreeList(tree, list); } flatten(list); } public static ObjectList flatten(TreeList start) { ObjectList result = null; while (start != null) { Tree tree = start.value; if (tree != null) { result = new ObjectList(tree.value, result); start = start.next; start = new TreeList(tree.left, start); start = new TreeList(tree.right, start); } else { start = start.next; } } return result; } } public class ObjectList { Object value; ObjectList next; public ObjectList(Object value, ObjectList next) { this.value = value; this.next = next; }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode