Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919180
details
property
value
status
complete
benchmark
Binomial.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
Julia_11_recursive
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
6.20799589157 seconds
cpu usage
18.470131889
max memory
1.768910848E9
stage attributes
key
value
output-size
111996
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, 95 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 738 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 9 ms] (6) AND (7) JBCTerminationSCC (8) SCCToIRSProof [SOUND, 0 ms] (9) IRSwT (10) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (11) IRSwT (12) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] (13) IRSwT (14) IntTRSCompressionProof [EQUIVALENT, 0 ms] (15) IRSwT (16) TempFilterProof [SOUND, 36 ms] (17) IntTRS (18) RankingReductionPairProof [EQUIVALENT, 0 ms] (19) YES (20) JBCTerminationSCC (21) SCCToIRSProof [SOUND, 316 ms] (22) IRSwT (23) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (24) IRSwT (25) IRSwTTerminationDigraphProof [EQUIVALENT, 898 ms] (26) IRSwT (27) IntTRSCompressionProof [EQUIVALENT, 0 ms] (28) IRSwT (29) TempFilterProof [SOUND, 279 ms] (30) IntTRS (31) PolynomialOrderProcessor [EQUIVALENT, 31 ms] (32) IntTRS (33) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (34) IntTRS (35) PolynomialOrderProcessor [EQUIVALENT, 6 ms] (36) IntTRS (37) PolynomialOrderProcessor [EQUIVALENT, 0 ms] (38) IntTRS (39) RankingReductionPairProof [EQUIVALENT, 0 ms] (40) YES ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class Binomial { public static int fact(int n) { if (n <= 0) return 1; else return n * fact(n - 1); } public static int binomialCoefficient(int n, int k) { return fact(n) / (fact(k) * fact(n - k)); } public static void main(String args[]) { for (int n = 0; n <= args.length; n++) for (int k = 0; k <= args.length; k++) if (k <= n) binomialCoefficient(n, k); else binomialCoefficient(k, n); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class Binomial { public static int fact(int n) { if (n <= 0) return 1; else return n * fact(n - 1); } public static int binomialCoefficient(int n, int k) { return fact(n) / (fact(k) * fact(n - k)); }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199