Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919276
details
property
value
status
complete
benchmark
Test3.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
Julia_10_Iterative
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
4.93603491783 seconds
cpu usage
15.136736674
max memory
1.452036096E9
stage attributes
key
value
output-size
54876
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty termination of the given Bare JBC problem could be proven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 97 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 1010 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 10 ms] (6) AND (7) JBCTerminationSCC (8) SCCToQDPProof [SOUND, 104 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) JBCTerminationSCC (13) SCCToIRSProof [SOUND, 9 ms] (14) IRSwT (15) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (16) IRSwT (17) IRSwTTerminationDigraphProof [EQUIVALENT, 13 ms] (18) IRSwT (19) IntTRSCompressionProof [EQUIVALENT, 0 ms] (20) IRSwT (21) TempFilterProof [SOUND, 15 ms] (22) IntTRS (23) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (24) YES (25) JBCTerminationSCC (26) SCCToIRSProof [SOUND, 373 ms] (27) IRSwT (28) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (29) IRSwT (30) IRSwTTerminationDigraphProof [EQUIVALENT, 43 ms] (31) IRSwT (32) TempFilterProof [SOUND, 6 ms] (33) IRSwT (34) IRSwTToQDPProof [SOUND, 0 ms] (35) QDP (36) QDPSizeChangeProof [EQUIVALENT, 0 ms] (37) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class Test3 { public static void main(String[] args) { List l1 = List.mk(args.length); List l2 = List.mk(args.length); List l3 = (args.length % 2 == 0) ? List.mk(args.length * args.length) : l2; while (length(l1) + length(l2) + length(l3) * 5 > 0) if (length(l1) % 2 == 1) l1 = l1.getTail(); else if (length(l2) > length(l3)) l2 = l2.getTail(); else if (l3 == null) break; else { l1 = new List(new Object(), l1); l2 = new List(new Object(), l2); l3 = l3.getTail(); } } private static int length(List list) { int len = 0; while (list != null) { list = list.getTail(); len++; } return len; } } public class List { public Object head; private List tail; public List(Object head, List tail) { this.head = head; this.tail = tail; }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199