details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.28659 seconds
cpu usage	9.08481
user time	8.61672
system time	0.468089
max virtual memory	2.1016332E7
max residence set size	646528.0

stage attributes

key	value
starexec-result	YES

output

8.82/3.23 YES 9.02/3.25 proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar 9.02/3.25 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 9.02/3.25 9.02/3.25 9.02/3.25 termination of the given Bare JBC problem could be proven: 9.02/3.25 9.02/3.25 (0) Bare JBC problem 9.02/3.25 (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] 9.02/3.25 (2) JBC problem 9.02/3.25 (3) JBCToGraph [EQUIVALENT, 411 ms] 9.02/3.25 (4) JBCTerminationGraph 9.02/3.25 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 9.02/3.25 (6) AND 9.02/3.25 (7) JBCTerminationSCC 9.02/3.25 (8) SCCToQDPProof [SOUND, 62 ms] 9.02/3.25 (9) QDP 9.02/3.25 (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] 9.02/3.25 (11) YES 9.02/3.25 (12) JBCTerminationSCC 9.02/3.25 (13) SCCToIRSProof [SOUND, 63 ms] 9.02/3.25 (14) IRSwT 9.02/3.25 (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 9.02/3.25 (16) IRSwT 9.02/3.25 (17) IRSwTTerminationDigraphProof [EQUIVALENT, 45 ms] 9.02/3.25 (18) IRSwT 9.02/3.25 (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] 9.02/3.25 (20) IRSwT 9.02/3.25 (21) TempFilterProof [SOUND, 51 ms] 9.02/3.25 (22) IntTRS 9.02/3.25 (23) RankingReductionPairProof [EQUIVALENT, 0 ms] 9.02/3.25 (24) YES 9.02/3.25 (25) JBCTerminationSCC 9.02/3.25 (26) SCCToIRSProof [SOUND, 37 ms] 9.02/3.25 (27) IRSwT 9.02/3.25 (28) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 9.02/3.25 (29) IRSwT 9.02/3.25 (30) IRSwTTerminationDigraphProof [EQUIVALENT, 20 ms] 9.02/3.25 (31) IRSwT 9.02/3.25 (32) IntTRSCompressionProof [EQUIVALENT, 0 ms] 9.02/3.25 (33) IRSwT 9.02/3.25 (34) TempFilterProof [SOUND, 9 ms] 9.02/3.25 (35) IntTRS 9.02/3.25 (36) RankingReductionPairProof [EQUIVALENT, 0 ms] 9.02/3.25 (37) YES 9.02/3.25 9.02/3.25 9.02/3.25 ---------------------------------------- 9.02/3.25 9.02/3.25 (0) 9.02/3.25 Obligation: 9.02/3.25 need to prove termination of the following program: 9.02/3.25 package CyclicAnalysis; 9.02/3.25 9.02/3.25 public class CyclicAnalysis { 9.02/3.25 CyclicAnalysis field; 9.02/3.25 9.02/3.25 public static void main(String[] args) { 9.02/3.25 Random.args = args; 9.02/3.25 CyclicAnalysis t = new CyclicAnalysis(); 9.02/3.25 t.field = new CyclicAnalysis(); 9.02/3.25 t.field.appendNewCyclicList(Random.random()); 9.02/3.25 t.appendNewList(Random.random()); 9.02/3.25 t.length(); 9.02/3.25 } 9.02/3.25 9.02/3.25 public int length() { 9.02/3.25 int length = 1; 9.02/3.25 CyclicAnalysis cur = this.field; 9.02/3.25 while (cur != null) { 9.02/3.25 cur = cur.field; 9.02/3.25 length++; 9.02/3.25 } 9.02/3.25 return length; 9.02/3.25 } 9.02/3.25 9.02/3.25 public void appendNewCyclicList(int i) { 9.02/3.25 CyclicAnalysis last = this.appendNewList(i); 9.02/3.25 last.field = this; 9.02/3.25 } 9.02/3.25 9.02/3.25 /** 9.02/3.25 * @param i number of elements to append 9.02/3.25 * @return the last list element appended 9.02/3.25 */ 9.02/3.25 private CyclicAnalysis appendNewList(int i) { 9.02/3.25 this.field = new CyclicAnalysis(); 9.02/3.25 CyclicAnalysis cur = this.field; 9.02/3.25 while (i > 1) { 9.02/3.25 i--; 9.02/3.25 cur = cur.field = new CyclicAnalysis(); 9.02/3.25 } 9.02/3.25 return cur; 9.02/3.25 } 9.02/3.25 } 9.02/3.25 9.02/3.25 9.02/3.25 package CyclicAnalysis; 9.02/3.25 9.02/3.25 public class Random { 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