Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744563
details
property
value
status
complete
benchmark
random1d.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n026.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.15950202942 seconds
cpu usage
4.741451182
max memory
2.83164672E8
stage attributes
key
value
output-size
20756
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(n^1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 108 ms] (2) BOUNDS(1, n^1) (3) Loat Proof [FINISHED, 511 ms] (4) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_random1d_start(v_2, v_max, v_x_0) -> Com_1(eval_random1d_bb0_in(v_2, v_max, v_x_0)) :|: TRUE eval_random1d_bb0_in(v_2, v_max, v_x_0) -> Com_1(eval_random1d_0(v_2, v_max, v_x_0)) :|: TRUE eval_random1d_0(v_2, v_max, v_x_0) -> Com_1(eval_random1d_1(v_2, v_max, v_x_0)) :|: TRUE eval_random1d_1(v_2, v_max, v_x_0) -> Com_1(eval_random1d_bb1_in(v_2, v_max, 1)) :|: v_max > 0 eval_random1d_1(v_2, v_max, v_x_0) -> Com_1(eval_random1d_bb3_in(v_2, v_max, v_x_0)) :|: v_max <= 0 eval_random1d_bb1_in(v_2, v_max, v_x_0) -> Com_1(eval_random1d_bb2_in(v_2, v_max, v_x_0)) :|: v_x_0 <= v_max eval_random1d_bb1_in(v_2, v_max, v_x_0) -> Com_1(eval_random1d_bb3_in(v_2, v_max, v_x_0)) :|: v_x_0 > v_max eval_random1d_bb2_in(v_2, v_max, v_x_0) -> Com_1(eval_random1d_2(v_2, v_max, v_x_0)) :|: TRUE eval_random1d_2(v_2, v_max, v_x_0) -> Com_1(eval_random1d_3(nondef_0, v_max, v_x_0)) :|: TRUE eval_random1d_3(v_2, v_max, v_x_0) -> Com_1(eval_random1d_bb1_in(v_2, v_max, v_x_0 + 1)) :|: v_2 > 0 eval_random1d_3(v_2, v_max, v_x_0) -> Com_1(eval_random1d_bb1_in(v_2, v_max, v_x_0 + 1)) :|: v_2 <= 0 eval_random1d_bb3_in(v_2, v_max, v_x_0) -> Com_1(eval_random1d_stop(v_2, v_max, v_x_0)) :|: TRUE The start-symbols are:[eval_random1d_start_3] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 5*ar_0 + 19) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalrandom1dstart(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dbb0in(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalrandom1dbb0in(ar_0, ar_1, ar_2) -> Com_1(evalrandom1d0(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalrandom1d0(ar_0, ar_1, ar_2) -> Com_1(evalrandom1d1(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalrandom1d1(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dbb1in(ar_0, 1, ar_2)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalrandom1d1(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dbb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalrandom1dbb1in(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dbb2in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalrandom1dbb1in(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dbb3in(ar_0, ar_1, ar_2)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalrandom1dbb2in(ar_0, ar_1, ar_2) -> Com_1(evalrandom1d2(ar_0, ar_1, ar_2)) (Comp: ?, Cost: 1) evalrandom1d2(ar_0, ar_1, ar_2) -> Com_1(evalrandom1d3(ar_0, ar_1, d)) (Comp: ?, Cost: 1) evalrandom1d3(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dbb1in(ar_0, ar_1 + 1, ar_2)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) evalrandom1d3(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dbb1in(ar_0, ar_1 + 1, ar_2)) [ 0 >= ar_2 ] (Comp: ?, Cost: 1) evalrandom1dbb3in(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dstop(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dstart(ar_0, ar_1, ar_2)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Repeatedly propagating knowledge in problem 1 produces the following problem: 2: T: (Comp: 1, Cost: 1) evalrandom1dstart(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dbb0in(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evalrandom1dbb0in(ar_0, ar_1, ar_2) -> Com_1(evalrandom1d0(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evalrandom1d0(ar_0, ar_1, ar_2) -> Com_1(evalrandom1d1(ar_0, ar_1, ar_2)) (Comp: 1, Cost: 1) evalrandom1d1(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dbb1in(ar_0, 1, ar_2)) [ ar_0 >= 1 ] (Comp: 1, Cost: 1) evalrandom1d1(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dbb3in(ar_0, ar_1, ar_2)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalrandom1dbb1in(ar_0, ar_1, ar_2) -> Com_1(evalrandom1dbb2in(ar_0, ar_1, ar_2)) [ ar_0 >= ar_1 ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843