Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl C Integ Progr 85445 pair #381745638
details
property
value
status
complete
benchmark
random2d.c
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n087.star.cs.uiowa.edu
space
WTC_V2
run statistics
property
value
solver
AProVE
configuration
c_complexity
runtime (wallclock)
3.24187707901 seconds
cpu usage
4.735841126
max memory
4.05471232E8
stage attributes
key
value
output-size
103720
starexec-result
WORST_CASE(?, O(n^1))
output
/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(n^1)) proof of /export/starexec/sandbox2/output/output_files/bench.koat # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The runtime complexity of the given CpxIntTrs could be proven to be BOUNDS(1, n^1). (0) CpxIntTrs (1) Koat Proof [FINISHED, 1986 ms] (2) BOUNDS(1, n^1) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_random2d_start(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb0_in(v_1, v_2, v_N, v_i.0)) :|: TRUE eval_random2d_bb0_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb1_in(v_1, v_2, v_N, 0)) :|: TRUE eval_random2d_bb1_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb2_in(v_1, v_2, v_N, v_i.0)) :|: v_i.0 < v_N eval_random2d_bb1_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb8_in(v_1, v_2, v_N, v_i.0)) :|: v_i.0 >= v_N eval_random2d_bb2_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_1(v_i.0 + 1, v_2, v_N, v_i.0)) :|: TRUE eval_random2d_1(v_1, v_2, v_N, v_i.0) -> Com_2(eval_nondet_start(v_1, v_2, v_N, v_i.0), eval_random2d_2(v_1, nondef.0, v_N, v_i.0)) :|: TRUE eval_random2d_2(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb3_in(v_1, v_2, v_N, v_i.0)) :|: v_2 >= 0 && v_2 <= 3 eval_random2d_2(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb1_in(v_1, v_2, v_N, v_1)) :|: v_2 < 0 eval_random2d_2(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb1_in(v_1, v_2, v_N, v_1)) :|: v_2 > 3 eval_random2d_bb3_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_NodeBlock9_in(v_1, v_2, v_N, v_i.0)) :|: TRUE eval_random2d_NodeBlock9_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_NodeBlock_in(v_1, v_2, v_N, v_i.0)) :|: v_2 < 2 eval_random2d_NodeBlock9_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_NodeBlock7_in(v_1, v_2, v_N, v_i.0)) :|: v_2 >= 2 eval_random2d_NodeBlock_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_LeafBlock_in(v_1, v_2, v_N, v_i.0)) :|: v_2 < 1 eval_random2d_NodeBlock_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_LeafBlock1_in(v_1, v_2, v_N, v_i.0)) :|: v_2 >= 1 eval_random2d_LeafBlock_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb4_in(v_1, v_2, v_N, v_i.0)) :|: v_2 >= 0 && v_2 <= 0 eval_random2d_LeafBlock_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_NewDefault_in(v_1, v_2, v_N, v_i.0)) :|: v_2 < 0 eval_random2d_LeafBlock_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_NewDefault_in(v_1, v_2, v_N, v_i.0)) :|: v_2 > 0 eval_random2d_bb4_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb1_in(v_1, v_2, v_N, v_1)) :|: TRUE eval_random2d_LeafBlock1_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb5_in(v_1, v_2, v_N, v_i.0)) :|: v_2 >= 1 && v_2 <= 1 eval_random2d_LeafBlock1_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_NewDefault_in(v_1, v_2, v_N, v_i.0)) :|: v_2 < 1 eval_random2d_LeafBlock1_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_NewDefault_in(v_1, v_2, v_N, v_i.0)) :|: v_2 > 1 eval_random2d_bb5_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb1_in(v_1, v_2, v_N, v_1)) :|: TRUE eval_random2d_NodeBlock7_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_LeafBlock3_in(v_1, v_2, v_N, v_i.0)) :|: v_2 < 3 eval_random2d_NodeBlock7_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_LeafBlock5_in(v_1, v_2, v_N, v_i.0)) :|: v_2 >= 3 eval_random2d_LeafBlock3_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb6_in(v_1, v_2, v_N, v_i.0)) :|: v_2 >= 2 && v_2 <= 2 eval_random2d_LeafBlock3_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_NewDefault_in(v_1, v_2, v_N, v_i.0)) :|: v_2 < 2 eval_random2d_LeafBlock3_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_NewDefault_in(v_1, v_2, v_N, v_i.0)) :|: v_2 > 2 eval_random2d_bb6_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb1_in(v_1, v_2, v_N, v_1)) :|: TRUE eval_random2d_LeafBlock5_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb7_in(v_1, v_2, v_N, v_i.0)) :|: v_2 >= 3 && v_2 <= 3 eval_random2d_LeafBlock5_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_NewDefault_in(v_1, v_2, v_N, v_i.0)) :|: v_2 < 3 eval_random2d_LeafBlock5_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_NewDefault_in(v_1, v_2, v_N, v_i.0)) :|: v_2 > 3 eval_random2d_bb7_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb1_in(v_1, v_2, v_N, v_1)) :|: TRUE eval_random2d_NewDefault_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_bb1_in(v_1, v_2, v_N, v_1)) :|: TRUE eval_random2d_bb8_in(v_1, v_2, v_N, v_i.0) -> Com_1(eval_random2d_stop(v_1, v_2, v_N, v_i.0)) :|: TRUE The start-symbols are:[eval_random2d_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 253*ar_1 + 6) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalrandom2dstart(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalrandom2dbb0in(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalrandom2dbb0in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalrandom2dbb1in(0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalrandom2dbb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalrandom2dbb2in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_1 >= ar_0 + 1 ] (Comp: ?, Cost: 1) evalrandom2dbb1in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalrandom2dbb8in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_0 >= ar_1 ] (Comp: ?, Cost: 1) evalrandom2dbb2in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalrandom2d1(ar_0, ar_1, ar_0 + 1, ar_3, ar_4)) (Comp: ?, Cost: 1) evalrandom2d10(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalrandom2d11(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalrandom2d2(ar_0, ar_1, ar_2, ar_4, ar_4)) (Comp: ?, Cost: 1) evalrandom2d1(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_2(evalrandom2d10(ar_0, ar_1, ar_2, ar_3, f), evalrandom2d11(ar_0, ar_1, ar_2, ar_3, f)) (Comp: ?, Cost: 1) evalrandom2d2(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalrandom2dbb3in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_3 >= 0 /\ 3 >= ar_3 ] (Comp: ?, Cost: 1) evalrandom2d2(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalrandom2dbb1in(ar_2, ar_1, ar_2, ar_3, ar_4)) [ 0 >= ar_3 + 1 ] (Comp: ?, Cost: 1) evalrandom2d2(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalrandom2dbb1in(ar_2, ar_1, ar_2, ar_3, ar_4)) [ ar_3 >= 4 ] (Comp: ?, Cost: 1) evalrandom2dbb3in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalrandom2dNodeBlock9in(ar_0, ar_1, ar_2, ar_3, ar_4)) (Comp: ?, Cost: 1) evalrandom2dNodeBlock9in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalrandom2dNodeBlockin(ar_0, ar_1, ar_2, ar_3, ar_4)) [ 1 >= ar_3 ] (Comp: ?, Cost: 1) evalrandom2dNodeBlock9in(ar_0, ar_1, ar_2, ar_3, ar_4) -> Com_1(evalrandom2dNodeBlock7in(ar_0, ar_1, ar_2, ar_3, ar_4)) [ ar_3 >= 2 ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl C Integ Progr 85445