details

property	value
status	complete
benchmark	realheapsort.c
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n079.star.cs.uiowa.edu
space	WTC_V2

run statistics

property	value
solver	AProVE
configuration	c_complexity
runtime (wallclock)	99.8581960201 seconds
cpu usage	102.20236244
max memory	7.69880064E8

stage attributes

key	value
output-size	3868066
starexec-result	WORST_CASE(?, ?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_c_complexity /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, ?) 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, EXP). (0) CpxIntTrs (1) Koat Proof [FINISHED, 98.5 s] (2) BOUNDS(1, EXP) ---------------------------------------- (0) Obligation: Complexity Int TRS consisting of the following rules: eval_realheapsort_start(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb0_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_bb0_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb1_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, 1, v_k.1, v_m.0)) :|: v_N > 2 eval_realheapsort_bb0_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb15_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_N <= 2 eval_realheapsort_bb1_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb2_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_k.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_k.0 <= v_N - 1 eval_realheapsort_bb1_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb5_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, 0, v_m.0)) :|: v_k.0 > v_N - 1 eval_realheapsort_bb2_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb3_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_j.0 > 0 eval_realheapsort_bb2_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_.critedge_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_j.0 <= 0 eval_realheapsort_bb3_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_2(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_2(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_2(eval_nondet_start(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0), eval_realheapsort_3(v_25, v_26, v_32, v_33, nondef.0, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_3(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_2(eval_nondet_start(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0), eval_realheapsort_4(v_25, v_26, v_32, v_33, v_4, nondef.1, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_4(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb4_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_4 > v_5 eval_realheapsort_4(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_.critedge_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_4 <= v_5 eval_realheapsort_bb4_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_5(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_5(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_2(eval_nondet_start(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0), eval_realheapsort_6(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_6(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb2_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, nondef.3 - 1, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_j.0 + 1 >= 0 && v_j.0 + 1 <= 0 && nondef.3 >= 0 && nondef.3 <= 0 eval_realheapsort_6(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb2_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, nondef.3 - 1, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_j.0 + 1 > 0 && nondef.3 >= 0 && nondef.3 < v_j.0 + 1 eval_realheapsort_6(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb2_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, nondef.3 - 1, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_j.0 + 1 < 0 && nondef.3 <= 0 && nondef.3 > v_j.0 + 1 eval_realheapsort_.critedge_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb1_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0 + 1, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_bb5_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb6_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_k.1 <= v_N - 2 eval_realheapsort_bb5_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb15_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_k.1 > v_N - 2 eval_realheapsort_bb6_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_14(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_14(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_2(eval_nondet_start(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0), eval_realheapsort_15(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_15(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb7_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, 0, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_bb7_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb8_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: 2 * v_j.1 + 1 <= v_N - v_k.1 - 2 eval_realheapsort_bb7_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb14_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: 2 * v_j.1 + 1 > v_N - v_k.1 - 2 eval_realheapsort_bb8_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb10_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: 2 * v_j.1 + 1 >= v_N - v_k.1 - 2 && 2 * v_j.1 + 1 <= v_N - v_k.1 - 2 eval_realheapsort_bb8_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb9_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: 2 * v_j.1 + 1 < v_N - v_k.1 - 2 eval_realheapsort_bb8_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb9_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: 2 * v_j.1 + 1 > v_N - v_k.1 - 2 eval_realheapsort_bb9_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_26(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_26(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_2(eval_nondet_start(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0), eval_realheapsort_27(nondef.5, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_27(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_2(eval_nondet_start(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0), eval_realheapsort_28(v_25, nondef.6, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_28(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb10_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_25 < v_26 eval_realheapsort_28(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb11_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_25 >= v_26 eval_realheapsort_bb10_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb12_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, 2 * v_j.1 + 1)) :|: TRUE eval_realheapsort_bb11_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb12_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, 2 * v_j.1 + 2)) :|: TRUE eval_realheapsort_bb12_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_35(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_35(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_2(eval_nondet_start(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0), eval_realheapsort_36(v_25, v_26, nondef.7, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_36(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_2(eval_nondet_start(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0), eval_realheapsort_37(v_25, v_26, v_32, nondef.8, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_37(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb13_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: v_32 > v_33 eval_realheapsort_37(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb7_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_N, v_k.0, v_k.1, v_m.0)) :|: v_32 <= v_33 eval_realheapsort_bb13_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_38(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_38(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_2(eval_nondet_start(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0), eval_realheapsort_39(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_39(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb7_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_m.0, v_k.0, v_k.1, v_m.0)) :|: TRUE eval_realheapsort_bb14_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_bb5_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1 + 1, v_m.0)) :|: TRUE eval_realheapsort_bb15_in(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0) -> Com_1(eval_realheapsort_stop(v_25, v_26, v_32, v_33, v_4, v_5, v_N, v_j.0, v_j.1, v_k.0, v_k.1, v_m.0)) :|: TRUE The start-symbols are:[eval_realheapsort_start_12] ---------------------------------------- (1) Koat Proof (FINISHED) YES(?, 14 * pow(2, 20*ar_0 + 14) * (12*ar_0 + 12) + 14 * pow(2, ar_0 + 1) + pow(2, 20*ar_0 + 14) * (36*ar_0 + 36) + pow(2, ar_0 + 1) * 3 + 2 * pow(2, 20*ar_0 + 14) * (48*ar_0 + 48) + 2 * pow(2, ar_0 + 1) * 4 + 4 * pow(2, 20*ar_0 + 14) * (24*ar_0 + 24) + 4 * pow(2, ar_0 + 1) * 2 + 10 * pow(2, 40*ar_0 + 28) * (2880*ar_0^2 + 5760*ar_0 + 2880) + 10 * pow(2, 20*ar_0 + 14 + ar_0 + 1) * (240*ar_0 + 240) + 10 * pow(2, 20*ar_0 + 14) * (144*ar_0 + 144) + 10 * pow(2, ar_0 + 1 + 20*ar_0 + 14) * (240*ar_0 + 240) + 10 * pow(2, 2*ar_0 + 2) * 20 + 10 * pow(2, ar_0 + 1) * 12 + 168*ar_0 + 204) Initial complexity problem: 1: T: (Comp: ?, Cost: 1) evalrealheapsortstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12) -> Com_1(evalrealheapsortbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12)) (Comp: ?, Cost: 1) evalrealheapsortbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12) -> Com_1(evalrealheapsortbb1in(ar_0, 1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12)) [ ar_0 >= 3 ] (Comp: ?, Cost: 1) evalrealheapsortbb0in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12) -> Com_1(evalrealheapsortbb15in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12)) [ 2 >= ar_0 ] (Comp: ?, Cost: 1) evalrealheapsortbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12) -> Com_1(evalrealheapsortbb2in(ar_0, ar_1, ar_1, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12)) [ ar_0 >= ar_1 + 1 ] (Comp: ?, Cost: 1) evalrealheapsortbb1in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12) -> Com_1(evalrealheapsortbb5in(ar_0, ar_1, ar_2, 0, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12)) [ ar_1 >= ar_0 ] (Comp: ?, Cost: 1) evalrealheapsortbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12) -> Com_1(evalrealheapsortbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12)) [ ar_2 >= 1 ] (Comp: ?, Cost: 1) evalrealheapsortbb2in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12) -> Com_1(evalrealheapsortcritedgein(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12)) [ 0 >= ar_2 ] (Comp: ?, Cost: 1) evalrealheapsortbb3in(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12) -> Com_1(evalrealheapsort2(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12)) (Comp: ?, Cost: 1) evalrealheapsort20(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12) -> Com_1(evalnondetstart(ar_0, ar_1, ar_2, ar_3, ar_4, ar_5, ar_6, ar_7, ar_8, ar_9, ar_10, ar_11, ar_12)) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Compl C Integ Progr 85445