diff --git a/CHANGELOG.md b/CHANGELOG.md
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -11,5 +11,5 @@
 ----------------
 
 New functions in Math.ExpPairs.Ivic: reverseMOnS, checkAbscissa, findMinAbscissa, mBigOnHalf, reverseMBigOnHalf.
-Fast mastrix multiplication via Makarov and Laderman algorithms.
+Fast matrix multiplication via Makarov and Laderman algorithms.
 Rewrite from the scratch pretty printer of processes.
diff --git a/exp-pairs.cabal b/exp-pairs.cabal
--- a/exp-pairs.cabal
+++ b/exp-pairs.cabal
@@ -1,5 +1,5 @@
 name:                exp-pairs
-version:             0.1.4.0
+version:             0.1.4.1
 synopsis:            Linear programming over exponent pairs
 description:         Package implements an algorithm to minimize rational objective function over the set of exponent pairs
 homepage:            https://github.com/Bodigrim/exp-pairs
diff --git a/tests/Ivic.hs b/tests/Ivic.hs
--- a/tests/Ivic.hs
+++ b/tests/Ivic.hs
@@ -23,9 +23,9 @@
   [ a,  b] = map fromMinus3To3 [a', b']
   [za, zb] = map (optimalValue . zetaOnS) [a, b]
 
--- May fail due to the granularity of 'sect'.
+-- Strict comparison without 3e-4 may fail due to the granularity of 'sect'.
 testZetaOnS2 :: Sorted (Ratio01 Rational, Ratio01 Rational) -> Bool
-testZetaOnS2 (Sorted (Ratio01 a, Ratio01 b)) = a == b || za > zb where
+testZetaOnS2 (Sorted (Ratio01 a, Ratio01 b)) = a == b || za + 5e-4 > zb where
   [za, zb] = map (optimalValue . zetaOnS) [a, b]
 
 testZetaOnSsym :: Ratio01 Rational -> Bool
@@ -97,9 +97,9 @@
   , adjustOption (\(SC.SmallCheckDepth n) -> SC.SmallCheckDepth (n `div` 2)) $
       SC.testProperty "mOnS monotonic" testMOnS1
   , QC.testProperty "mOnS monotonic" testMOnS1
-  -- , adjustOption (\(SC.SmallCheckDepth n) -> SC.SmallCheckDepth (n `div` 2)) $
-  --     SC.testProperty "mOnS strict monotonic" testMOnS2
-  -- , QC.testProperty "mOnS strict monotonic" testMOnS2
+  , adjustOption (\(SC.SmallCheckDepth n) -> SC.SmallCheckDepth (n `div` 2)) $
+      SC.testProperty "mOnS strict monotonic" testMOnS2
+  , QC.testProperty "mOnS strict monotonic" testMOnS2
   , SC.testProperty "zetaOnS reverse" testZetaReverse
   , QC.testProperty "zetaOnS reverse" testZetaReverse
   , SC.testProperty "zetaOnS symmetry" testZetaOnSsym
@@ -110,10 +110,6 @@
   , QC.testProperty "mOnS below s=1/2" testMOnSZero
   , SC.testProperty "mOnS above s=1" testMOnSInf
   , QC.testProperty "mOnS above s=1" testMOnSInf
-  -- , SC.testProperty "mOnS convex" testMConvex
-  -- , QC.testProperty "mOnS convex" testMConvex
-  -- , SC.testProperty "zetaOnS convex" testZetaConvex
-  -- , QC.testProperty "zetaOnS convex" testZetaConvex
   ]
 
 
diff --git a/tests/Kratzel.hs b/tests/Kratzel.hs
--- a/tests/Kratzel.hs
+++ b/tests/Kratzel.hs
@@ -29,7 +29,7 @@
 
 testAbcMonotonic :: Sorted (Positive Integer, Positive Integer, Positive Integer, Positive Integer, Positive Integer, Positive Integer) -> Bool
 testAbcMonotonic (Sorted (Positive a, Positive d, Positive b, Positive e, Positive c, Positive f))
-  = (a == d && b == e && c == f) || theoremAbc `elem` [Kolesnik, Kr64] || zabc >= zdef
+  = (a == d && b == e && c == f) || theoremAbc `elem` [Kolesnik, Kr64, Kr65] || zabc >= zdef
     where
       (theoremAbc, resultAbc) = tauabc a b c
       zabc = optimalValue resultAbc