[Cbc] What is trap 6 error (i.e. cbc-mip: line 13: 6790 Abort trap: 6 ) in CBC 2.9.3 and 2.9.4?

Sat Apr 4 21:25:07 EDT 2015

Hi,

Here's the mps (zip file) of the model.

Thanks in advance.

Noli

On 4/5/15, Noli Sicad <nsicad at gmail.com> wrote:
> Hi,
>
> I develop this MIP problem in forest timber harvesting;
>
> 59833 rows, 10010 columns, 154827 non-zeros
> 10000 integer variables, all of which are binary
>
> I got this error (below) using the CBC solver 2.9.3 and 2.9.4.
>
> What is trap 6 error (i.e. cbc-mip: line 13:  6790 Abort trap: 6 ) in
> CBC 2.9.3 and 2.9.4?
>
> How can I get a solution on this problem?
>
> I can send the mps or lp format in this problem, if somebody likes to
> investigate this problem.
>
> Thanks.
>
> Noli
>
> ~~~~~~~~~~~~~~
> cbc0038I Mini branch and bound did not improve solution (102.62 seconds)
> Cbc0038I After 102.62 seconds - Feasibility pump exiting with
> objective of -69256.4 - took 24.29 seconds
> Cbc0012I Integer solution of -69256.4 found by feasibility pump after
> 0 iterations and 0 nodes (102.66 seconds)
> Cbc0038I Full problem 18513 rows 10008 columns, reduced to 880 rows 764
> columns
> Assertion failed: (nErrors), function resetFakeBounds, file
> ClpSimplexDual.cpp, line 7684.
> Cbc0031I 78 added rows had average density of 7.5641026
> Cbc0013I At root node, 78 cuts changed objective from -78495.66 to
> -78454.48 in 4 passes
> Cbc0014I Cut generator 0 (Probing) - 0 row cuts average 0.0 elements,
> 0 column cuts (0 active)  in 0.818 seconds - new frequency is -100
> Cbc0014I Cut generator 1 (Gomory) - 270 row cuts average 20.4
> elements, 0 column cuts (0 active)  in 1.726 seconds - new frequency
> is 1
> Cbc0014I Cut generator 2 (Knapsack) - 0 row cuts average 0.0 elements,
> 0 column cuts (0 active)  in 0.416 seconds - new frequency is -100
> Cbc0014I Cut generator 3 (Clique) - 77 row cuts average 3.0 elements,
> 0 column cuts (0 active)  in 0.091 seconds - new frequency is 1
> Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 0 row cuts average
> 0.0 elements, 0 column cuts (0 active)  in 0.381 seconds - new
> frequency is -100
> Cbc0014I Cut generator 5 (FlowCover) - 0 row cuts average 0.0
> elements, 0 column cuts (0 active)  in 0.048 seconds - new frequency
> is -100
> Cbc0014I Cut generator 6 (TwoMirCuts) - 256 row cuts average 22.3
> elements, 0 column cuts (0 active)  in 2.156 seconds - new frequency
> is -100
> Cbc0010I After 0 nodes, 1 on tree, -69256.4 best solution, best
> possible -78454.48 (122.58 seconds)
> /Users/nsicad/.config/gedit/tools/cbc-mathprog---no-proximity: line
> 13: 74314 Abort trap: 6           /usr/local/bin/cbc
> $GEDIT_CURRENT_DOCUMENT_NAME% -randomCbcSeed 0 -randomSeed 0 -threads
> 8 -printi csv -solve -solu solution_new_cbc_.csv
>
> real	10m38.135s
> user	5m2.847s
> sys	0m6.116s
>
> Exited: 34304
> Cbc0010I After 14500 nodes, 7271 on trAssertion failed: (nErrors),
> function resetFakeBounds, file ClpSimplexDual.cpp, line 7684.
> ee, 1e+50 best solution, best possible -62538.334 (5807.20 seconds)
> Cbc0010I After 14600 nodes, 7322 on tree, 1e+50 best solution, best
> possible -62538.331 (5846.26 seconds)
> Cbc0010I After 14700 nodes, 7371 on tree, 1e+50 best solution, best
> possible -62538.329 (5877.64 seconds)
> Cbc0010I After 14800 nodes, 7421 on tree, 1e+50 best solution, best
> possible -62538.325 (5920.90 seconds)
> Cbc0010I After 14900 nodes, 7471 on tree, 1e+50 best solution, best
> possible -62538.321 (5952.81 seconds)
> Cbc0010I After 15000 nodes, 7523 on tree, 1e+50 best solution, best
> possible -62538.316 (5981.10 seconds)
> Cbc0010I After 15100 nodes, 7571 on tree, 1e+50 best solution, best
> possible -62538.312 (6012.22 seconds)
> Cbc0010I After 15200 nodes, 7623 on tree, 1e+50 best solution, best
> possible -62538.311 (6052.64 seconds)
> Cbc0010I After 15300 nodes, 7672 on tree, 1e+50 best solution, best
> possible -62538.31 (6088.49 seconds)
> Cbc0010I After 15400 nodes, 7722 on tree, 1e+50 best solution, best
> possible -62538.305 (6117.58 seconds)
> Cbc0010I After 15500 nodes, 7772 on tree, 1e+50 best solution, best
> possible -62538.302 (6145.16 seconds)
> Cbc0010I After 15600 nodes, 7821 on tree, 1e+50 best solution, best
> possible -62538.298 (6171.39 seconds)
> Cbc0010I After 15700 nodes, 7872 on tree, 1e+50 best solution, best
> possible -62538.296 (6199.99 seconds)
> Cbc0010I After 15800 nodes, 7922 on tree, 1e+50 best solution, best
> possible -62538.292 (6230.29 seconds)
> Cbc0010I After 15900 nodes, 7972 on tree, 1e+50 best solution, best
> possible -62538.29 (6256.87 seconds)
> Cbc0010I After 16000 nodes, 8021 on tree, 1e+50 best solution, best
> possible -62538.288 (6285.50 seconds)
> Cbc0010I After 16100 nodes, 8070 on tree, 1e+50 best solution, best
> possible -62538.285 (6313.59 seconds)
> Cbc0010I After 16200 nodes, 8122 on tree, 1e+50 best solution, best
> possible -62538.283 (6343.51 seconds)
> Cbc0010I After 16300 nodes, 8172 on tree, 1e+50 best solution, best
> possible -62538.283 (6374.74 seconds)
> Cbc0010I After 16400 nodes, 8221 on tree, 1e+50 best solution, best
> possible -62538.282 (6406.28 seconds)
> Cbc0010I After 16500 nodes, 8273 on tree, 1e+50 best solution, best
> possible -62538.282 (6439.69 seconds)
> Cbc0010I After 16600 nodes, 8323 on tree, 1e+50 best solution, best
> possible -62538.281 (6469.96 seconds)
> Cbc0010I After 16700 nodes, 8372 on tree, 1e+50 best solution, best
> possible -62538.28 (6503.11 seconds)
> Cbc0010I After 16800 nodes, 8422 on tree, 1e+50 best solution, best
> possible -62538.28 (6535.04 seconds)
> Cbc0010I After 16900 nodes, 8472 on tree, 1e+50 best solution, best
> possible -62538.267 (6567.77 seconds)
> Cbc0010I After 17000 nodes, 8522 on tree, 1e+50 best solution, best
> possible -62538.265 (6597.30 seconds)
> Cbc0010I After 17100 nodes, 8573 on tree, 1e+50 best solution, best
> possible -62538.262 (6626.52 seconds)
> Cbc0010I After 17200 nodes, 8621 on tree, 1e+50 best solution, best
> possible -62538.26 (6666.35 seconds)
> Cbc0010I After 17300 nodes, 8672 on tree, 1e+50 best solution, best
> possible -62538.259 (6701.98 seconds)
> Cbc0010I After 17400 nodes, 8721 on tree, 1e+50 best solution, best
> possible -62538.256 (6733.32 seconds)
> Cbc0010I After 17500 nodes, 8772 on tree, 1e+50 best solution, best
> possible -62538.255 (6766.79 seconds)
> Cbc0010I After 17600 nodes, 8822 on tree, 1e+50 best solution, best
> possible -62538.253 (6794.21 seconds)
> Cbc0010I After 17700 nodes, 8872 on tree, 1e+50 best solution, best
> possible -62538.252 (6832.60 seconds)
> Cbc0010I After 17800 nodes, 8922 on tree, 1e+50 best solution, best
> possible -62538.251 (6868.35 seconds)
> Cbc0010I After 17900 nodes, 8970 on tree, 1e+50 best solution, best
> possible -62538.248 (6900.57 seconds)
> Cbc0010I After 18000 nodes, 9022 on tree, 1e+50 best solution, best
> possible -62538.246 (6935.64 seconds)
> Cbc0010I After 18100 nodes, 9073 on tree, 1e+50 best solution, best
> possible -62538.246 (6969.87 seconds)
> Cbc0010I After 18200 nodes, 9123 on tree, 1e+50 best solution, best
> possible -62538.244 (7001.24 seconds)
> Cbc0010I After 18300 nodes, 9172 on tree, 1e+50 best solution, best
> possible -62538.242 (7035.63 seconds)
> Cbc0010I After 18400 nodes, 9223 on tree, 1e+50 best solution, best
> possible -62538.24 (7066.42 seconds)
> Cbc0010I After 18500 nodes, 9272 on tree, 1e+50 best solution, best
> possible -62538.239 (7095.79 seconds)
> Cbc0010I After 18600 nodes, 9321 on tree, 1e+50 best solution, best
> possible -62538.237 (7122.76 seconds)
> Cbc0010I After 18700 nodes, 9372 on tree, 1e+50 best solution, best
> possible -62538.236 (7155.76 seconds)
> Cbc0010I After 18800 nodes, 9421 on tree, 1e+50 best solution, best
> possible -62538.235 (7184.47 seconds)
> Cbc0010I After 18900 nodes, 9472 on tree, 1e+50 best solution, best
> possible -62538.233 (7216.04 seconds)
> Cbc0010I After 19000 nodes, 9520 on tree, 1e+50 best solution, best
> possible -62538.232 (7249.15 seconds)
> Cbc0010I After 19100 nodes, 9571 on tree, 1e+50 best solution, best
> possible -62538.229 (7283.11 seconds)
> Cbc0010I After 19200 nodes, 9622 on tree, 1e+50 best solution, best
> possible -62538.227 (7307.77 seconds)
> Cbc0010I After 19300 nodes, 9672 on tree, 1e+50 best solution, best
> possible -62538.227 (7337.85 seconds)
> Cbc0010I After 19400 nodes, 9721 on tree, 1e+50 best solution, best
> possible -62538.224 (7368.86 seconds)
> Cbc0010I After 19500 nodes, 9773 on tree, 1e+50 best solution, best
> possible -62538.222 (7403.59 seconds)
> Cbc0010I After 19600 nodes, 9821 on tree, 1e+50 best solution, best
> possible -62538.221 (7447.64 seconds)
> Cbc0010I After 19700 nodes, 9872 on tree, 1e+50 best solution, best
> possible -62538.219 (7477.64 seconds)
> Cbc0010I After 19800 nodes, 9923 on tree, 1e+50 best solution, best
> possible -62538.219 (7506.99 seconds)
> Cbc0010I After 19900 nodes, 9971 on tree, 1e+50 best solution, best
> possible -62538.217 (7541.07 seconds)
> Cbc0010I After 20000 nodes, 10022 on tree, 1e+50 best solution, best
> possible -62538.217 (7573.53 seconds)
> Cbc0010I After 20100 nodes, 10088 on tree, 1e+50 best solution, best
> possible -62538.217 (7608.73 seconds)
> Cbc0010I After 20200 nodes, 10160 on tree, 1e+50 best solution, best
> possible -62538.217 (7639.75 seconds)
> Cbc0010I After 20300 nodes, 10226 on tree, 1e+50 best solution, best
> possible -62538.217 (7665.44 seconds)
> Cbc0010I After 20400 nodes, 10296 on tree, 1e+50 best solution, best
> possible -62538.217 (7718.82 seconds)
> Cbc0010I After 20500 nodes, 10368 on tree, 1e+50 best solution, best
> possible -62538.217 (7774.20 seconds)
> Cbc0010I After 20600 nodes, 10440 on tree, 1e+50 best solution, best
> possible -62538.217 (7823.72 seconds)
> Cbc0010I After 20700 nodes, 10500 on tree, 1e+50 best solution, best
> possible -62538.217 (7887.56 seconds)
> Cbc0010I After 20800 nodes, 10574 on tree, 1e+50 best solution, best
> possible -62538.217 (7921.51 seconds)
> Cbc0010I After 20900 nodes, 10644 on tree, 1e+50 best solution, best
> possible -62538.217 (7964.65 seconds)
> Cbc0010I After 21000 nodes, 10710 on tree, 1e+50 best solution, best
> possible -62538.217 (8004.81 seconds)
> Cbc0010I After 21100 nodes, 10776 on tree, 1e+50 best solution, best
> possible -62538.217 (8053.76 seconds)
> Cbc0010I After 21200 nodes, 10850 on tree, 1e+50 best solution, best
> possible -62538.217 (8091.01 seconds)
> Cbc0010I After 21300 nodes, 10920 on tree, 1e+50 best solution, best
> possible -62538.217 (8153.70 seconds)
> Cbc0010I After 21400 nodes, 10991 on tree, 1e+50 best solution, best
> possible -62538.217 (8202.44 seconds)
> Cbc0010I After 21500 nodes, 11062 on tree, 1e+50 best solution, best
> possible -62538.217 (8231.60 seconds)
> Cbc0010I After 21600 nodes, 11130 on tree, 1e+50 best solution, best
> possible -62538.217 (8278.00 seconds)
> Cbc0010I After 21700 nodes, 11200 on tree, 1e+50 best solution, best
> possible -62538.217 (8326.29 seconds)
> Cbc0010I After 21800 nodes, 11276 on tree, 1e+50 best solution, best
> possible -62538.217 (8355.92 seconds)
> Cbc0010I After 21900 nodes, 11338 on tree, 1e+50 best solution, best
> possible -62538.217 (8407.80 seconds)
> Cbc0010I After 22000 nodes, 11410 on tree, 1e+50 best solution, best
> possible -62538.217 (8434.18 seconds)
> Cbc0010I After 22100 nodes, 11489 on tree, 1e+50 best solution, best
> possible -62538.217 (8456.40 seconds)
> Cbc0010I After 22200 nodes, 11562 on tree, 1e+50 best solution, best
> possible -62538.217 (8492.48 seconds)
> Cbc0010I After 22300 nodes, 11643 on tree, 1e+50 best solution, best
> possible -62538.217 (8520.78 seconds)
> Cbc0010I After 22400 nodes, 11716 on tree, 1e+50 best solution, best
> possible -62538.217 (8549.39 seconds)
> Cbc0010I After 22500 nodes, 11782 on tree, 1e+50 best solution, best
> possible -62538.217 (8598.98 seconds)
> Cbc0010I After 22600 nodes, 11850 on tree, 1e+50 best solution, best
> possible -62538.217 (8631.12 seconds)
> Cbc0010I After 22700 nodes, 11922 on tree, 1e+50 best solution, best
> possible -62538.217 (8671.63 seconds)
> Cbc0010I After 22800 nodes, 11990 on tree, 1e+50 best solution, best
> possible -62538.217 (8709.80 seconds)
> Cbc0010I After 22900 nodes, 12062 on tree, 1e+50 best solution, best
> possible -62538.217 (8752.65 seconds)
> Cbc0010I After 23000 nodes, 12129 on tree, 1e+50 best solution, best
> possible -62538.217 (8782.11 seconds)
> Cbc0010I After 23100 nodes, 12197 on tree, 1e+50 best solution, best
> possible -62538.217 (8820.73 seconds)
> Cbc0010I After 23200 nodes, 12269 on tree, 1e+50 best solution, best
> possible -62538.217 (8862.26 seconds)
> Cbc0010I After 23300 nodes, 12345 on tree, 1e+50 best solution, best
> possible -62538.217 (8895.13 seconds)
> Cbc0010I After 23400 nodes, 12415 on tree, 1e+50 best solution, best
> possible -62538.217 (8924.77 seconds)
> Cbc0010I After 23500 nodes, 12486 on tree, 1e+50 best solution, best
> possible -62538.217 (8955.02 seconds)
> Cbc0010I After 23600 nodes, 12558 on tree, 1e+50 best solution, best
> possible -62538.217 (8992.01 seconds)
> Cbc0010I After 23700 nodes, 12626 on tree, 1e+50 best solution, best
> possible -62538.217 (9031.23 seconds)
> Cbc0010I After 23800 nodes, 12692 on tree, 1e+50 best solution, best
> possible -62538.217 (9081.36 seconds)
> Cbc0010I After 23900 nodes, 12768 on tree, 1e+50 best solution, best
> possible -62538.217 (9126.07 seconds)
> Cbc0010I After 24000 nodes, 12834 on tree, 1e+50 best solution, best
> possible -62538.217 (9186.40 seconds)
> Cbc0010I After 24100 nodes, 12902 on tree, 1e+50 best solution, best
> possible -62538.217 (9233.58 seconds)
> Cbc0010I After 24200 nodes, 12967 on tree, 1e+50 best solution, best
> possible -62538.217 (9277.26 seconds)
> Cbc0010I After 24300 nodes, 13037 on tree, 1e+50 best solution, best
> possible -62538.217 (9313.26 seconds)
> Cbc0010I After 24400 nodes, 13109 on tree, 1e+50 best solution, best
> possible -62538.217 (9338.83 seconds)
> Cbc0010I After 24500 nodes, 13184 on tree, 1e+50 best solution, best
> possible -62538.217 (9362.57 seconds)
> Cbc0010I After 24600 nodes, 13255 on tree, 1e+50 best solution, best
> possible -62538.217 (9380.94 seconds)
> Cbc0010I After 24700 nodes, 13323 on tree, 1e+50 best solution, best
> possible -62538.217 (9412.64 seconds)
> Cbc0010I After 24800 nodes, 13392 on tree, 1e+50 best solution, best
> possible -62538.217 (9449.55 seconds)
> Cbc0010I After 24900 nodes, 13462 on tree, 1e+50 best solution, best
> possible -62538.217 (9484.12 seconds)
> Cbc0010I After 25000 nodes, 13534 on tree, 1e+50 best solution, best
> possible -62538.217 (9514.40 seconds)
> Cbc0010I After 25100 nodes, 13605 on tree, 1e+50 best solution, best
> possible -62538.217 (9546.69 seconds)
> Cbc0010I After 25200 nodes, 13672 on tree, 1e+50 best solution, best
> possible -62538.217 (9578.27 seconds)
> Cbc0010I After 25300 nodes, 13748 on tree, 1e+50 best solution, best
> possible -62538.217 (9611.68 seconds)
> Cbc0010I After 25400 nodes, 13813 on tree, 1e+50 best solution, best
> possible -62538.217 (9638.82 seconds)
> Cbc0010I After 25500 nodes, 13887 on tree, 1e+50 best solution, best
> possible -62538.217 (9659.83 seconds)
> Cbc0010I After 25600 nodes, 13958 on tree, 1e+50 best solution, best
> possible -62538.217 (9694.06 seconds)
> Cbc0010I After 25700 nodes, 14029 on tree, 1e+50 best solution, best
> possible -62538.217 (9728.78 seconds)
> Cbc0010I After 25800 nodes, 14098 on tree, 1e+50 best solution, best
> possible -62538.217 (9751.75 seconds)
> Cbc0010I After 25900 nodes, 14176 on tree, 1e+50 best solution, best
> possible -62538.217 (9776.59 seconds)
> Cbc0010I After 26000 nodes, 14250 on tree, 1e+50 best solution, best
> possible -62538.217 (9795.06 seconds)
> Cbc0010I After 26100 nodes, 14324 on tree, 1e+50 best solution, best
> possible -62538.217 (9811.20 seconds)
> Cbc0010I After 26200 nodes, 14404 on tree, 1e+50 best solution, best
> possible -62538.217 (9825.82 seconds)
> Cbc0010I After 26300 nodes, 14475 on tree, 1e+50 best solution, best
> possible -62538.217 (9840.99 seconds)
> Cbc0010I After 26400 nodes, 14553 on tree, 1e+50 best solution, best
> possible -62538.217 (9862.56 seconds)
> Cbc0010I After 26500 nodes, 14625 on tree, 1e+50 best solution, best
> possible -62538.217 (9886.96 seconds)
> Cbc0010I After 26600 nodes, 14697 on tree, 1e+50 best solution, best
> possible -62538.217 (9910.77 seconds)
> Cbc0010I After 26700 nodes, 14767 on tree, 1e+50 best solution, best
> possible -62538.217 (9928.99 seconds)
> Cbc0010I After 26800 nodes, 14838 on tree, 1e+50 best solution, best
> possible -62538.217 (9950.09 seconds)
> Cbc0010I After 26900 nodes, 14904 on tree, 1e+50 best solution, best
> possible -62538.217 (9965.90 seconds)
> Cbc0010I After 27000 nodes, 14976 on tree, 1e+50 best solution, best
> possible -62538.217 (9984.28 seconds)
> Cbc0010I After 27100 nodes, 15055 on tree, 1e+50 best solution, best
> possible -62538.217 (9996.37 seconds)
> Cbc0010I After 27200 nodes, 15124 on tree, 1e+50 best solution, best
> possible -62538.217 (10010.22 seconds)
> Cbc0010I After 27300 nodes, 15193 on tree, 1e+50 best solution, best
> possible -62538.217 (10024.45 seconds)
> Cbc0012I Integer solution of -60774 found by rounding after 1314066
> iterations and 27312 nodes (10026.97 seconds)
> Cbc0012I Integer solution of -60774 found by heuristic after 1314170
> iterations and 27318 nodes (10027.04 seconds)
> /Users/nsicad/.config/gedit/tools/cbc-mip: line 13:  6790 Abort trap:
> 6           /usr/local/bin/cbc $GEDIT_CURRENT_DOCUMENT_NAME%
> -randomCbcSeed 0 -randomSeed 0 -proximity on -threads 8 -printi csv
> -solve -timeM 900 -solu solution_new_cbc_latest_rev6.csv
>
> real	410m48.244s
> user	167m23.256s
> sys	4m58.794s
>
> Exited: 34304
>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: TimberHarvest_Adjancies.mps.zip
Type: application/zip
Size: 1202996 bytes
Desc: not available
URL: <http://list.coin-or.org/pipermail/cbc/attachments/20150405/b8be02b3/attachment-0001.zip>