details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.35517692566 seconds
cpu usage	9.139803723
max memory	4.83991552E8

stage attributes

key	value
output-size	5518
starexec-result	NO

output

/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.jar /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO 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 disproven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 97 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 523 ms] (4) JBCTerminationGraph (5) JBCNonTerm [COMPLETE, 53 ms] (6) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class UpAndDown { public static void upAndDown(int i, boolean up) { if (0 <= i && i <= 10) { if (i == 10) up = false; if (i == 0) up = true; if (up) i++; else i--; upAndDown(i, up); } } public static void main(String[] args) { upAndDown(args.length, false); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class UpAndDown { public static void upAndDown(int i, boolean up) { if (0 <= i && i <= 10) { if (i == 10) up = false; if (i == 0) up = true; if (up) i++; else i--; upAndDown(i, up); } } public static void main(String[] args) { upAndDown(args.length, false); } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: UpAndDown.main([Ljava/lang/String;)V: Graph of 15 nodes with 0 SCCs. UpAndDown.upAndDown(IZ)V: Graph of 75 nodes with 0 SCCs. ---------------------------------------- (5) JBCNonTerm (COMPLETE) Reached a loop using the following run: 0:<UpAndDown.main||0: load ADDR #0||#0: a2|| -> a2([java.lang.String...]): length 1 -->{java.lang.Object...} popout

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

job log

popout

actions

all output return to Java Bytec 64199