[Cbc] Assertion failed in CbcSolver l. 7223

Wed Jun 17 15:37:09 EDT 2015

Hi Cbc Team,

I am getting an assertion failed error while using Cbc (version 2.9.2
binaries obtained via Julia package Cbc.jl installation, Windows 64bit).
Unfortunately I cannot share the model, but I have found out the following:
1) appears when a feasible solution is loaded using setInitialSolution and
during cbc work this solution is not improved (nor the best possible)
2) I have also tried with a 2.9.5 version build from source with MSVC 17,
there was no assertion, but the solution after cbc was done didn't satisfy
constraints.

The assertion is:
A s s e r t i o n   f a i l e d !

 P r o g r a m :   d : \ p i o t r \ J u l i a - 0 . 3 . 5 w o r k \ b i n
\ j u l i a . e x e
 F i l e :   C b c S o l v e r . c p p ,   L i n e   7 2 2 3

 E x p r e s s i o n :   s a v e S o l v e r - > i s P r o v e n O p t i m
a l ( )

Full output from cbc attached.

Do you have any idea what might be causing this and how to workaround?

Meanwhile, I will test with 2.8.12 to see if occurs there.

Thank you!

Piotr
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/cbc/attachments/20150617/3b37bdf3/attachment.html>
-------------- next part --------------

Optimal - objective value 33.125
Optimal objective 33.125 - 1218 iterations time 0.952, Presolve 0.38
Cbc0045I Solution with objective value 33.125 saved
Cgl0002I 217 variables fixed
Cgl0003I 0 fixed, 518 tightened bounds, 2602 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 79 tightened bounds, 6414 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 104 tightened bounds, 1923 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 10 tightened bounds, 1395 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 945 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 2 tightened bounds, 783 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 1 tightened bounds, 303 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 17 strengthened rows, 0 substitutions
Cgl0003I 0 fixed, 0 tightened bounds, 62 strengthened rows, 0 substitutions
Cgl0004I processed model has 27956 rows, 12351 columns (4853 integer (4210 of which binary)) and 106372 elements
Cbc0038I Full problem 27956 rows 12351 columns, reduced to 21608 rows 9243 columns - too large
Cbc0031I 444 added rows had average density of 9.6824324
Cbc0013I At root node, 444 cuts changed objective from 0.99874449 to 19.121664 in 16 passes
Cbc0014I Cut generator 0 (Probing) - 1099 row cuts average 2.5 elements, 0 column cuts (26 active)  in 1.952 seconds - new frequency is 1
Cbc0014I Cut generator 1 (Gomory) - 292 row cuts average 26.2 elements, 0 column cuts (0 active)  in 25.815 seconds - new frequency is 1
Cbc0014I Cut generator 2 (Knapsack) - 14 row cuts average 5.7 elements, 0 column cuts (0 active)  in 0.452 seconds - new frequency is -100
Cbc0014I Cut generator 3 (Clique) - 0 row cuts average 0.0 elements, 0 column cuts (0 active)  in 1.062 seconds - new frequency is -100
Cbc0014I Cut generator 4 (MixedIntegerRounding2) - 950 row cuts average 5.7 elements, 0 column cuts (0 active)  in 0.545 seconds - new frequency is 1
Cbc0014I Cut generator 5 (FlowCover) - 1037 row cuts average 4.1 elements, 0 column cuts (0 active)  in 0.502 seconds - new frequency is 1
Cbc0014I Cut generator 6 (TwoMirCuts) - 2158 row cuts average 93.5 elements, 0 column cuts (0 active)  in 20.044 seconds - new frequency is 1
Cbc0010I After 0 nodes, 1 on tree, 33.125 best solution, best possible 19.121664 (1621.58 seconds)
Cbc0038I Full problem 27956 rows 12351 columns, reduced to 20832 rows 8883 columns - too large
Cbc0038I Full problem 27956 rows 12351 columns, reduced to 19518 rows 8265 columns - too large
Cbc0010I After 100 nodes, 58 on tree, 33.125 best solution, best possible 19.121664 (11568.93 seconds)
Cbc0038I Full problem 27956 rows 12351 columns, reduced to 18395 rows 7878 columns - too large
Cbc0010I After 200 nodes, 111 on tree, 33.125 best solution, best possible 19.121664 (19210.93 seconds)
Cbc0038I Full problem 27956 rows 12351 columns, reduced to 18360 rows 7929 columns - too large
Cbc0010I After 300 nodes, 165 on tree, 33.125 best solution, best possible 19.121664 (22576.33 seconds)
Cbc0038I Full problem 27956 rows 12351 columns, reduced to 17182 rows 7325 columns - too large
Cbc0010I After 400 nodes, 206 on tree, 33.125 best solution, best possible 19.121664 (27118.30 seconds)
Cbc0038I Full problem 27956 rows 12351 columns, reduced to 16214 rows 6909 columns - too large
Cbc0010I After 500 nodes, 221 on tree, 33.125 best solution, best possible 19.121664 (31722.75 seconds)
Cbc0010I After 600 nodes, 242 on tree, 33.125 best solution, best possible 19.121664 (36577.34 seconds)
Cbc0038I Full problem 27956 rows 12351 columns, reduced to 15639 rows 6675 columns - too large
Cbc0010I After 700 nodes, 256 on tree, 33.125 best solution, best possible 19.121664 (40916.07 seconds)
Cbc0038I Full problem 27956 rows 12351 columns, reduced to 16309 rows 7025 columns - too large
Cbc0010I After 800 nodes, 273 on tree, 33.125 best solution, best possible 19.121664 (48368.89 seconds)
Cbc0038I Full problem 27956 rows 12351 columns, reduced to 16208 rows 6943 columns - too large
Cbc0010I After 900 nodes, 285 on tree, 33.125 best solution, best possible 19.121664 (53865.96 seconds)
Cbc0010I After 1000 nodes, 312 on tree, 33.125 best solution, best possible 19.121664 (59075.73 seconds)
Cbc0010I After 1100 nodes, 409 on tree, 33.125 best solution, best possible 19.289804 (73198.87 seconds)
Cbc0020I Exiting on maximum time
Cbc0005I Partial search - best objective 33.125 (best possible 19.289804), took 18912861 iterations and 1123 nodes (75279.01 seconds)
Cbc0032I Strong branching done 13594 times (893256 iterations), fathomed 2 nodes and fixed 6 variables
Cbc0035I Maximum depth 161, 0 variables fixed on reduced cost
Coin0505I Presolved problem not optimal, resolve after postsolve
Coin0505I Presolved problem not optimal, resolve after postsolve
Coin0505I Presolved problem not optimal, resolve after postsolve
Coin0505I Presolved problem not optimal, resolve after postsolve
Coin0505I Presolved problem not optimal, resolve after postsolve
Coin0505I Presolved problem not optimal, resolve after postsolve
Coin0505I Presolved problem not optimal, resolve after postsolve
Coin0505I Presolved problem not optimal, resolve after postsolve
Cgl0013I Postprocessed model is infeasible - possible tolerance issue - try without preprocessing
A s s e r t i o n   f a i l e d !

 P r o g r a m :   d : \ p i o t r \ J u l i a - 0 . 3 . 5 w o r k \ b i n \ j u l i a . e x e
 F i l e :   C b c S o l v e r . c p p ,   L i n e   7 2 2 3

 E x p r e s s i o n :   s a v e S o l v e r - > i s P r o v e n O p t i m a l ( )

This application has requested the Runtime to terminate it in an unusual way.
Please contact the application's support team for more information.