Attachment 155727 Details for Bug 199502 – coinmp test log

coinmp test log

coinmp_test_log.txt (text/plain), 16.88 KB, created by Carlos J Puga Medina on 2015-04-19 11:56:18 UTC

(hide)

Description:

Filename:

MIME Type:

Creator: Carlos J Puga Medina

Created: 2015-04-19 11:56:18 UTC

Size: 16.88 KB

patch

obsolete

>box:/usr/ports/math/coinmp # make test
>Making all in Data/Sample
>Making all in CoinUtils
>Making all in src
>make  all-am
>Making all in Osi
>Making all in src/Osi
>make  all-am
>Making all in src/OsiCommonTest
>Making all in Clp
>Making all in src
>make  all-am
>Making all in src/OsiClp
>Making all in Cgl
>Making all in src
>make  all-recursive
>Making all in CglAllDifferent
>Making all in CglClique
>Making all in CglDuplicateRow
>Making all in CglFlowCover
>Making all in CglGMI
>Making all in CglGomory
>Making all in CglKnapsackCover
>Making all in CglLandP
>Making all in CglLiftAndProject
>Making all in CglMixedIntegerRounding
>Making all in CglMixedIntegerRounding2
>Making all in CglOddHole
>Making all in CglPreProcess
>Making all in CglProbing
>Making all in CglRedSplit
>Making all in CglRedSplit2
>Making all in CglResidualCapacity
>Making all in CglSimpleRounding
>Making all in CglTwomir
>Making all in CglZeroHalf
>Making all in Cbc
>Making all in src
>make  all-am
>Making all in src/OsiCbc
>Making all in CoinMP
>Making all in src
>make  all-am
>cd CoinMP; make test
>Making all in src
>make  all-am
>cd test; make test
>if c++ -DHAVE_CONFIG_H -I. -I`echo .`   -I`echo ./../src` -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cbc/src -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglAllDifferent -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglClique -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglDuplicateRow -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglFlowCover -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglGMI -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglGomory -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglKnapsackCover -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglLandP -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglLiftAndProject -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglMixedIntegerRounding -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglMixedIntegerRounding2 -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglOddHole -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglPreProcess -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglProbing -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglRedSplit -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglRedSplit2 -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglResidualCapacity -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglSimpleRounding -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglTwomir -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/CglZeroHalf -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Clp/src/OsiClp -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Clp/src -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/Osi/src/Osi -I/usr/ports/math/coinmp/work/CoinMP-1.8.1/CoinUtils/src   -O2 -pipe -fstack-protector -fno-strict-aliasing  -ffast-math   -DCOINMP_BUILD -MT unitTest.o -MD -MP -MF ".deps/unitTest.Tpo" -c -o unitTest.o unitTest.cpp;  then mv -f ".deps/unitTest.Tpo" ".deps/unitTest.Po"; else rm -f ".deps/unitTest.Tpo"; exit 1; fi
>/bin/sh ../libtool --tag=CXX --mode=link c++   -O2 -pipe -fstack-protector -fno-strict-aliasing  -ffast-math   -DCOINMP_BUILD  -fstack-protector -o unitTest  unitTest.o ../src/libCoinMP.la /usr/ports/math/coinmp/work/CoinMP-1.8.1/Cbc/src/libCbcSolver.la /usr/ports/math/coinmp/work/CoinMP-1.8.1/Cbc/src/libCbc.la /usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/libCgl.la /usr/ports/math/coinmp/work/CoinMP-1.8.1/Clp/src/OsiClp/libOsiClp.la /usr/ports/math/coinmp/work/CoinMP-1.8.1/Clp/src/libClpSolver.la /usr/ports/math/coinmp/work/CoinMP-1.8.1/Clp/src/libClp.la /usr/ports/math/coinmp/work/CoinMP-1.8.1/Osi/src/Osi/libOsi.la /usr/ports/math/coinmp/work/CoinMP-1.8.1/CoinUtils/src/libCoinUtils.la -lbz2 -lz -lm 
>mkdir .libs
>c++ -O2 -pipe -fstack-protector -fno-strict-aliasing -ffast-math -DCOINMP_BUILD -fstack-protector -o .libs/unitTest unitTest.o  ../src/.libs/libCoinMP.so /usr/ports/math/coinmp/work/CoinMP-1.8.1/Cbc/src/.libs/libCbcSolver.so /usr/ports/math/coinmp/work/CoinMP-1.8.1/Cbc/src/.libs/libCbc.so /usr/ports/math/coinmp/work/CoinMP-1.8.1/Cgl/src/.libs/libCgl.so /usr/ports/math/coinmp/work/CoinMP-1.8.1/Clp/src/OsiClp/.libs/libOsiClp.so /usr/ports/math/coinmp/work/CoinMP-1.8.1/Clp/src/.libs/libClpSolver.so /usr/ports/math/coinmp/work/CoinMP-1.8.1/Clp/src/.libs/libClp.so /usr/ports/math/coinmp/work/CoinMP-1.8.1/Osi/src/Osi/.libs/libOsi.so /usr/ports/math/coinmp/work/CoinMP-1.8.1/CoinUtils/src/.libs/libCoinUtils.so -lm -lbz2 -lz -Wl,--rpath -Wl,/usr/local/lib
>creating unitTest
>./unitTest
>UnitTest: CoinMP version 1.7600000000000000089
>
>Solve Problem: CoinTest (obj=1428729.28571)
>*** MsgCB: Coin0506I Presolve 4 (-1) rows, 6 (-2) columns and 11 (-3) elements
>Coin0506I Presolve 4 (-1) rows, 6 (-2) columns and 11 (-3) elements
>*** MsgCB: Clp0006I 0  Obj 1428589.3 Dual inf 9.9473624 (6)
>Clp0006I 0  Obj 1428589.3 Dual inf 9.9473624 (6)
>*** IterCB: iter=1, obj=1428764.93008, feas=0, infeas=95.8639255714
>*** IterCB: iter=2, obj=1428729.38571, feas=0, infeas=95.8639255714
>*** IterCB: iter=3, obj=1428729.38571, feas=0, infeas=95.8639255714
>*** IterCB: iter=4, obj=1428729.28571, feas=0, infeas=95.8639255714
>*** MsgCB: Clp0006I 4  Obj 1428729.3
>Clp0006I 4  Obj 1428729.3
>*** MsgCB: Clp0000I Optimal - objective value 1428729.3
>Clp0000I Optimal - objective value 1428729.3
>*** MsgCB: Coin0511I After Postsolve, objective 1428729.3, infeasibilities - dual 0 (0), primal 0 (0)
>Coin0511I After Postsolve, objective 1428729.3, infeasibilities - dual 0 (0), primal 0 (0)
>*** MsgCB: Clp0032I Optimal objective 1428729.286 - 4 iterations time 0.002, Presolve 0.00
>Clp0032I Optimal objective 1428729.286 - 4 iterations time 0.002, Presolve 0.00
>
>---------------------------------------
>Problem Name:    CoinTest
>Solution Result: Optimal solution found
>Solution Status: 0
>Optimal Value:   1428729.28571
>---------------------------------------
>c2 = 40
>c4 = 428589.285714
>c5 = 50
>c6 = 50
>c7 = 1000000
>---------------------------------------
>
>Solve Problem: Bakery (obj=506.66666667)
>*** MsgCB: Coin0506I Presolve 1 (-2) rows, 2 (0) columns and 2 (-2) elements
>Coin0506I Presolve 1 (-2) rows, 2 (0) columns and 2 (-2) elements
>*** MsgCB: Clp0006I 0  Obj -0 Dual inf 0.179998 (2)
>Clp0006I 0  Obj -0 Dual inf 0.179998 (2)
>*** IterCB: iter=1, obj=640, feas=0, infeas=1999.999999
>*** MsgCB: Clp0006I 1  Obj 640
>Clp0006I 1  Obj 640
>*** MsgCB: Clp0000I Optimal - objective value 640
>Clp0000I Optimal - objective value 640
>*** MsgCB: Coin0511I After Postsolve, objective 640, infeasibilities - dual 0 (0), primal 0 (0)
>Coin0511I After Postsolve, objective 640, infeasibilities - dual 0 (0), primal 0 (0)
>*** MsgCB: Clp0032I Optimal objective 640 - 1 iterations time 0.002, Presolve 0.00
>Clp0032I Optimal objective 640 - 1 iterations time 0.002, Presolve 0.00
>
>---------------------------------------
>Problem Name:    Bakery
>Solution Result: Optimal solution found
>Solution Status: 0
>Optimal Value:   506.666666667
>---------------------------------------
>Sun = 8000
>Moon = 3000
>---------------------------------------
>
>Solve Problem: Afiro (obj=-464.753142857)
>*** MsgCB: Coin0506I Presolve 7 (-20) rows, 10 (-22) columns and 28 (-55) elements
>Coin0506I Presolve 7 (-20) rows, 10 (-22) columns and 28 (-55) elements
>*** MsgCB: Clp0006I 0  Obj 0 Dual inf 2.199997 (3)
>Clp0006I 0  Obj 0 Dual inf 2.199997 (3)
>*** IterCB: iter=1, obj=-521.878290611, feas=0, infeas=273.160066072
>*** IterCB: iter=2, obj=-521.878290611, feas=0, infeas=273.160066072
>*** IterCB: iter=3, obj=-499.022298393, feas=0, infeas=273.160066072
>*** IterCB: iter=4, obj=-485.929731229, feas=0, infeas=273.160066072
>*** IterCB: iter=5, obj=-464.753142857, feas=0, infeas=273.160066072
>*** MsgCB: Clp0006I 5  Obj -464.75314
>Clp0006I 5  Obj -464.75314
>*** MsgCB: Clp0000I Optimal - objective value -464.75314
>Clp0000I Optimal - objective value -464.75314
>*** MsgCB: Coin0511I After Postsolve, objective -464.75314, infeasibilities - dual 0 (0), primal 0 (0)
>Coin0511I After Postsolve, objective -464.75314, infeasibilities - dual 0 (0), primal 0 (0)
>*** MsgCB: Clp0032I Optimal objective -464.7531429 - 5 iterations time 0.002, Presolve 0.00
>Clp0032I Optimal objective -464.7531429 - 5 iterations time 0.002, Presolve 0.00
>
>---------------------------------------
>Problem Name:    Afiro
>Solution Result: Optimal solution found
>Solution Status: 0
>Optimal Value:   -464.753142857
>---------------------------------------
>x01 = 80
>x02 = 25.5
>x03 = 54.5
>x04 = 84.8
>x06 = 18.2142857143
>x14 = 18.2142857143
>x16 = 19.3071428571
>x22 = 500
>x23 = 475.92
>x24 = 24.08
>x26 = 215
>x36 = 339.942857143
>x37 = 383.942857143
>---------------------------------------
>
>Solve Problem: P0033 (obj=3089)
>*** MsgCB: Welcome to the CBC MILP Solver 
>Version: 2.9.4 
>Build Date: Apr 19 2015 
>
>Welcome to the CBC MILP Solver 
>Version: 2.9.4 
>Build Date: Apr 19 2015 
>
>*** MsgCB: command line - CoinMP -solve -quit (default strategy 1)
>command line - CoinMP -solve -quit (default strategy 1)
>*** MsgCB: processed model has 15 rows, 32 columns (32 integer (32 of which binary)) and 97 elements
>processed model has 15 rows, 32 columns (32 integer (32 of which binary)) and 97 elements
>*** MsgCB: Cutoff increment increased from 1e-05 to 0.9999
>Cutoff increment increased from 1e-05 to 0.9999
>*** NodeCB: iter=5, node=1, bound=2829.05978261, best=1e+50 
>*** NodeCB: iter=8, node=2, bound=2829.05978261, best=1e+50 
>*** NodeCB: iter=11, node=3, bound=2829.05978261, best=1e+50 
>*** NodeCB: iter=11, node=4, bound=2829.05978261, best=1e+50 
>*** NodeCB: iter=13, node=5, bound=2829.05978261, best=1e+50 
>*** NodeCB: iter=14, node=6, bound=2829.05978261, best=1e+50 
>*** NodeCB: iter=15, node=7, bound=2829.05978261, best=1e+50 
>*** NodeCB: iter=17, node=8, bound=2829.05978261, best=1e+50 
>*** NodeCB: iter=17, node=9, bound=2829.05978261, best=1e+50 
>*** NodeCB: iter=19, node=10, bound=2829.05978261, best=1e+50 
>*** NodeCB: iter=19, node=11, bound=2829.05978261, best=3095 *
>*** NodeCB: iter=20, node=12, bound=2829.05978261, best=3095 
>*** NodeCB: iter=22, node=13, bound=2829.05978261, best=3095 
>*** NodeCB: iter=22, node=14, bound=2829.05978261, best=3095 
>*** NodeCB: iter=22, node=15, bound=2829.05978261, best=3095 
>*** NodeCB: iter=22, node=16, bound=2829.05978261, best=3095 
>*** NodeCB: iter=29, node=17, bound=2829.05978261, best=3095 
>*** NodeCB: iter=29, node=18, bound=2829.05978261, best=3095 
>*** NodeCB: iter=30, node=19, bound=2829.05978261, best=3095 
>*** NodeCB: iter=32, node=20, bound=2829.05978261, best=3095 
>*** NodeCB: iter=36, node=21, bound=2829.05978261, best=3095 
>*** NodeCB: iter=36, node=22, bound=2829.05978261, best=3095 
>*** NodeCB: iter=36, node=23, bound=2829.05978261, best=3095 
>*** NodeCB: iter=37, node=24, bound=2829.05978261, best=3095 
>*** NodeCB: iter=37, node=25, bound=2829.05978261, best=3095 
>*** NodeCB: iter=45, node=26, bound=2829.05978261, best=3095 
>*** NodeCB: iter=47, node=27, bound=2829.05978261, best=3095 
>*** NodeCB: iter=51, node=28, bound=2829.05978261, best=3095 
>*** NodeCB: iter=56, node=29, bound=2829.05978261, best=3095 
>*** NodeCB: iter=57, node=30, bound=2829.05978261, best=3095 
>*** NodeCB: iter=59, node=31, bound=2829.05978261, best=3095 
>*** NodeCB: iter=60, node=32, bound=2829.05978261, best=3095 
>*** NodeCB: iter=66, node=33, bound=2829.05978261, best=3095 
>*** NodeCB: iter=67, node=34, bound=2829.05978261, best=3095 
>*** NodeCB: iter=68, node=35, bound=2829.05978261, best=3095 
>*** NodeCB: iter=69, node=36, bound=2829.05978261, best=3095 
>*** NodeCB: iter=71, node=37, bound=2829.05978261, best=3095 
>*** NodeCB: iter=71, node=38, bound=2829.05978261, best=3095 
>*** NodeCB: iter=71, node=39, bound=2829.05978261, best=3095 
>*** NodeCB: iter=74, node=40, bound=2829.05978261, best=3095 
>*** NodeCB: iter=76, node=41, bound=2829.05978261, best=3095 
>*** NodeCB: iter=76, node=42, bound=2829.05978261, best=3095 
>*** NodeCB: iter=79, node=43, bound=2829.05978261, best=3095 
>*** NodeCB: iter=81, node=44, bound=2829.05978261, best=3095 
>*** NodeCB: iter=81, node=45, bound=2829.05978261, best=3095 
>*** NodeCB: iter=87, node=46, bound=2829.05978261, best=3095 
>*** NodeCB: iter=89, node=47, bound=2829.05978261, best=3095 
>*** NodeCB: iter=95, node=48, bound=2829.05978261, best=3089 *
>*** NodeCB: iter=96, node=49, bound=2916.225, best=3089 
>*** NodeCB: iter=97, node=50, bound=2916.225, best=3089 
>*** NodeCB: iter=99, node=51, bound=2916.225, best=3089 
>*** NodeCB: iter=100, node=52, bound=2916.225, best=3089 
>*** NodeCB: iter=100, node=53, bound=2916.225, best=3089 
>*** NodeCB: iter=101, node=54, bound=2916.225, best=3089 
>*** NodeCB: iter=101, node=55, bound=2916.225, best=3089 
>*** NodeCB: iter=102, node=56, bound=2916.225, best=3089 
>*** NodeCB: iter=102, node=57, bound=2916.225, best=3089 
>*** NodeCB: iter=102, node=58, bound=2916.225, best=3089 
>*** NodeCB: iter=102, node=59, bound=2916.225, best=3089 
>*** NodeCB: iter=102, node=60, bound=2916.225, best=3089 
>*** NodeCB: iter=102, node=61, bound=2916.225, best=3089 
>*** NodeCB: iter=103, node=62, bound=2916.225, best=3089 
>*** NodeCB: iter=107, node=63, bound=2916.225, best=3089 
>*** NodeCB: iter=108, node=64, bound=2916.225, best=3089 
>*** NodeCB: iter=114, node=65, bound=2916.225, best=3089 
>*** NodeCB: iter=118, node=66, bound=2916.225, best=3089 
>*** NodeCB: iter=120, node=67, bound=2916.225, best=3089 
>*** NodeCB: iter=120, node=68, bound=2916.225, best=3089 
>*** NodeCB: iter=120, node=69, bound=2916.225, best=3089 
>*** NodeCB: iter=123, node=70, bound=2916.225, best=3089 
>*** NodeCB: iter=134, node=71, bound=2916.225, best=3089 
>*** NodeCB: iter=135, node=72, bound=2916.225, best=3089 
>*** NodeCB: iter=136, node=73, bound=2916.225, best=3089 
>*** NodeCB: iter=141, node=74, bound=2916.225, best=3089 
>
>---------------------------------------
>Problem Name:    P0033
>Solution Result: Optimal solution found
>Solution Status: 0
>Optimal Value:   3089
>---------------------------------------
>c157 = 1
>c163 = 1
>c164 = 1
>c166 = 1
>c170 = 1
>c174 = 1
>c175 = 1
>c179 = 1
>c181 = 1
>c182 = 1
>c183 = 1
>c184 = 1
>c185 = 1
>c186 = 1
>---------------------------------------
>
>Solve Problem: Exmip1 (obj=3.23684210526)
>*** MsgCB: Welcome to the CBC MILP Solver 
>Version: 2.9.4 
>Build Date: Apr 19 2015 
>
>Welcome to the CBC MILP Solver 
>Version: 2.9.4 
>Build Date: Apr 19 2015 
>
>*** MsgCB: command line - CoinMP -solve -quit (default strategy 1)
>command line - CoinMP -solve -quit (default strategy 1)
>*** MsgCB: processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements
>processed model has 0 rows, 0 columns (0 integer (0 of which binary)) and 0 elements
>
>---------------------------------------
>Problem Name:    Exmip1
>Solution Result: Optimal solution found
>Solution Status: 0
>Optimal Value:   3.23684210526
>---------------------------------------
>col01 = 2.5
>col04 = 1
>col05 = 0.5
>col06 = 4
>col08 = 0.263157894737
>---------------------------------------
>
>Solve Problem: GamsSos1a (obj=0.72)
>Cbc3007W No integer variables - nothing to do
>Cbc3007W No integer variables - nothing to do
>*** MsgCB: Welcome to the CBC MILP Solver 
>Version: 2.9.4 
>Build Date: Apr 19 2015 
>
>Welcome to the CBC MILP Solver 
>Version: 2.9.4 
>Build Date: Apr 19 2015 
>
>*** MsgCB: command line - CoinMP -solve -quit (default strategy 1)
>command line - CoinMP -solve -quit (default strategy 1)
>*** MsgCB: processed model has 1 rows, 3 columns (0 integer (0 of which binary)) and 3 elements
>processed model has 1 rows, 3 columns (0 integer (0 of which binary)) and 3 elements
>
>---------------------------------------
>Problem Name:    GamsSos1a
>Solution Result: Optimal solution found
>Solution Status: 0
>Optimal Value:   0.72
>---------------------------------------
>x1 = 0.8
>---------------------------------------
>
>Solve Problem: GamsSos2a (obj=0)
>Cbc3007W No integer variables - nothing to do
>Cbc3007W No integer variables - nothing to do
>*** MsgCB: Welcome to the CBC MILP Solver 
>Version: 2.9.4 
>Build Date: Apr 19 2015 
>
>Welcome to the CBC MILP Solver 
>Version: 2.9.4 
>Build Date: Apr 19 2015 
>
>*** MsgCB: command line - CoinMP -solve -quit (default strategy 1)
>command line - CoinMP -solve -quit (default strategy 1)
>*** MsgCB: processed model has 5 rows, 6 columns (0 integer (0 of which binary)) and 14 elements
>processed model has 5 rows, 6 columns (0 integer (0 of which binary)) and 14 elements
>
>---------------------------------------
>Problem Name:    GamsSos2a
>Solution Result: Optimal solution found
>Solution Status: 0
>Optimal Value:   0
>---------------------------------------
>w1 = 0.7
>w2 = 0.3
>x = 1.3
>fx = 1.3
>---------------------------------------
>
>Solve Problem: SemiCont (obj=1.1)
>Cbc3007W No integer variables - nothing to do
>Cbc3007W No integer variables - nothing to do
>*** MsgCB: Welcome to the CBC MILP Solver 
>Version: 2.9.4 
>Build Date: Apr 19 2015 
>
>Welcome to the CBC MILP Solver 
>Version: 2.9.4 
>Build Date: Apr 19 2015 
>
>*** MsgCB: command line - CoinMP -solve -quit (default strategy 1)
>command line - CoinMP -solve -quit (default strategy 1)
>
>---------------------------------------
>Problem Name:    SemiCont
>Solution Result: Optimal solution found
>Solution Status: 0
>Optimal Value:   1.1
>---------------------------------------
>pup = 1.1
>x = 10
>---------------------------------------
>
>All unit tests completed successfully
>

Actions: View

Attachments on bug 199502: 155678 | 155726 | 155727