Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919226
details
property
value
status
complete
benchmark
Ackermann.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n069.star.cs.uiowa.edu
space
Costa_Julia_09-recursive
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.42080187798 seconds
cpu usage
9.552775745
max memory
6.7682304E8
stage attributes
key
value
output-size
15826
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: 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, 434 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 166 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 39 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 53 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (18) IntTRS (19) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: /** * The classical Ackermann function. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate * * Note that we have to express the basic cases as m <= 0 and n <= 0 * in order to prove termination. * * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> */ public class Ackermann { public static int ack(int m, int n) { if (m <= 0) return n + 1; else if (n <= 0) return ack(m - 1,1); else return ack(m - 1,ack(m,n - 1)); } public static void main(String[] args) { ack(10,12); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: /** * The classical Ackermann function. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate * * Note that we have to express the basic cases as m <= 0 and n <= 0 * in order to prove termination. * * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> */ public class Ackermann { public static int ack(int m, int n) { if (m <= 0) return n + 1; else if (n <= 0) return ack(m - 1,1); else return ack(m - 1,ack(m,n - 1)); } public static void main(String[] args) { ack(10,12);
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199