details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	11.9803 seconds
cpu usage	20.9168
user time	19.6861
system time	1.23066
max virtual memory	2.1315024E7
max residence set size	1950020.0

stage attributes

key	value
starexec-result	YES

output

20.61/11.87 YES 20.61/11.89 proof of /export/starexec/sandbox/benchmark/theBenchmark.jar 20.61/11.89 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 20.61/11.89 20.61/11.89 20.61/11.89 termination of the given Bare JBC problem could be proven: 20.61/11.89 20.61/11.89 (0) Bare JBC problem 20.61/11.89 (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] 20.61/11.89 (2) JBC problem 20.61/11.89 (3) JBCToGraph [EQUIVALENT, 482 ms] 20.61/11.89 (4) JBCTerminationGraph 20.61/11.89 (5) TerminationGraphToSCCProof [SOUND, 0 ms] 20.61/11.89 (6) AND 20.61/11.89 (7) JBCTerminationSCC 20.61/11.89 (8) SCCToIRSProof [SOUND, 73 ms] 20.61/11.89 (9) IRSwT 20.61/11.89 (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 20.61/11.89 (11) IRSwT 20.61/11.89 (12) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] 20.61/11.89 (13) IRSwT 20.61/11.89 (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] 20.61/11.89 (15) IRSwT 20.61/11.89 (16) TempFilterProof [SOUND, 36 ms] 20.61/11.89 (17) IntTRS 20.61/11.89 (18) PolynomialOrderProcessor [EQUIVALENT, 0 ms] 20.61/11.89 (19) YES 20.61/11.89 (20) JBCTerminationSCC 20.61/11.89 (21) SCCToIRSProof [SOUND, 243 ms] 20.61/11.89 (22) IRSwT 20.61/11.89 (23) IRSFormatTransformerProof [EQUIVALENT, 0 ms] 20.61/11.89 (24) IRSwT 20.61/11.89 (25) IRSwTTerminationDigraphProof [EQUIVALENT, 2071 ms] 20.61/11.89 (26) IRSwT 20.61/11.89 (27) IntTRSCompressionProof [EQUIVALENT, 0 ms] 20.61/11.89 (28) IRSwT 20.61/11.89 (29) TempFilterProof [SOUND, 171 ms] 20.61/11.89 (30) IntTRS 20.61/11.89 (31) RankingReductionPairProof [EQUIVALENT, 69 ms] 20.61/11.89 (32) YES 20.61/11.89 20.61/11.89 20.61/11.89 ---------------------------------------- 20.61/11.89 20.61/11.89 (0) 20.61/11.89 Obligation: 20.61/11.89 need to prove termination of the following program: 20.61/11.89 /** 20.61/11.89 * Parts of the below code have been adapted from 20.61/11.89 * 20.61/11.89 * http://www0.cs.ucl.ac.uk/staff/p.ohearn/Talks/SAStalk.pdf 20.61/11.89 * 20.61/11.89 * Based on the motivating example of the paper 20.61/11.89 * 20.61/11.89 * Automatic termination proofs for programs with shape-shifting heaps 20.61/11.89 * Josh Berdine, Byron Cook, Dino Distefano, and Peter W. O’Hearn 20.61/11.89 * In Proc. CAV'06, LNCS 4144, pp. 386 - 400, 2006. 20.61/11.89 */ 20.61/11.89 public class Kernel68 { 20.61/11.89 /** 20.61/11.89 * A reference to the next list element. 20.61/11.89 */ 20.61/11.89 private Kernel68 next; 20.61/11.89 20.61/11.89 public static void main(String[] args) { 20.61/11.89 int random1 = args[0].length(); 20.61/11.89 int random2 = args[1].length(); 20.61/11.89 20.61/11.89 slide68(random1, random2); 20.61/11.89 //slide88(random1, random2); 20.61/11.89 //slide93(random1, random2); 20.61/11.89 //slide95(random1, random2); 20.61/11.89 } 20.61/11.89 20.61/11.89 /** 20.61/11.89 * Create a new list element. 20.61/11.89 * @param n a reference to the next element. 20.61/11.89 */ 20.61/11.89 public Kernel68(final Kernel68 n) { 20.61/11.89 this.next = n; 20.61/11.89 } 20.61/11.89 20.61/11.89 /** 20.61/11.89 * Create a new cyclical list of a length x. 20.61/11.89 * @param x some length 20.61/11.89 * @return cyclical list of length max(1, x) 20.61/11.89 */ 20.61/11.89 public static Kernel68 create(int x) { 20.61/11.89 Kernel68 last, current; 20.61/11.89 last = current = new Kernel68(null); 20.61/11.89 while (--x > 0) 20.61/11.89 current = new Kernel68(current); 20.61/11.89 return last.next = current; 20.61/11.89 } 20.61/11.89 20.61/11.89 /** 20.61/11.89 * Check if the last bit of x is > 0. 20.61/11.89 */ 20.61/11.89 private static boolean check(int x) { 20.61/11.89 return x % 2 > 0; 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