Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919466
details
property
value
status
complete
benchmark
BinTreeChanger.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n026.star.cs.uiowa.edu
space
BOG_RTA_11
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
5.12421321869 seconds
cpu usage
14.845024463
max memory
1.137045504E9
stage attributes
key
value
output-size
110816
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: 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, 1499 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToIRSProof [SOUND, 132 ms] (9) IRSwT (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (11) IRSwT (12) IRSwTTerminationDigraphProof [EQUIVALENT, 21 ms] (13) IRSwT (14) TempFilterProof [SOUND, 23 ms] (15) IRSwT (16) IRSwTToQDPProof [SOUND, 0 ms] (17) QDP (18) QDPSizeChangeProof [EQUIVALENT, 0 ms] (19) YES (20) JBCTerminationSCC (21) SCCToQDPProof [SOUND, 315 ms] (22) QDP (23) QDPSizeChangeProof [EQUIVALENT, 0 ms] (24) YES (25) JBCTerminationSCC (26) SCCToIRSProof [SOUND, 93 ms] (27) IRSwT (28) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (29) IRSwT (30) IRSwTTerminationDigraphProof [EQUIVALENT, 33 ms] (31) IRSwT (32) IntTRSCompressionProof [EQUIVALENT, 0 ms] (33) IRSwT (34) TempFilterProof [SOUND, 42 ms] (35) IntTRS (36) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (37) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: package BinTreeChanger; public class BinTreeChanger { public static void main(final String[] args) { Random.args = args; final Tree t = Tree.createTree(Random.random()); t.applyTreeChanger(new AnswerAdder()); } } class AnswerAdder implements TreeChanger { public void change(final Tree t) { final Tree newLeft = new Tree(42); final Tree newRight = new Tree(42); newLeft.left = t.left; newRight.right = t.right; t.left = newLeft; t.right = newRight; } } package BinTreeChanger; public class Random { static String[] args; static int index = 0; public static int random() { final String string = args[index]; index++; return string.length(); } } package BinTreeChanger; public interface TreeChanger { public void change(Tree t);
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199