Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode 2019-04-01 06.50 pair #433315768
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
n121.star.cs.uiowa.edu
space
Aprove_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.36881 seconds
cpu usage
13.2161
user time
12.6372
system time
0.578923
max virtual memory
1.85488E7
max residence set size
1057012.0
stage attributes
key
value
starexec-result
YES
output
13.03/4.31 YES 13.03/4.32 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 13.03/4.32 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 13.03/4.32 13.03/4.32 13.03/4.32 termination of the given Bare JBC problem could be proven: 13.03/4.32 13.03/4.32 (0) Bare JBC problem 13.03/4.32 (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] 13.03/4.32 (2) JBC problem 13.03/4.32 (3) JBCToGraph [EQUIVALENT, 1144 ms] 13.03/4.32 (4) JBCTerminationGraph 13.03/4.32 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 13.03/4.32 (6) AND 13.03/4.32 (7) JBCTerminationSCC 13.03/4.32 (8) SCCToQDPProof [SOUND, 239 ms] 13.03/4.32 (9) QDP 13.03/4.32 (10) UsableRulesReductionPairsProof [EQUIVALENT, 0 ms] 13.03/4.32 (11) QDP 13.03/4.32 (12) PisEmptyProof [EQUIVALENT, 0 ms] 13.03/4.32 (13) YES 13.03/4.32 (14) JBCTerminationSCC 13.03/4.32 (15) SCCToQDPProof [SOUND, 218 ms] 13.03/4.32 (16) QDP 13.03/4.32 (17) QDPSizeChangeProof [EQUIVALENT, 0 ms] 13.03/4.32 (18) YES 13.03/4.32 (19) JBCTerminationSCC 13.03/4.32 (20) SCCToIRSProof [SOUND, 333 ms] 13.03/4.32 (21) IRSwT 13.03/4.32 (22) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 13.03/4.32 (23) IRSwT 13.03/4.32 (24) IRSwTTerminationDigraphProof [EQUIVALENT, 187 ms] 13.03/4.32 (25) IRSwT 13.03/4.32 (26) IntTRSCompressionProof [EQUIVALENT, 0 ms] 13.03/4.32 (27) IRSwT 13.03/4.32 (28) TempFilterProof [SOUND, 42 ms] 13.03/4.32 (29) IntTRS 13.03/4.32 (30) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 13.03/4.32 (31) YES 13.03/4.32 13.03/4.32 13.03/4.32 ---------------------------------------- 13.03/4.32 13.03/4.32 (0) 13.03/4.32 Obligation: 13.03/4.32 need to prove termination of the following program: 13.03/4.32 public class FlattenTree { 13.03/4.32 public static void main(String[] args) { 13.03/4.32 Random.args = args; 13.03/4.32 Tree tree = Tree.createTree(); 13.03/4.32 flatten(tree); 13.03/4.32 } 13.03/4.32 13.03/4.32 public static Tree flatten(Tree start) { 13.03/4.32 Tree result = null; 13.03/4.32 Tree s,t,u; 13.03/4.32 13.03/4.32 while (start != null) { 13.03/4.32 13.03/4.32 if (start.left == null) { 13.03/4.32 13.03/4.32 result = new Tree(null,result); 13.03/4.32 start = start.right; 13.03/4.32 } 13.03/4.32 else { 13.03/4.32 s = start.left.left; 13.03/4.32 t = start.left.right; 13.03/4.32 u = start.right; 13.03/4.32 start = new Tree(s, new Tree(t,u)); 13.03/4.32 } 13.03/4.32 } 13.03/4.32 13.03/4.32 return result; 13.03/4.32 } 13.03/4.32 } 13.03/4.32 13.03/4.32 13.03/4.32 public class Random { 13.03/4.32 static String[] args; 13.03/4.32 static int index = 0; 13.03/4.32 13.03/4.32 public static int random() { 13.03/4.32 String string = args[index]; 13.03/4.32 index++; 13.03/4.32 return string.length(); 13.03/4.32 } 13.03/4.32 } 13.03/4.32 13.03/4.32 13.03/4.32 public class Tree { 13.03/4.32 Tree left; 13.03/4.32 Tree right; 13.03/4.32 Object value; 13.03/4.32 13.03/4.32 public Tree(Tree l, Tree r) { 13.03/4.32 this.left = l; 13.03/4.32 this.right = r; 13.03/4.32 } 13.03/4.32 13.03/4.32 public Tree() {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode 2019-04-01 06.50