Excluded array-speedup debugging output.

Author: Tuttle

src/solvers/flattening/arrays.cpp

@@ -221,9 +221,11 @@ void arrayst::weg_path_condition(
 {
   for(const auto &pn : path)
   {
+#if ARRAY_SPEEDUP_DEBUG
     std::cout << "edge: " << pn.n << "->" <<
       pn.edge->first << " " <<
       format(arrays[pn.n]) << "\n";
+#endif
 
     const weg_edget &weg_edge=pn.edge->second;
 
@@ -249,9 +251,11 @@ void arrayst::process_weg_path(const weg_patht &path)
   const index_sett &index_set_a=index_map[a];
   const index_sett &index_set_b=index_map[b];
 
+#if ARRAY_SPEEDUP_DEBUG
   std::cout << "b is: "
             << format(arrays[b])
             << '\n';
+#endif
 
   for(const auto &index_a : index_set_a)
   {
@@ -278,9 +282,11 @@ void arrayst::process_weg_path(const weg_patht &path)
       implies_exprt implication(
         conjunction(cond),
         equal_exprt(a_i, value_b));
+#if ARRAY_SPEEDUP_DEBUG
       std::cout << "C2a: "
                 << format(implication)
                 << '\n';
+#endif
       set_to_true(implication);
     }
     else if(arrays[b].id()==ID_array_of)
@@ -302,9 +308,11 @@ void arrayst::process_weg_path(const weg_patht &path)
       implies_exprt implication(
         conjunction(cond),
         equal_exprt(a_i, value_b));
+#if ARRAY_SPEEDUP_DEBUG
       std::cout << "C2b: "
                 << format(implication)
                 << '\n';
+#endif
       set_to_true(implication);
     }
 
@@ -331,9 +339,11 @@ void arrayst::process_weg_path(const weg_patht &path)
         implies_exprt implication(
           conjunction(cond),
           equal_exprt(a_i, b_i));
+#if ARRAY_SPEEDUP_DEBUG
         std::cout << "C3: "
                   << format(implication)
                   << '\n';
+#endif
         set_to_true(implication);
       }
     }
@@ -342,21 +352,25 @@ void arrayst::process_weg_path(const weg_patht &path)
 
 void arrayst::add_array_constraints()
 {
+#if ARRAY_SPEEDUP_DEBUG
   for(const auto & a : arrays)
   {
     std::cout << "array: " << format(a)
               << '\n';
   }
+#endif
 
   // auxiliary bit per node for DFS
   std::vector<bool> visited;
   visited.resize(weg.size());
 
   for(wegt::node_indext a=0; a<arrays.size(); a++)
   {
+#if ARRAY_SPEEDUP_DEBUG
     std::cout << "a is: "
               << format(arrays[a])
               << '\n';
+#endif
 
     // DFS from a_i to anything reachable in 'weg'
     std::fill(visited.begin(), visited.end(), false);
@@ -454,11 +468,13 @@ void arrayst::add_array_Ackermann_constraints()
           equal_exprt values_equal(index_expr1, index_expr2);
           prop.lcnf(!indices_equal_lit, convert(values_equal));
 
+#if ARRAY_SPEEDUP_DEBUG
           std::cout << "C4: "
                     << format(indices_equal)
                     << " => "
                     << format(values_equal)
                     << '\n';
+#endif
         }
       }
     }