[Cbc-tickets] Re: [COIN-OR Branch-and-Cut MIP Solver] #3: pop heap asserts

[COIN-OR Branch-and-Cut MIP Solver]

#3: pop heap asserts
-------------------------+--------------------------------------------------
  Reporter:  San         |       Owner:  forrest 
      Type:  defect      |      Status:  reopened
  Priority:  major       |   Milestone:          
 Component:  component1  |     Version:          
Resolution:              |    Keywords:          
-------------------------+--------------------------------------------------
Changes (by San):

  * status:  closed => reopened
  * resolution:  wontfix =>

Comment:

 I'm testing with the code on trunk and it is still asserting at push_heap
 on some problems.

 {{{
         performance_test.exe!std::_Debug_message(const wchar_t *
 message=0x0075729c, const wchar_t * file=0x00757210, unsigned int
 line=1681)  Line 23  C++
 performance_test.exe!std::_Debug_heap<std::_Vector_iterator<CbcNode
 *,std::allocator<CbcNode *> >,CbcCompare>(std::_Vector_iterator<CbcNode
 *,std::allocator<CbcNode *> > _First=0x01f86c18 {nodeInfo_=0x020f8f40
 objectiveValue_=-22291557071.093792
 guessedObjectiveValue_=-22291557071.093483 ...},
 std::_Vector_iterator<CbcNode *,std::allocator<CbcNode *> >
 _Last=0x02033a90 {nodeInfo_=0x01f958c0 objectiveValue_=-22417249915.890549
 guessedObjectiveValue_=-22417249915.889938 ...}, CbcCompare _Pred={...})
 Line 1681 + 0x14 bytes  C++
 performance_test.exe!std::_Push_heap_0<std::_Vector_iterator<CbcNode
 *,std::allocator<CbcNode *> >,int,CbcNode
 *,CbcCompare>(std::_Vector_iterator<CbcNode *,std::allocator<CbcNode *> >
 _First=0x01f86ca0 {nodeInfo_=0x01f9c120
 objectiveValue_=-22332910639.662392
 guessedObjectiveValue_=-22332910639.662300 ...},
 std::_Vector_iterator<CbcNode *,std::allocator<CbcNode *> >
 _Last=0x02033a90 {nodeInfo_=0x01f958c0 objectiveValue_=-22417249915.890549
 guessedObjectiveValue_=-22417249915.889938 ...}, CbcCompare _Pred={...},
 int * __formal=0x00000000, int * __formal=0x00000000)  Line 1765 + 0x77
 bytes     C++
         performance_test.exe!std::push_heap<std::_Vector_iterator<CbcNode
 *,std::allocator<CbcNode *> >,CbcCompare>(std::_Vector_iterator<CbcNode
 *,std::allocator<CbcNode *> > _First=0x01f86ca0 {nodeInfo_=0x01f9c120
 objectiveValue_=-22332910639.662392
 guessedObjectiveValue_=-22332910639.662300 ...},
 std::_Vector_iterator<CbcNode *,std::allocator<CbcNode *> >
 _Last=0x02033a90 {nodeInfo_=0x01f958c0 objectiveValue_=-22417249915.890549
 guessedObjectiveValue_=-22417249915.889938 ...}, CbcCompare _Pred={...})
 Line 1786 + 0xe2 bytes    C++
         performance_test.exe!CbcTree::push(CbcNode * x=0x02033a90)  Line
 53 + 0x86 bytes        C++
         performance_test.exe!CbcTree::cleanTree(CbcModel *
 model=0x0012f4a4, double cutoff=-22199913644.033531, double &
 bestPossibleObjective=-22420711678.521683)  Line 153 + 0x33 bytes      C++
 >       performance_test.exe!CbcModel::branchAndBound(int doStatistics=0)
 Line 1128    C++

 }}}

-- 
Ticket URL: <https://projects.coin-or.org/Cbc/ticket/3#comment:6>
COIN-OR Branch-and-Cut MIP Solver <http://projects.coin-or.org/Cbc>
An LP-based branch-and-cut MIP solver.