Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java_Bytecode 2019-04-01 06.50 pair #433315717
details
property
value
status
complete
benchmark
Kernel88.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n118.star.cs.uiowa.edu
space
Fuhs_13
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.8164 seconds
cpu usage
10.8072
user time
10.3488
system time
0.458349
max virtual memory
2.1159796E7
max residence set size
774812.0
stage attributes
key
value
starexec-result
YES
output
10.57/3.73 YES 10.57/3.75 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 10.57/3.75 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 10.57/3.75 10.57/3.75 10.57/3.75 termination of the given Bare JBC problem could be proven: 10.57/3.75 10.57/3.75 (0) Bare JBC problem 10.57/3.75 (1) BareJBCToJBCProof [EQUIVALENT, 97 ms] 10.57/3.75 (2) JBC problem 10.57/3.75 (3) JBCToGraph [EQUIVALENT, 487 ms] 10.57/3.75 (4) JBCTerminationGraph 10.57/3.75 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 10.57/3.75 (6) AND 10.57/3.75 (7) JBCTerminationSCC 10.57/3.75 (8) SCCToIRSProof [SOUND, 100 ms] 10.57/3.75 (9) IRSwT 10.57/3.75 (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 10.57/3.75 (11) IRSwT 10.57/3.75 (12) IRSwTTerminationDigraphProof [EQUIVALENT, 42 ms] 10.57/3.75 (13) IRSwT 10.57/3.75 (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] 10.57/3.75 (15) IRSwT 10.57/3.75 (16) TempFilterProof [SOUND, 35 ms] 10.57/3.75 (17) IntTRS 10.57/3.75 (18) PolynomialOrderProcessor [EQUIVALENT, 2 ms] 10.57/3.75 (19) YES 10.57/3.75 (20) JBCTerminationSCC 10.57/3.75 (21) SCCToIRSProof [SOUND, 141 ms] 10.57/3.75 (22) IRSwT 10.57/3.75 (23) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 10.57/3.75 (24) IRSwT 10.57/3.75 (25) IRSwTTerminationDigraphProof [EQUIVALENT, 262 ms] 10.57/3.75 (26) IRSwT 10.57/3.75 (27) IntTRSCompressionProof [EQUIVALENT, 0 ms] 10.57/3.75 (28) IRSwT 10.57/3.75 (29) TempFilterProof [SOUND, 93 ms] 10.57/3.75 (30) IntTRS 10.57/3.75 (31) PolynomialOrderProcessor [EQUIVALENT, 3 ms] 10.57/3.75 (32) IntTRS 10.57/3.75 (33) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 10.57/3.75 (34) YES 10.57/3.75 10.57/3.75 10.57/3.75 ---------------------------------------- 10.57/3.75 10.57/3.75 (0) 10.57/3.75 Obligation: 10.57/3.75 need to prove termination of the following program: 10.57/3.75 /** 10.57/3.75 * Parts of the below code have been adapted from 10.57/3.75 * 10.57/3.75 * http://www0.cs.ucl.ac.uk/staff/p.ohearn/Talks/SAStalk.pdf 10.57/3.75 * 10.57/3.75 * Based on the motivating example of the paper 10.57/3.75 * 10.57/3.75 * Automatic termination proofs for programs with shape-shifting heaps 10.57/3.75 * Josh Berdine, Byron Cook, Dino Distefano, and Peter W. O’Hearn 10.57/3.75 * In Proc. CAV'06, LNCS 4144, pp. 386 - 400, 2006. 10.57/3.75 */ 10.57/3.75 public class Kernel88 { 10.57/3.75 /** 10.57/3.75 * A reference to the next list element. 10.57/3.75 */ 10.57/3.75 private Kernel88 next; 10.57/3.75 10.57/3.75 public static void main(String[] args) { 10.57/3.75 int random1 = args[0].length(); 10.57/3.75 int random2 = args[1].length(); 10.57/3.75 10.57/3.75 //slide68(random1, random2); 10.57/3.75 slide88(random1, random2); 10.57/3.75 //slide93(random1, random2); 10.57/3.75 //slide95(random1, random2); 10.57/3.75 } 10.57/3.75 10.57/3.75 /** 10.57/3.75 * Create a new list element. 10.57/3.75 * @param n a reference to the next element. 10.57/3.75 */ 10.57/3.75 public Kernel88(final Kernel88 n) { 10.57/3.75 this.next = n; 10.57/3.75 } 10.57/3.75 10.57/3.75 /** 10.57/3.75 * Create a new cyclical list of a length x. 10.57/3.75 * @param x some length 10.57/3.75 * @return cyclical list of length max(1, x) 10.57/3.75 */ 10.57/3.75 public static Kernel88 create(int x) { 10.57/3.75 Kernel88 last, current; 10.57/3.75 last = current = new Kernel88(null); 10.57/3.75 while (--x > 0) 10.57/3.75 current = new Kernel88(current); 10.57/3.75 return last.next = current; 10.57/3.75 } 10.57/3.75 10.57/3.75 /** 10.57/3.75 * Check if the last bit of x is > 0. 10.57/3.75 */
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