details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.47932 seconds
cpu usage	9.87003
user time	9.4311
system time	0.438932
max virtual memory	2.1064876E7
max residence set size	762464.0

stage attributes

key	value
starexec-result	YES

output

9.70/3.41 YES 9.70/3.43 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 9.70/3.43 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.70/3.43 9.70/3.43 9.70/3.43 termination of the given Bare JBC problem could be proven: 9.70/3.43 9.70/3.43 (0) Bare JBC problem 9.70/3.43 (1) BareJBCToJBCProof [EQUIVALENT, 95 ms] 9.70/3.43 (2) JBC problem 9.70/3.43 (3) JBCToGraph [EQUIVALENT, 734 ms] 9.70/3.43 (4) JBCTerminationGraph 9.70/3.43 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 9.70/3.43 (6) AND 9.70/3.43 (7) JBCTerminationSCC 9.70/3.43 (8) SCCToQDPProof [SOUND, 86 ms] 9.70/3.43 (9) QDP 9.70/3.43 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.70/3.43 (11) YES 9.70/3.43 (12) JBCTerminationSCC 9.70/3.43 (13) SCCToQDPProof [SOUND, 63 ms] 9.70/3.43 (14) QDP 9.70/3.43 (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.70/3.43 (16) YES 9.70/3.43 (17) JBCTerminationSCC 9.70/3.43 (18) SCCToIRSProof [SOUND, 241 ms] 9.70/3.43 (19) IRSwT 9.70/3.43 (20) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 9.70/3.43 (21) IRSwT 9.70/3.43 (22) IRSwTTerminationDigraphProof [EQUIVALENT, 23 ms] 9.70/3.43 (23) IRSwT 9.70/3.43 (24) IntTRSCompressionProof [EQUIVALENT, 0 ms] 9.70/3.43 (25) IRSwT 9.70/3.43 (26) TempFilterProof [SOUND, 17 ms] 9.70/3.43 (27) IntTRS 9.70/3.43 (28) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 9.70/3.43 (29) YES 9.70/3.43 9.70/3.43 9.70/3.43 ---------------------------------------- 9.70/3.43 9.70/3.43 (0) 9.70/3.43 Obligation: 9.70/3.43 need to prove termination of the following program: 9.70/3.43 public class Entry 9.70/3.43 { 9.70/3.43 private String item; 9.70/3.43 private int count; 9.70/3.43 9.70/3.43 public Entry(String itemData, int countData) 9.70/3.43 { 9.70/3.43 item = itemData; 9.70/3.43 count = countData; 9.70/3.43 } 9.70/3.43 9.70/3.43 public String toString( ) 9.70/3.43 { 9.70/3.43 return (item + " " + count); 9.70/3.43 } 9.70/3.43 9.70/3.43 public boolean equals(Object otherObject) 9.70/3.43 { 9.70/3.43 if (otherObject == null) 9.70/3.43 return false; 9.70/3.43 else if (getClass( ) != otherObject.getClass( )) 9.70/3.43 return false; 9.70/3.43 else 9.70/3.43 { 9.70/3.43 Entry otherEntry = (Entry)otherObject; 9.70/3.43 return (item.equals(otherEntry.item) 9.70/3.43 && (count == otherEntry.count)); 9.70/3.43 } 9.70/3.43 } 9.70/3.43 9.70/3.43 // <There should be other constructors and methods, including accessor and 9.70/3.43 // mutator methods, but we do not use them in this demonstration.> 9.70/3.43 } 9.70/3.43 9.70/3.43 9.70/3.43 9.70/3.43 public class LinkedList<T> 9.70/3.43 { 9.70/3.43 private class Node<T> 9.70/3.43 { 9.70/3.43 private T data; 9.70/3.43 private Node<T> link; 9.70/3.43 9.70/3.43 public Node( ) 9.70/3.43 { 9.70/3.43 data = null; 9.70/3.43 link = null; 9.70/3.43 } 9.70/3.43 9.70/3.43 public Node(T newData, Node<T> linkValue) 9.70/3.43 { 9.70/3.43 data = newData; 9.70/3.43 link = linkValue; 9.70/3.43 } 9.70/3.43 }//End of Node<T> inner class 9.70/3.43 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