details

property	value
status	complete
benchmark	LessLeaves.jar
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n103.star.cs.uiowa.edu
space	Aprove_09

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.83823 seconds
cpu usage	14.9131
user time	14.0735
system time	0.839529
max virtual memory	1.88156E7
max residence set size	1262912.0

stage attributes

key	value
starexec-result	YES

output

14.49/4.78 YES 14.49/4.79 proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar 14.49/4.79 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 14.49/4.79 14.49/4.79 14.49/4.79 termination of the given Bare JBC problem could be proven: 14.49/4.79 14.49/4.79 (0) Bare JBC problem 14.49/4.79 (1) BareJBCToJBCProof [EQUIVALENT, 98 ms] 14.49/4.79 (2) JBC problem 14.49/4.79 (3) JBCToGraph [EQUIVALENT, 1519 ms] 14.49/4.79 (4) JBCTerminationGraph 14.49/4.79 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 14.49/4.79 (6) AND 14.49/4.79 (7) JBCTerminationSCC 14.49/4.79 (8) SCCToQDPProof [SOUND, 105 ms] 14.49/4.79 (9) QDP 14.49/4.79 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 14.49/4.79 (11) YES 14.49/4.79 (12) JBCTerminationSCC 14.49/4.79 (13) SCCToQDPProof [SOUND, 183 ms] 14.49/4.79 (14) QDP 14.49/4.79 (15) DependencyGraphProof [EQUIVALENT, 0 ms] 14.49/4.79 (16) TRUE 14.49/4.79 (17) JBCTerminationSCC 14.49/4.79 (18) SCCToIRSProof [SOUND, 161 ms] 14.49/4.79 (19) IRSwT 14.49/4.79 (20) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 14.49/4.79 (21) IRSwT 14.49/4.79 (22) IRSwTTerminationDigraphProof [EQUIVALENT, 152 ms] 14.49/4.79 (23) IRSwT 14.49/4.79 (24) IntTRSCompressionProof [EQUIVALENT, 0 ms] 14.49/4.79 (25) IRSwT 14.49/4.79 (26) TempFilterProof [SOUND, 48 ms] 14.49/4.79 (27) IntTRS 14.49/4.79 (28) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 14.49/4.79 (29) YES 14.49/4.79 14.49/4.79 14.49/4.79 ---------------------------------------- 14.49/4.79 14.49/4.79 (0) 14.49/4.79 Obligation: 14.49/4.79 need to prove termination of the following program: 14.49/4.79 public class LessLeaves { 14.49/4.79 // Checks if a binary tree 14.49/4.79 // has less leaves than another one 14.49/4.79 14.49/4.79 public static void main(String[] args) { 14.49/4.79 Random.args = args; 14.49/4.79 Tree tree1 = Tree.createTree(); 14.49/4.79 Tree tree2 = Tree.createTree(); 14.49/4.79 boolean b = less_leaves(tree1,tree2); 14.49/4.79 } 14.49/4.79 14.49/4.79 14.49/4.79 14.49/4.79 public static Tree append(Tree t1, Tree t2) { 14.49/4.79 14.49/4.79 Tree t; 14.49/4.79 14.49/4.79 if (t1 == null) return t2; 14.49/4.79 else { 14.49/4.79 t = t1; 14.49/4.79 14.49/4.79 while (t.right != null) { 14.49/4.79 t = t.right; 14.49/4.79 } 14.49/4.79 14.49/4.79 t.right = t2; 14.49/4.79 return t1; 14.49/4.79 } 14.49/4.79 } 14.49/4.79 14.49/4.79 public static boolean less_leaves(Tree t1, Tree t2) { 14.49/4.79 14.49/4.79 14.49/4.79 while ((t1 != null) && (t2 != null)) { 14.49/4.79 t1 = append(t1.left,t1.right); 14.49/4.79 t2 = append(t2.left,t2.right); 14.49/4.79 } 14.49/4.79 14.49/4.79 if (t2 == null) return false; 14.49/4.79 else return true; 14.49/4.79 14.49/4.79 } 14.49/4.79 } 14.49/4.79 14.49/4.79 14.49/4.79 public class Random { 14.49/4.79 static String[] args; 14.49/4.79 static int index = 0; 14.49/4.79 14.49/4.79 public static int random() { 14.49/4.79 String string = args[index]; 14.49/4.79 index++; 14.49/4.79 return string.length(); 14.49/4.79 } 14.49/4.79 } 14.49/4.79 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