Index: tol/btol/vmatrix_type/tol_bvmat_bsr_impl.h
===================================================================
--- tol/btol/vmatrix_type/tol_bvmat_bsr_impl.h	(revision d2cf6f7b992368d3821692535647efd888efbf3f)
+++ tol/btol/vmatrix_type/tol_bvmat_bsr_impl.h	(revision 66654eef0a9eeb8df6b2b0c13d3f03596da98d6f)
@@ -276,5 +276,5 @@
   void action(const std::string& str) const
   {
-    Std(BSR()+"TRACE "+msg_.c_str()+" : '"+str.c_str()+"'");
+    //Std(BSR()+"TRACE "+msg_.c_str()+" : '"+str.c_str()+"'");
   }
   void operator()(const std::string& str) const
@@ -649,5 +649,5 @@
     if(!(*numEqu_))
     {
-      Std(BSR()+" Parsed "+*(t->var_count_)+" linear block variables \n");
+    //Std(BSR()+" Parsed "+*(t->var_count_)+" linear block variables \n");
     }
     *(t->numEqu_) += size;
@@ -1676,7 +1676,7 @@
     { 
       iniTime_ = (double)time(0); 
-      Std(BSR()+" Parsed "+(*mis_count_)+" missing variables \n");
-      Std(BSR()+" Parsed "+(*sig_count_)+" sigma variables \n");
-      Std(BSR()+" Parsed "+(*noise_count_)+" vectors of noise  \n");
+    //Std(BSR()+" Parsed "+(*mis_count_)+" missing variables \n");
+    //Std(BSR()+" Parsed "+(*sig_count_)+" sigma variables \n");
+    //Std(BSR()+" Parsed "+(*noise_count_)+" vectors of noise  \n");
     }
     if(equ_vec_->capacity()<n+1) { equ_vec_->reserve(int((n+1)*1.20)); }
@@ -1697,6 +1697,6 @@
       double elapsed = time(0) - iniTime_;
       double remain  = elapsed*double((*numEqu_)-n)/double(n);
-      Std(BSR()+" Parsed "+n+" equations of "+(*numEqu_)+" ["+ratio+"%] "
-          "in "+elapsed+" seconds (remaining "+remain+" s.)\n");
+    //Std(BSR()+" Parsed "+n+" equations of "+(*numEqu_)+" ["+ratio+"%] "
+    //    "in "+elapsed+" seconds (remaining "+remain+" s.)\n");
     }
   }
@@ -1739,5 +1739,5 @@
     if(n && !(n%1000))
     {
-      Std(BSR()+" Parsed "+n+" inequations \n");
+    //Std(BSR()+" Parsed "+n+" inequations \n");
     }
   }
Index: tol/btol/vmatrix_type/vmat_bsr.cpp
===================================================================
--- tol/btol/vmatrix_type/vmat_bsr.cpp	(revision d2cf6f7b992368d3821692535647efd888efbf3f)
+++ tol/btol/vmatrix_type/vmat_bsr.cpp	(revision 66654eef0a9eeb8df6b2b0c13d3f03596da98d6f)
@@ -145,5 +145,5 @@
 {
   int i,j,k;
-  Std(BSR()+"Setting input and output missing block\n");
+//Std(BSR()+"Setting input and output missing block\n");
   int inputMisSize = 0;
   int outputMisSize = 0;
Index: tol/btol/vmatrix_type/vmat_bsr_joint.cpp
===================================================================
--- tol/btol/vmatrix_type/vmat_bsr_joint.cpp	(revision d2cf6f7b992368d3821692535647efd888efbf3f)
+++ tol/btol/vmatrix_type/vmat_bsr_joint.cpp	(revision 66654eef0a9eeb8df6b2b0c13d3f03596da98d6f)
@@ -589,6 +589,6 @@
     int m = equ_vec.size();
     int r = ine_vec.size();
-    Std(BSR()+" Parsed "+r+" inequations \n");
-    Std(BSR()+" Building model definition  of joint module\n");
+  //Std(BSR()+" Parsed "+r+" inequations \n");
+  //Std(BSR()+" Building model definition  of joint module\n");
     int result = checkDimensions(m);
     if(result) { return(result); }
@@ -597,5 +597,5 @@
     for(i=0; i<noiseInfo_.size(); i++)
     {
-      Std(BSR()+" Building noise "+noiseInfo_[i].name.c_str()+"\n");
+    //Std(BSR()+" Building noise "+noiseInfo_[i].name.c_str()+"\n");
       if(expand2AllEqu_covAndFactors(noiseInfo_[i]))
       {
@@ -604,11 +604,11 @@
     }
     BVMat X_, A_;
-    Std(BSR()+" Allocating dense output with "+m+" cells\n");
+  //Std(BSR()+" Allocating dense output with "+m+" cells\n");
     Y.BlasRDense(m,1);
-    Std(BSR()+" Allocating triplet sparse input with "+Xnzmax_+" non null cells\n");
+  //Std(BSR()+" Allocating triplet sparse input with "+Xnzmax_+" non null cells\n");
     X_.ChlmRTriplet(m,n,Xnzmax_);
-    Std(BSR()+" Allocating dense inequation border with "+r+" cells\n");
+  //Std(BSR()+" Allocating dense inequation border with "+r+" cells\n");
     a_.BlasRDense(r,1);
-    Std(BSR()+" Allocating triplet sparse inequation coefficeints with "+Anzmax_+" cells\n");
+  //Std(BSR()+" Allocating triplet sparse inequation coefficeints with "+Anzmax_+" cells\n");
     A_.ChlmRTriplet(r,n,Anzmax_);
     size_t& Xn = X_.s_.chlmRtriplet_->nnz;
@@ -624,5 +624,5 @@
     int oldRatio = 0;
     Xn = 0;
-    Std(BSR()+"Building regression "+m+" equations with "+n+" variables\n");
+  //Std(BSR()+"Building regression "+m+" equations with "+n+" variables\n");
     for(i=0; i<m; i++)
     {
@@ -631,5 +631,5 @@
       {
         oldRatio = ratio;
-        Std(".");
+      //Std(".");
       }
       lin_reg_equation& eq =equ_vec[i]; 
@@ -646,10 +646,10 @@
       }
     }
-    Std("\n");
-    Std(BSR()+"Converting regression equations from triplet to sparse\n");
+  //Std("\n");
+  //Std(BSR()+"Converting regression equations from triplet to sparse\n");
     X.Convert(X_,BVMat::ESC_chlmRsparse);
     oldRatio = 0;
     An = 0;
-    Std(BSR()+"Building "+r+" constrain inequations with "+n+" variables\n");
+  //Std(BSR()+"Building "+r+" constrain inequations with "+n+" variables\n");
     for(i=0; i<r; i++)
     {
@@ -658,5 +658,5 @@
       {
         oldRatio = ratio;
-        Std(".");
+      //Std(".");
       }
       double sign = (ine_vec[i].isGE)?1.0:-1.0;
@@ -671,6 +671,6 @@
       }
     }
