Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571449
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
n100.star.cs.uiowa.edu
space
AProVE_11_iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.22741484642 seconds
cpu usage
8.758426445
max memory
6.6797568E8
stage attributes
key
value
output-size
43913
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.jar # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty termination of the given Bare JBC problem could be proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 442 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToIRSProof [SOUND, 46 ms] (9) IRSwT (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (11) IRSwT (12) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] (13) IRSwT (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] (15) IRSwT (16) TempFilterProof [SOUND, 37 ms] (17) IntTRS (18) PolynomialOrderProcessor [EQUIVALENT, 14 ms] (19) YES (20) JBCTerminationSCC (21) SCCToQDPProof [SOUND, 342 ms] (22) QDP (23) MRRProof [EQUIVALENT, 0 ms] (24) QDP (25) PisEmptyProof [EQUIVALENT, 0 ms] (26) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: package AlternatingGrowReduce; public class AlternatingGrowReduce { AlternatingGrowReduce next; public static void main(String[] argv) { Random.args = argv; AlternatingGrowReduce list = createList(Random.random()); int mode = 0; while (list != null) { if (mode == 0) { list = list.next.next.next.next; } else if (mode == 1) { list = new AlternatingGrowReduce(list); } else if (mode > 1) { list = new AlternatingGrowReduce(new AlternatingGrowReduce(list)); } mode++; if (mode > 2) { mode = 0; } } } public AlternatingGrowReduce(AlternatingGrowReduce old) { this.next = old; } public static AlternatingGrowReduce createList(int length) { AlternatingGrowReduce res = new AlternatingGrowReduce(null); while (length > 0) { res = new AlternatingGrowReduce(res); length--; } return res; } } package AlternatingGrowReduce; public class Random { static String[] args; static int index = 0; public static int random() { String string = args[index]; index++; return string.length(); } }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode