Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode pair #487571548
details
property
value
status
complete
benchmark
CyclicList.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_10_iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.74186086655 seconds
cpu usage
6.868929676
max memory
5.09403136E8
stage attributes
key
value
output-size
19495
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, 304 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) AND (7) JBCTerminationSCC (8) SCCToIRSProof [SOUND, 48 ms] (9) IRSwT (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (11) IRSwT (12) IRSwTTerminationDigraphProof [EQUIVALENT, 60 ms] (13) AND (14) IRSwT (15) IntTRSCompressionProof [EQUIVALENT, 0 ms] (16) IRSwT (17) TempFilterProof [SOUND, 11 ms] (18) IntTRS (19) RankingReductionPairProof [EQUIVALENT, 4 ms] (20) YES (21) IRSwT (22) IntTRSCompressionProof [EQUIVALENT, 0 ms] (23) IRSwT (24) TempFilterProof [SOUND, 5 ms] (25) IntTRS (26) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (27) YES (28) JBCTerminationSCC (29) SCCToIRSProof [SOUND, 7 ms] (30) IRSwT (31) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (32) IRSwT (33) IRSwTTerminationDigraphProof [EQUIVALENT, 19 ms] (34) IRSwT (35) IntTRSCompressionProof [EQUIVALENT, 0 ms] (36) IRSwT (37) TempFilterProof [SOUND, 10 ms] (38) IntTRS (39) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (40) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: /** * This class represents a list. The function get(n) can be used to access * the n-th element. * @author Marc Brockschmidt */ public class CyclicList { /** * A reference to the next list element. */ private CyclicList next; public static void main(String[] args) { CyclicList list = CyclicList.create(args.length); list.get(args[0].length()); } /** * Create a new list element. * @param n a reference to the next element. */ public CyclicList(final CyclicList n) { this.next = n; } /** * Create a new cyclical list of a length l. * @param l some length * @return cyclical list of length max(1, l) */ public static CyclicList create(int x) { CyclicList last, current; last = current = new CyclicList(null); while (--x > 0) current = new CyclicList(current); return last.next = current; } public CyclicList get(int n) { CyclicList cur = this;
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java_Bytecode