details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.28476 seconds
cpu usage	8.62153
user time	8.20916
system time	0.412373
max virtual memory	2.1087464E7
max residence set size	637468.0

stage attributes

key	value
starexec-result	YES

output

8.28/3.23 YES 8.28/3.25 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 8.28/3.25 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 8.28/3.25 8.28/3.25 8.28/3.25 termination of the given Bare JBC problem could be proven: 8.28/3.25 8.28/3.25 (0) Bare JBC problem 8.28/3.25 (1) BareJBCToJBCProof [EQUIVALENT, 95 ms] 8.28/3.25 (2) JBC problem 8.28/3.25 (3) JBCToGraph [EQUIVALENT, 451 ms] 8.28/3.25 (4) JBCTerminationGraph 8.28/3.25 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 8.28/3.25 (6) AND 8.28/3.25 (7) JBCTerminationSCC 8.28/3.25 (8) SCCToIRSProof [SOUND, 3 ms] 8.28/3.25 (9) IRSwT 8.28/3.25 (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 8.28/3.25 (11) IRSwT 8.28/3.25 (12) IRSwTTerminationDigraphProof [EQUIVALENT, 1 ms] 8.28/3.25 (13) IRSwT 8.28/3.25 (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] 8.28/3.25 (15) IRSwT 8.28/3.25 (16) TempFilterProof [SOUND, 35 ms] 8.28/3.25 (17) IntTRS 8.28/3.25 (18) RankingReductionPairProof [EQUIVALENT, 20 ms] 8.28/3.25 (19) YES 8.28/3.25 (20) JBCTerminationSCC 8.28/3.25 (21) SCCToQDPProof [SOUND, 351 ms] 8.28/3.25 (22) QDP 8.28/3.25 (23) MRRProof [EQUIVALENT, 0 ms] 8.28/3.25 (24) QDP 8.28/3.25 (25) PisEmptyProof [EQUIVALENT, 0 ms] 8.28/3.25 (26) YES 8.28/3.25 8.28/3.25 8.28/3.25 ---------------------------------------- 8.28/3.25 8.28/3.25 (0) 8.28/3.25 Obligation: 8.28/3.25 need to prove termination of the following program: 8.28/3.25 package AlternatingGrowReduce; 8.28/3.25 8.28/3.25 public class AlternatingGrowReduce { 8.28/3.25 AlternatingGrowReduce next; 8.28/3.25 8.28/3.25 public static void main(String[] argv) { 8.28/3.25 Random.args = argv; 8.28/3.25 AlternatingGrowReduce list = createList(Random.random()); 8.28/3.25 8.28/3.25 int mode = 0; 8.28/3.25 while (list != null) { 8.28/3.25 if (mode == 0) { 8.28/3.25 list = list.next.next.next.next; 8.28/3.25 } else if (mode == 1) { 8.28/3.25 list = new AlternatingGrowReduce(list); 8.28/3.25 } else if (mode > 1) { 8.28/3.25 list = new AlternatingGrowReduce(new AlternatingGrowReduce(list)); 8.28/3.25 } 8.28/3.25 8.28/3.25 mode++; 8.28/3.25 if (mode > 2) { 8.28/3.25 mode = 0; 8.28/3.25 } 8.28/3.25 } 8.28/3.25 } 8.28/3.25 8.28/3.25 public AlternatingGrowReduce(AlternatingGrowReduce old) { 8.28/3.25 this.next = old; 8.28/3.25 } 8.28/3.25 8.28/3.25 public static AlternatingGrowReduce createList(int length) { 8.28/3.25 AlternatingGrowReduce res = new AlternatingGrowReduce(null); 8.28/3.25 while (length > 0) { 8.28/3.25 res = new AlternatingGrowReduce(res); 8.28/3.25 length--; 8.28/3.25 } 8.28/3.25 return res; 8.28/3.25 } 8.28/3.25 } 8.28/3.25 8.28/3.25 8.28/3.25 package AlternatingGrowReduce; 8.28/3.25 8.28/3.25 public class Random { 8.28/3.25 static String[] args; 8.28/3.25 static int index = 0; 8.28/3.25 8.28/3.25 public static int random() { 8.28/3.25 String string = args[index]; 8.28/3.25 index++; 8.28/3.25 return string.length(); 8.28/3.25 } 8.28/3.25 } 8.28/3.25 8.28/3.25 8.28/3.25 8.28/3.25 ---------------------------------------- 8.28/3.25 8.28/3.25 (1) BareJBCToJBCProof (EQUIVALENT) 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