diff --git a/crates/fayalite/tests/formal.rs b/crates/fayalite/tests/formal.rs
index 46b8292..3100fe5 100644
--- a/crates/fayalite/tests/formal.rs
+++ b/crates/fayalite/tests/formal.rs
@@ -95,19 +95,17 @@ mod hidden_state {
             hdl_assert(clk, o, "");
 
             // additional terms below are only needed to assist with the induction proof
-            match constraint_mode {
-                WithExtraAssertions => {
-                    // "Open the box": add assertions about hidden state.
-                    // In this case, the hidden bits are also always equal.
-                    hdl_assert(clk, r1.cmp_eq(r2), "");
-                }
-                WithExtraAssumptions => {
-                    // Break the loop, do not allow "en" to remain low forever
-                    #[hdl]
-                    let past_en_reg = reg_builder().clock_domain(cd).reset(false);
-                    connect(past_en_reg, en);
-                    hdl_assume(clk, past_en_reg | en, "");
-                }
+            if let WithExtraAssertions = constraint_mode {
+                // "Open the box": add assertions about hidden state.
+                // In this case, the hidden bits are also always equal.
+                hdl_assert(clk, r1.cmp_eq(r2), "");
+            }
+            if let WithExtraAssumptions = constraint_mode {
+                // Break the loop, do not allow "en" to remain low forever
+                #[hdl]
+                let past_en_reg = reg_builder().clock_domain(cd).reset(false);
+                connect(past_en_reg, en);
+                hdl_assume(clk, past_en_reg | en, "");
             }
         }
         // we need a minimum of 16 steps so we can constrain all eight shift register bits,