Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Compl Integ Trans Syste 26843 pair #381744721
details
property
value
status
complete
benchmark
speedFails2.c.koat
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
Flores-Montoya_16
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
2.56926989555 seconds
cpu usage
5.258460824
max memory
3.5366912E8
stage attributes
key
value
output-size
7076
starexec-result
WORST_CASE(NON_POLY, ?)
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.koat /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) 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(INF, INF). (0) CpxIntTrs (1) Loat Proof [FINISHED, 429 ms] (2) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_speedFails2_start(v_i_0, v_n, v_x) -> Com_1(eval_speedFails2_bb0_in(v_i_0, v_n, v_x)) :|: TRUE eval_speedFails2_bb0_in(v_i_0, v_n, v_x) -> Com_1(eval_speedFails2_0(v_i_0, v_n, v_x)) :|: TRUE eval_speedFails2_0(v_i_0, v_n, v_x) -> Com_1(eval_speedFails2_1(v_i_0, v_n, v_x)) :|: TRUE eval_speedFails2_1(v_i_0, v_n, v_x) -> Com_1(eval_speedFails2_2(v_i_0, v_n, v_x)) :|: TRUE eval_speedFails2_2(v_i_0, v_n, v_x) -> Com_1(eval_speedFails2_3(v_i_0, v_n, v_x)) :|: TRUE eval_speedFails2_3(v_i_0, v_n, v_x) -> Com_1(eval_speedFails2_4(v_i_0, v_n, v_x)) :|: TRUE eval_speedFails2_4(v_i_0, v_n, v_x) -> Com_1(eval_speedFails2_bb1_in(v_x, v_n, v_x)) :|: TRUE eval_speedFails2_bb1_in(v_i_0, v_n, v_x) -> Com_1(eval_speedFails2_bb2_in(v_i_0, v_n, v_x)) :|: v_i_0 < v_n eval_speedFails2_bb1_in(v_i_0, v_n, v_x) -> Com_1(eval_speedFails2_bb2_in(v_i_0, v_n, v_x)) :|: v_i_0 > v_n eval_speedFails2_bb1_in(v_i_0, v_n, v_x) -> Com_1(eval_speedFails2_bb3_in(v_i_0, v_n, v_x)) :|: v_i_0 >= v_n && v_i_0 <= v_n eval_speedFails2_bb2_in(v_i_0, v_n, v_x) -> Com_1(eval_speedFails2_bb1_in(v_i_0 + 1, v_n, v_x)) :|: TRUE eval_speedFails2_bb3_in(v_i_0, v_n, v_x) -> Com_1(eval_speedFails2_stop(v_i_0, v_n, v_x)) :|: TRUE The start-symbols are:[eval_speedFails2_start_3] ---------------------------------------- (1) Loat Proof (FINISHED) ### Pre-processing the ITS problem ### Initial linear ITS problem Start location: evalspeedFails2start 0: evalspeedFails2start -> evalspeedFails2bb0in : [], cost: 1 1: evalspeedFails2bb0in -> evalspeedFails20 : [], cost: 1 2: evalspeedFails20 -> evalspeedFails21 : [], cost: 1 3: evalspeedFails21 -> evalspeedFails22 : [], cost: 1 4: evalspeedFails22 -> evalspeedFails23 : [], cost: 1 5: evalspeedFails23 -> evalspeedFails24 : [], cost: 1 6: evalspeedFails24 -> evalspeedFails2bb1in : A'=B, [], cost: 1 7: evalspeedFails2bb1in -> evalspeedFails2bb2in : [ C>=1+A ], cost: 1 8: evalspeedFails2bb1in -> evalspeedFails2bb2in : [ A>=1+C ], cost: 1 9: evalspeedFails2bb1in -> evalspeedFails2bb3in : [ A==C ], cost: 1 10: evalspeedFails2bb2in -> evalspeedFails2bb1in : A'=1+A, [], cost: 1 11: evalspeedFails2bb3in -> evalspeedFails2stop : [], cost: 1 Removed unreachable and leaf rules: Start location: evalspeedFails2start 0: evalspeedFails2start -> evalspeedFails2bb0in : [], cost: 1 1: evalspeedFails2bb0in -> evalspeedFails20 : [], cost: 1 2: evalspeedFails20 -> evalspeedFails21 : [], cost: 1 3: evalspeedFails21 -> evalspeedFails22 : [], cost: 1 4: evalspeedFails22 -> evalspeedFails23 : [], cost: 1 5: evalspeedFails23 -> evalspeedFails24 : [], cost: 1 6: evalspeedFails24 -> evalspeedFails2bb1in : A'=B, [], cost: 1 7: evalspeedFails2bb1in -> evalspeedFails2bb2in : [ C>=1+A ], cost: 1 8: evalspeedFails2bb1in -> evalspeedFails2bb2in : [ A>=1+C ], 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