Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744507
details
property
value
status
complete
benchmark
unperfect.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n016.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
10.6100540161 seconds
cpu usage
15.948993698
max memory
4.7177728E8
stage attributes
key
value
output-size
18157
starexec-result
WORST_CASE(Omega(n^1), 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^1), 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^1, max(7 + Arg_0 * max(3 * Arg_0, 6), 7) + nat(Arg_0 * max(3 * Arg_0, 6)) * nat(Arg_0) + max(3 * Arg_0, 3) * nat(Arg_0) + max(3 * Arg_0, 3) + nat(6 * Arg_0) + nat(2 * Arg_0) + max(3, 3 + Arg_0)). (0) CpxIntTrs (1) Loat Proof [FINISHED, 1837 ms] (2) BOUNDS(n^1, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_unperfect_start(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb0_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: TRUE eval_unperfect_bb0_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_0(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: TRUE eval_unperfect_0(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_1(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: TRUE eval_unperfect_1(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb3_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: v_x <= 0 eval_unperfect_1(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb1_in(v__y3_0, v_1, v_8, v_x, v_x, v_y2_1, v_x)) :|: v_x > 0 eval_unperfect_bb1_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb2_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: v_y1_0 - 1 >= 0 && v_y1_0 - 1 <= 0 eval_unperfect_bb1_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb4_in(v__y3_0, v_y1_0 - 1, v_8, v_x, v_y1_0, v_x, v_y3_0)) :|: v_y1_0 - 1 < 0 eval_unperfect_bb1_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb4_in(v__y3_0, v_y1_0 - 1, v_8, v_x, v_y1_0, v_x, v_y3_0)) :|: v_y1_0 - 1 > 0 eval_unperfect_bb2_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb3_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: v_y3_0 < 0 eval_unperfect_bb2_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb3_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: v_y3_0 > 0 eval_unperfect_bb2_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb3_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: v_y3_0 >= 0 && v_y3_0 <= 0 eval_unperfect_bb3_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_stop(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: TRUE eval_unperfect_bb4_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb5_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: v_y2_1 >= v_1 eval_unperfect_bb4_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb6_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: v_y2_1 < v_1 eval_unperfect_bb5_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb4_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1 - v_1, v_y3_0)) :|: TRUE eval_unperfect_bb6_in(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_9(v__y3_0, v_1, v_y3_0 - v_1, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: TRUE eval_unperfect_9(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_10(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: TRUE eval_unperfect_10(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_11(v_8, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: v_y2_1 >= 0 && v_y2_1 <= 0 eval_unperfect_10(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_11(v_y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: v_y2_1 < 0 eval_unperfect_10(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_11(v_y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: v_y2_1 > 0 eval_unperfect_11(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_12(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0)) :|: TRUE eval_unperfect_12(v__y3_0, v_1, v_8, v_x, v_y1_0, v_y2_1, v_y3_0) -> Com_1(eval_unperfect_bb1_in(v__y3_0, v_1, v_8, v_x, v_1, v_y2_1, v__y3_0)) :|: TRUE The start-symbols are:[eval_unperfect_start_7] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: evalunperfectstart 0: evalunperfectstart -> evalunperfectbb0in : [], cost: 1 1: evalunperfectbb0in -> evalunperfect0 : [], cost: 1 2: evalunperfect0 -> evalunperfect1 : [], cost: 1 3: evalunperfect1 -> evalunperfectbb3in : [ 0>=A ], cost: 1 4: evalunperfect1 -> evalunperfectbb1in : B'=A, C'=A, [ A>=1 ], cost: 1 5: evalunperfectbb1in -> evalunperfectbb2in : [ B==1 ], cost: 1 6: evalunperfectbb1in -> evalunperfectbb4in : D'=-1+B, E'=A, [ 0>=B ], cost: 1 7: evalunperfectbb1in -> evalunperfectbb4in : D'=-1+B, E'=A, [ B>=2 ], cost: 1 8: evalunperfectbb2in -> evalunperfectbb3in : [ 0>=1+C ], cost: 1 9: evalunperfectbb2in -> evalunperfectbb3in : [ C>=1 ], cost: 1 10: evalunperfectbb2in -> evalunperfectbb3in : [ C==0 ], cost: 1 11: evalunperfectbb3in -> evalunperfectstop : [], cost: 1 12: evalunperfectbb4in -> evalunperfectbb5in : [ E>=D ], cost: 1 13: evalunperfectbb4in -> evalunperfectbb6in : [ D>=1+E ], cost: 1 14: evalunperfectbb5in -> evalunperfectbb4in : E'=-D+E, [], cost: 1 15: evalunperfectbb6in -> evalunperfect9 : F'=C-D, [], cost: 1 16: evalunperfect9 -> evalunperfect10 : [], cost: 1 17: evalunperfect10 -> evalunperfect11 : G'=F, [ E==0 ], cost: 1 18: evalunperfect10 -> evalunperfect11 : G'=C, [ 0>=1+E ], cost: 1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Compl Integ Trans Syste 26843