Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744617
details
property
value
status
complete
benchmark
cousot9.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n082.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.51943087578 seconds
cpu usage
5.560939379
max memory
3.38812928E8
stage attributes
key
value
output-size
37805
starexec-result
WORST_CASE(Omega(n^2), O(n^2))
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.koat /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^2), O(n^2)) proof of /export/starexec/sandbox2/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^2, n^2). (0) CpxIntTrs (1) Koat Proof [FINISHED, 228 ms] (2) BOUNDS(1, n^2) (3) Loat Proof [FINISHED, 839 ms] (4) BOUNDS(n^2, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_cousot9_start(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_bb0_in(v__0, v_N, v_i_0, v_j)) :|: TRUE eval_cousot9_bb0_in(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_0(v__0, v_N, v_i_0, v_j)) :|: TRUE eval_cousot9_0(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_1(v__0, v_N, v_i_0, v_j)) :|: TRUE eval_cousot9_1(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_2(v__0, v_N, v_i_0, v_j)) :|: TRUE eval_cousot9_2(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_3(v__0, v_N, v_i_0, v_j)) :|: TRUE eval_cousot9_3(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_4(v__0, v_N, v_i_0, v_j)) :|: TRUE eval_cousot9_4(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_5(v__0, v_N, v_i_0, v_j)) :|: TRUE eval_cousot9_5(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_6(v__0, v_N, v_i_0, v_j)) :|: TRUE eval_cousot9_6(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_bb1_in(v_j, v_N, v_N, v_j)) :|: TRUE eval_cousot9_bb1_in(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_bb2_in(v__0, v_N, v_i_0, v_j)) :|: v_i_0 > 0 eval_cousot9_bb1_in(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_bb3_in(v__0, v_N, v_i_0, v_j)) :|: v_i_0 <= 0 eval_cousot9_bb2_in(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_bb1_in(v__0 - 1, v_N, v_i_0, v_j)) :|: v__0 > 0 eval_cousot9_bb2_in(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_bb1_in(v_N, v_N, v_i_0, v_j)) :|: v__0 > 0 && v__0 <= 0 eval_cousot9_bb2_in(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_bb1_in(v__0 - 1, v_N, v_i_0 - 1, v_j)) :|: v__0 <= 0 && v__0 > 0 eval_cousot9_bb2_in(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_bb1_in(v_N, v_N, v_i_0 - 1, v_j)) :|: v__0 <= 0 eval_cousot9_bb3_in(v__0, v_N, v_i_0, v_j) -> Com_1(eval_cousot9_stop(v__0, v_N, v_i_0, v_j)) :|: TRUE The start-symbols are:[eval_cousot9_start_4] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 2*ar_3 + 2*ar_3^2 + 2*ar_1 + 14) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalcousot9start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot9bb0in(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalcousot9bb0in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot90(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalcousot90(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot91(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalcousot91(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot92(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalcousot92(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot93(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalcousot93(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot94(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalcousot94(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot95(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalcousot95(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot96(ar_0, ar_1, ar_2, ar_3)) (Comp: ?, Cost: 1) evalcousot96(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot9bb1in(ar_1, ar_1, ar_3, ar_3)) (Comp: ?, Cost: 1) evalcousot9bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot9bb2in(ar_0, ar_1, ar_2, ar_3)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) evalcousot9bb1in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot9bb3in(ar_0, ar_1, ar_2, ar_3)) [ 0 >= ar_2 ] (Comp: ?, Cost: 1) evalcousot9bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot9bb1in(ar_0 - 1, ar_1, ar_2, ar_3)) [ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalcousot9bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot9bb1in(ar_3, ar_1, ar_2, ar_3)) [ ar_0 >= 1 /\ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalcousot9bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot9bb1in(ar_0 - 1, ar_1, ar_2 - 1, ar_3)) [ 0 >= ar_0 /\ ar_0 >= 1 ] (Comp: ?, Cost: 1) evalcousot9bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot9bb1in(ar_3, ar_1, ar_2 - 1, ar_3)) [ 0 >= ar_0 ] (Comp: ?, Cost: 1) evalcousot9bb3in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot9stop(ar_0, ar_1, ar_2, ar_3)) (Comp: 1, Cost: 0) koat_start(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot9start(ar_0, ar_1, ar_2, ar_3)) [ 0 <= 0 ] start location: koat_start leaf cost: 0 Testing for reachability in the complexity graph removes the following transitions from problem 1: evalcousot9bb2in(ar_0, ar_1, ar_2, ar_3) -> Com_1(evalcousot9bb1in(ar_3, ar_1, ar_2, ar_3)) [ ar_0 >= 1 /\ 0 >= ar_0 ]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843