Java_Bytecode 2019-04-01 06.50 pair #433315784

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.63036 seconds
cpu usage	6.55056
user time	6.24362
system time	0.306946
max virtual memory	1.9878348E7
max residence set size	442376.0

stage attributes

key	value
starexec-result	YES

output

6.34/2.55	YES
6.34/2.57	proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar
6.34/2.57	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
6.34/2.57	
6.34/2.57	
6.34/2.57	termination of the given Bare JBC problem could be proven:
6.34/2.57	
6.34/2.57	(0) Bare JBC problem
6.34/2.57	(1) BareJBCToJBCProof [EQUIVALENT, 96 ms]
6.34/2.57	(2) JBC problem
6.34/2.57	(3) JBCToGraph [EQUIVALENT, 315 ms]
6.34/2.57	(4) JBCTerminationGraph
6.34/2.57	(5) TerminationGraphToSCCProof [SOUND, 0 ms]
6.34/2.57	(6) JBCTerminationSCC
6.34/2.57	(7) SCCToIRSProof [SOUND, 147 ms]
6.34/2.57	(8) IRSwT
6.34/2.57	(9) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
6.34/2.57	(10) IRSwT
6.34/2.57	(11) IRSwTTerminationDigraphProof [EQUIVALENT, 4 ms]
6.34/2.57	(12) IRSwT
6.34/2.57	(13) IntTRSCompressionProof [EQUIVALENT, 0 ms]
6.34/2.57	(14) IRSwT
6.34/2.57	(15) TempFilterProof [SOUND, 44 ms]
6.34/2.57	(16) IntTRS
6.34/2.57	(17) PolynomialOrderProcessor [EQUIVALENT, 13 ms]
6.34/2.57	(18) YES
6.34/2.57	
6.34/2.57	
6.34/2.57	----------------------------------------
6.34/2.57	
6.34/2.57	(0)
6.34/2.57	Obligation:
6.34/2.57	need to prove termination of the following program:
6.34/2.57	/**
6.34/2.57	 * Java can do infinite data objects, too.
6.34/2.57	 * Here we take the first n elements from an
6.34/2.57	 * ascending infinite list of integer numbers.
6.34/2.57	 *
6.34/2.57	 * @author Carsten Fuhs
6.34/2.57	 */
6.34/2.57	public class Take {
6.34/2.57	
6.34/2.57	    public static int[] take(int n, MyIterator f) {
6.34/2.57	        int[] result = new int[n];
6.34/2.57	        for (int i = 0; i < n; ++i) {
6.34/2.57	            if (f.hasNext()) {
6.34/2.57	                result[i] = f.next();
6.34/2.57	            }
6.34/2.57	            else {
6.34/2.57	                break;
6.34/2.57	            }
6.34/2.57	        }
6.34/2.57	        return result;
6.34/2.57	    }
6.34/2.57	
6.34/2.57	    public static void main(String args[]) {
6.34/2.57	        int start = args[0].length();
6.34/2.57	        int howMany = args[1].length();
6.34/2.57	        From f = new From(start);
6.34/2.57	        int[] firstHowMany = take(howMany, f);
6.34/2.57	    }
6.34/2.57	}
6.34/2.57	
6.34/2.57	interface MyIterator {
6.34/2.57	    boolean hasNext();
6.34/2.57	    int next();
6.34/2.57	}
6.34/2.57	
6.34/2.57	class From implements MyIterator {
6.34/2.57	
6.34/2.57	    private int current;
6.34/2.57	
6.34/2.57	    public From(int start) {
6.34/2.57	        this.current = start;
6.34/2.57	    }
6.34/2.57	
6.34/2.57	    public boolean hasNext() {
6.34/2.57	        return true;
6.34/2.57	    }
6.34/2.57	
6.34/2.57	    public int next() {
6.34/2.57	        return current++;
6.34/2.57	    }
6.34/2.57	}
6.34/2.57	
6.34/2.57	
6.34/2.57	
6.34/2.57	
6.34/2.57	----------------------------------------
6.34/2.57	
6.34/2.57	(1) BareJBCToJBCProof (EQUIVALENT)
6.34/2.57	initialized classpath
6.34/2.57	----------------------------------------
6.34/2.57	
6.34/2.57	(2)
6.34/2.57	Obligation:
6.34/2.57	need to prove termination of the following program:
6.34/2.57	/**
6.34/2.57	 * Java can do infinite data objects, too.
6.34/2.57	 * Here we take the first n elements from an

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