details

property	value
status	complete
benchmark	FactSum.jar
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n042.star.cs.uiowa.edu
space	Costa_Julia_09-recursive

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.88352799416 seconds
cpu usage	4.41765274
max memory	3.42003712E8

stage attributes

key	value
output-size	2059
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, 196 ms] (4) JBCTerminationGraph (5) TerminationGraphToSCCProof [SOUND, 9 ms] (6) TRUE ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class FactSum { public static int factorial(int n){ if (n <=0) return 1; else return n*factorial(n-1); } public static int doSum(int n){ int s=0; while (n >= 0) { s = s + factorial(n); n=n-1; } return s; } public static void main(String[] args) { doSum(10); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class FactSum { public static int factorial(int n){ if (n <=0) return 1; else return n*factorial(n-1); } public static int doSum(int n){ int s=0; while (n >= 0) { s = s + factorial(n); n=n-1; } return s; } public static void main(String[] args) { doSum(10); } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: FactSum.main([Ljava/lang/String;)V: Graph of 682 nodes with 0 SCCs. ---------------------------------------- (5) TerminationGraphToSCCProof (SOUND) Proven termination by absence of SCCs ---------------------------------------- popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Java Bytec 64199