Do a final propagation round at the end

src/lib/CoAlgReasoner.ml

@@ -1080,6 +1080,7 @@ let isSat ?(verbose = false) sorts nomTable tbox sf =
   let sat =
     try
       buildGraphLoop ();
+      propagateUnsatMu ();
       (* get whether the root is satisfiable *)
       (* we know that the reasoner finished, so the value is there, *)
       (* i.e. isRootSat() will give a "Some x" and not "None" *)