details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.47266292572 seconds
cpu usage	5.639915201
max memory	4.30358528E8

stage attributes

key	value
output-size	3525
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.jar /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO proof of /export/starexec/sandbox2/benchmark/theBenchmark.jar # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty termination of the given Bare JBC problem could be disproven: (0) Bare JBC problem (1) BareJBCToJBCProof [EQUIVALENT, 96 ms] (2) JBC problem (3) JBCToGraph [EQUIVALENT, 295 ms] (4) JBCTerminationGraph (5) JBCNonTerm [COMPLETE, 124 ms] (6) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class NO_12 { public static void main(String args[]) { int j = 0; for (int i = 0; i <= j; i++) if (j-i < 1) j += 2; } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class NO_12 { public static void main(String args[]) { int j = 0; for (int i = 0; i <= j; i++) if (j-i < 1) j += 2; } } ---------------------------------------- (3) JBCToGraph (EQUIVALENT) Constructed TerminationGraph. ---------------------------------------- (4) Obligation: Termination Graph based on JBC Program: NO_12.main([Ljava/lang/String;)V: Graph of 30 nodes with 1 SCC. ---------------------------------------- (5) JBCNonTerm (COMPLETE) Reached a loop using the following run: 0:<NO_12.main||0: push 0|| - || -> YES: (JL1) 1:<NO_12.main||1: store INT to #1|| - ||0> YES: (JL1) 2:<NO_12.main||2: push 0||#1: 0|| -> YES: (JL1) 3:<NO_12.main||3: store INT to #2||#1: 0||0> YES: (JL1) 4:<NO_12.main||4: load INT #2||#1: 0, #2: 0|| -> YES: (JL1) Start state of loop: [o30(lv_0_0)] <NO_12.main||4: load INT #2||#1: i35, #2: i36|| -> o30([java.lang.String...]): Object() -->{java.lang.Object...} i35: [0,+inf)(l3) i36: [0,+inf)(l5) YES: (JL1) In the loop head node, references [i36, i35] were interesting. All methods calls in the loop body are side-effect free, hence they can be ignored. By SMT, we could prove popout

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

job log

popout

actions

all output return to Java_Bytecode