[Cbc-tickets] [COIN-OR Branch-and-Cut MIP Solver] #35: ABR
stable/2.0
COIN-OR Branch-and-Cut MIP Solver
coin-trac at coin-or.org
Tue Oct 16 13:03:11 EDT 2007
#35: ABR stable/2.0
------------------------+---------------------------------------------------
Reporter: mgalati | Owner: somebody
Type: defect | Status: new
Priority: major | Milestone:
Component: component1 | Version: 2.0
Keywords: |
------------------------+---------------------------------------------------
Let me know if it is necessary to provide a repeatable exe.
{{{
[E] ABR: Array bounds read in ClpSimplexDual::strongBranching(int,int
const*,double *,double *,double * *,int *,int *,bool,bool,int) {1
occurrence}
Reading 4 bytes from 0x02c682d0 (4 bytes at 0x02c682d0 illegal)
Address 0x02c682d0 points into a C++ new block in heap 0x003a0000
Thread ID: 0x1108
Error location
ClpSimplexDual::strongBranching(int,int const*,double *,double
*,double * *,int *,int *,bool,bool,int) [c:\cygwin\home\magala\coin\coin-
decomp\clp\src\clpsimplexdual.cpp:4729]
if
((startFinishOptions&2)!=0&&(whatsChanged_&(2+512))==2+512)
useFactorization=true; // Keep factorization if
possible
// switch off factorization if bad
=> if (pivotVariable_[0]<0)
useFactorization=false;
if
(!useFactorization||factorization_->numberRows()!=numberRows_) {
useFactorization = false;
ClpSimplex::strongBranching(int,int const*,double *,double
*,double * *,int *,int *,bool,bool,int) [c:\cygwin\home\magala\coin\coin-
decomp\clp\src\clpsimplex.cpp:5222]
CbcNode::chooseBranch(CbcModel *,CbcNode *,int)
[c:\cygwin\home\magala\coin\coin-decomp\cbc\src\cbcnode.cpp:1571]
CbcModel::chooseBranch(CbcNode *,int,CbcNode
*,OsiCuts&,bool&,CoinWarmStartBasis *,double const*,double
const*,OsiSolverBranch *&) [c:\cygwin\home\magala\coin\coin-
decomp\cbc\src\cbcmodel.cpp:9505]
CbcModel::branchAndBound(int) [c:\cygwin\home\magala\coin\
coin-decomp\cbc\src\cbcmodel.cpp:1910]
DecompAlgo2::solveRelaxed(int,double const*,double
const*,double,int,bool,bool,OsiSolverInterface *,list<DecompVar
*,allocator<DecompVar *>::std>::std&) [c:\cygwin\home\magala\coin\coin-
decomp\decomp\src\decompalgo2.cpp:2879]
DecompAlgo2::generateVars(DecompStatus,list<DecompVar
*,allocator<DecompVar *>::std>::std&,double&) [c:\cygwin\home\magala\coin\
coin-decomp\decomp\src\decompalgo2.cpp:1528]
DecompAlgo2::processNode(int,double,double)
[c:\cygwin\home\magala\coin\coin-decomp\decomp\src\decompalgo2.cpp:562]
AlpsDecompTreeNode::process(bool,bool)
[c:\cygwin\home\magala\coin\coin-
decomp\decomp\src\alpsdecomptreenode.cpp:151]
AlpsSubTree::exploreUnitWork(bool,int,double,AlpsExitStatus&,int&,int&,bool&)
[c:\cygwin\home\magala\coin\coin-decomp\alps\src\alpssubtree.cpp:1212]
AlpsSubTree::exploreSubTree(AlpsTreeNode
*,int,double,int&,int&) [c:\cygwin\home\magala\coin\coin-
decomp\alps\src\alpssubtree.cpp:443]
AlpsKnowledgeBrokerSerial::rootSearch(AlpsTreeNode *)
[c:\cygwin\home\magala\coin\coin-
decomp\alps\src\alpsknowledgebrokerserial.cpp:224]
AlpsKnowledgeBroker::search(AlpsModel *)
[c:\cygwin\home\magala\coin\coin-
decomp\alps\src\alpsknowledgebroker.h:259]
AlpsDecompModel::solve(void) [c:\cygwin\home\magala\coin\coin-
decomp\decomp\src\alpsdecompmodel.cpp:62]
main [c:\cygwin\home\magala\coin\coin-
decomp\decomp\examples\smallip\smallip_main.cpp:128]
_tmainCRTStartup
[f:\sp\vctools\crt_bld\self_x86\crt\src\crt0.c:327]
mainCRTStartup
[f:\sp\vctools\crt_bld\self_x86\crt\src\crt0.c:195]
Allocation location
new(UINT)
[f:\sp\vctools\crt_bld\self_x86\crt\src\new.cpp:57]
<>=(UINT)
[f:\sp\vctools\crt_bld\self_x86\crt\src\newaop.cpp:7]
ClpSimplex::createRim(int,bool,int)
[c:\cygwin\home\magala\coin\coin-decomp\clp\src\clpsimplex.cpp:3390]
// maybe we need to move scales to SimplexModel for
factorization?
if
((what==63&&!pivotVariable_)||(newArrays&&!keepPivots)) {
delete [] pivotVariable_;
=> pivotVariable_=new int[numberRows2];
for (int i=0;i<numberRows2;i++)
pivotVariable_[i]=-1;
} else if (what==63&&!keepPivots) {
ClpSimplexDual::strongBranching(int,int const*,double *,double
*,double * *,int *,int *,bool,bool,int) [c:\cygwin\home\magala\coin\coin-
decomp\clp\src\clpsimplexdual.cpp:4716]
ClpSimplex::strongBranching(int,int const*,double *,double
*,double * *,int *,int *,bool,bool,int) [c:\cygwin\home\magala\coin\coin-
decomp\clp\src\clpsimplex.cpp:5222]
CbcNode::chooseBranch(CbcModel *,CbcNode *,int)
[c:\cygwin\home\magala\coin\coin-decomp\cbc\src\cbcnode.cpp:1571]
CbcModel::chooseBranch(CbcNode *,int,CbcNode
*,OsiCuts&,bool&,CoinWarmStartBasis *,double const*,double
const*,OsiSolverBranch *&) [c:\cygwin\home\magala\coin\coin-
decomp\cbc\src\cbcmodel.cpp:9505]
CbcModel::branchAndBound(int) [c:\cygwin\home\magala\coin\
coin-decomp\cbc\src\cbcmodel.cpp:1910]
DecompAlgo2::solveRelaxed(int,double const*,double
const*,double,int,bool,bool,OsiSolverInterface *,list<DecompVar
*,allocator<DecompVar *>::std>::std&) [c:\cygwin\home\magala\coin\coin-
decomp\decomp\src\decompalgo2.cpp:2879]
DecompAlgo2::generateVars(DecompStatus,list<DecompVar
*,allocator<DecompVar *>::std>::std&,double&) [c:\cygwin\home\magala\coin\
coin-decomp\decomp\src\decompalgo2.cpp:1528]
}}}
--
Ticket URL: <https://projects.coin-or.org/Cbc/ticket/35>
COIN-OR Branch-and-Cut MIP Solver <http://projects.coin-or.org/Cbc>
An LP-based branch-and-cut MIP solver.
More information about the Cbc-tickets
mailing list