Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919175
details
property
value
status
complete
benchmark
Double2.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n050.star.cs.uiowa.edu
space
Costa_Julia_09-recursive
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.31348013878 seconds
cpu usage
5.799508969
max memory
4.087808E8
stage attributes
key
value
output-size
7877
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, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 169 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 0 ms] (6) JBCTerminationSCC (7) SCCToIRSProof [SOUND, 75 ms] (8) IRSwT (9) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (10) IRSwT (11) IRSwTTerminationDigraphProof [EQUIVALENT, 18 ms] (12) IRSwT (13) IntTRSCompressionProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 14 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (18) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: /** * A recursive loop. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate. * * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> */ public class Double2 { private static void test(int n) { for (int i = n - 1; i >= 0; i--) test(i); } public static void main(String[] args) { test(10); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: /** * A recursive loop. * * All calls terminate. * * Julia + BinTerm prove that all calls terminate. * * @author <A HREF="mailto:fausto.spoto@univr.it">Fausto Spoto</A> */ public class Double2 { private static void test(int n) { for (int i = n - 1; i >= 0; i--) test(i); } public static void main(String[] args) { test(10); } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199