-    Std("\n");
-    Std(BSR()+"Converting constrain inequations from triplet to sparse\n");
+  //Std("\n");
+  //Std(BSR()+"Converting constrain inequations from triplet to sparse\n");
     A.Convert(A_,BVMat::ESC_chlmRsparse);
     result = getMissing(Y,X,inputMissingInfo_, outputMissingInfo_);
Index: tol/btol/vmatrix_type/vmat_bsr_primary.cpp
===================================================================
--- tol/btol/vmatrix_type/vmat_bsr_primary.cpp	(revision d2cf6f7b992368d3821692535647efd888efbf3f)
+++ tol/btol/vmatrix_type/vmat_bsr_primary.cpp	(revision 66654eef0a9eeb8df6b2b0c13d3f03596da98d6f)
@@ -591,10 +591,10 @@
     int r = ine_vec.size();
     if(!n && !X_.Rows()) { X_.BlasRDense(m,0); }
-    Std(BSR()+" Building model definition of primary module\n");
+  //Std(BSR()+" Building model definition of primary module\n");
     int result = checkDimensions(m);
     if(result) { return(result); }
     linearInfo_  = var.vec;
     noiseInfo_   = noise.vec;
-    Std(BSR()+" Building noise "+noiseInfo_[0].name.c_str()+"\n");
+  //Std(BSR()+" Building noise "+noiseInfo_[0].name.c_str()+"\n");
     for(i=1; i<=m; i++)
     {
@@ -625,7 +625,7 @@
       X = X_;
       BVMat A_;
-      Std(BSR()+" Allocating dense inequation border with "+r+" cells\n");
+    //Std(BSR()+" Allocating dense inequation border with "+r+" cells\n");
       a_.BlasRDense(r,1);
-      Std(BSR()+" Allocating triplet sparse inequation coefficeints with "+Anzmax_+" cells\n");
+    //Std(BSR()+" Allocating triplet sparse inequation coefficeints with "+Anzmax_+" cells\n");
       A_.ChlmRTriplet(r,n,Anzmax_);
       size_t& An = A_.s_.chlmRtriplet_->nnz;
@@ -636,5 +636,5 @@
       int oldRatio = 0;
       An = 0;
-      Std(BSR()+"Building "+r+"constrain inequations with "+n+" variables\n");
+    //Std(BSR()+"Building "+r+"constrain inequations with "+n+" variables\n");
       for(i=0; i<r; i++)
       {
@@ -643,5 +643,5 @@
         {
           oldRatio = ratio;
-          Std(".");
+        //Std(".");
         }
         double sign = (ine_vec[i].isGE)?1.0:-1.0;
@@ -656,6 +656,6 @@
         }
       }
-      Std("\n");
-      Std(BSR()+"Converting constrain inequations from triplet to sparse\n");
+    //Std("\n");
+    //Std(BSR()+"Converting constrain inequations from triplet to sparse\n");
       A.Convert(A_,BVMat::ESC_chlmRsparse);
       result = getMissing(Y,X,inputMissingInfo_, outputMissingInfo_);