Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571422
details
property
value
status
complete
benchmark
MirrorTree.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
Aprove_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.06847381592 seconds
cpu usage
11.864505122
max memory
8.43231232E8
stage attributes
key
value
output-size
90758
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, 927 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToIRSProof [SOUND, 332 ms] (9) IRSwT (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (11) IRSwT (12) IRSwTTerminationDigraphProof [EQUIVALENT, 95 ms] (13) IRSwT (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] (15) IRSwT (16) TempFilterProof [SOUND, 43 ms] (17) IntTRS (18) PolynomialOrderProcessor [EQUIVALENT, 16 ms] (19) YES (20) JBCTerminationSCC (21) SCCToQDPProof [SOUND, 111 ms] (22) QDP (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] (24) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class List { Tree value; List next; public List(Tree value, List next) { this.value = value; this.next = next; } } public class MirrorTree { public static void main(String[] args) { Random.args = args; Tree tree = Tree.createTree(); //Now mirror the left-most path: mirror(tree); } public static void mirror(Tree tree) { Tree cur = tree; while (cur != null) { Tree t = cur.left; cur.left = cur.right; cur.right = t; cur = cur.right; } } } 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; } public Tree() {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode