Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Java Bytec 64199 pair #381919277
details
property
value
status
complete
benchmark
upAndDownIneq_rec.jar
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n046.star.cs.uiowa.edu
space
Julia_12_recursive
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.12694120407 seconds
cpu usage
8.429866032
max memory
6.00174592E8
stage attributes
key
value
output-size
5211
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 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) JBCNonTerm [COMPLETE, 480 ms] (4) NO ---------------------------------------- (0) Obligation: need to prove termination of the following program: public class UpAndDownIneq { public static void upAndDown(int i, int up) { while (0 <= i && i <= 10) { if (i >= 10) up = 0; if (i <= 0) up = 1; if (up >= 1) i++; else i--; upAndDown(i, up); } } public static void main(String[] args) { upAndDown(args.length, 0); } } ---------------------------------------- (1) BareJBCToJBCProof (EQUIVALENT) initialized classpath ---------------------------------------- (2) Obligation: need to prove termination of the following program: public class UpAndDownIneq { public static void upAndDown(int i, int up) { while (0 <= i && i <= 10) { if (i >= 10) up = 0; if (i <= 0) up = 1; if (up >= 1) i++; else i--; upAndDown(i, up); } } public static void main(String[] args) { upAndDown(args.length, 0); } } ---------------------------------------- (3) JBCNonTerm (COMPLETE) Reached a loop using the following run: 0:<UpAndDownIneq.main||0: load ADDR #0||#0: a2|| -> a2([java.lang.String...]): length 1 -->{java.lang.Object...} YES: (JL1) 1:<UpAndDownIneq.main||1: arraylength|| - ||a2> a2([java.lang.String...]): length 1 -->{java.lang.Object...} YES: (JL1) 2:<UpAndDownIneq.main||2: push 0|| - ||1> YES: (JL1) 3:<UpAndDownIneq.main||3: UpAndDownIneq.upAndDown(II)V|| - ||1, 0> YES: (JL1) 4:<UpAndDownIneq.upAndDown||0: push 0||#0: 1, #1: 0|| -> YES: (JL1) Start state of loop: [i41(lv_0_0), i42(lv_0_1)] <UpAndDownIneq.upAndDown||0: push 0||#0: i41, #1: i43|| -> i41: [0,+inf)(l1) i42: [0,1](1,1) i43: [0,1](1,1) YES: (JL1) In the loop head node, references [i41, i42, i43] were interesting.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Java Bytec 64199