diff --git a/examples/simple/src/BadElections.sol b/examples/simple/src/BadElections.sol
new file mode 100644
index 00000000..24ffd798
--- /dev/null
+++ b/examples/simple/src/BadElections.sol
@@ -0,0 +1,38 @@
+// SPDX-License-Identifier: AGPL-3.0
+pragma solidity >=0.8.0 <0.9.0;
+
+import {ECDSA} from "openzeppelin/utils/cryptography/ECDSA.sol";
+
+/// DO NOT USE, this demonstrates signature malleability problems
+contract BadElections {
+    event Voted(uint256 proposalId, bool support, address voter);
+
+    mapping (bytes32 => bool) hasVoted;
+
+    // maps proposalId to vote count
+    mapping (uint256 => uint256) public votesFor;
+    mapping (uint256 => uint256) public votesAgainst;
+
+    // vote on a proposal by signature, anyone can cast a vote on behalf of someone else
+    function vote(uint256 proposalId, bool support, address voter, bytes calldata signature) public {
+        bytes32 sigHash = keccak256(signature);
+        require(!hasVoted[sigHash], "already voted");
+
+        bytes32 badSigDigest = keccak256(abi.encode(proposalId, support, voter));
+        address recovered = ECDSA.recover(badSigDigest, signature);
+        require(recovered == voter, "invalid signature");
+        require(recovered != address(0), "invalid signature");
+
+        // prevent replay
+        hasVoted[sigHash] = true;
+
+        // record vote
+        if (support) {
+            votesFor[proposalId]++;
+        } else {
+            votesAgainst[proposalId]++;
+        }
+
+        emit Voted(proposalId, support, voter);
+    }
+}
diff --git a/examples/simple/test/BadElections.t.sol b/examples/simple/test/BadElections.t.sol
new file mode 100644
index 00000000..5c5ed196
--- /dev/null
+++ b/examples/simple/test/BadElections.t.sol
@@ -0,0 +1,60 @@
+// SPDX-License-Identifier: AGPL-3.0
+pragma solidity >=0.8.0 <0.9.0;
+
+import "forge-std/Test.sol";
+
+import {SymTest} from "halmos-cheatcodes/SymTest.sol";
+
+import {BadElections} from "src/BadElections.sol";
+
+contract BadElectionsTest is SymTest, Test {
+    BadElections elections;
+
+    function setUp() public {
+        elections = new BadElections();
+    }
+
+    /// The output will look something like this:
+    ///
+    ///     Running 1 tests for test/BadElections.t.sol:BadElectionsTest
+    ///     Counterexample:
+    ///         halmos_fakeSig_bytes_01 = 0x00000000000000000000000000000000000000000000000000000000000000003fffffffffffffffffffffffffffffff5d576e7357a4501ddfe92f46681b20a100 (65 bytes)
+    ///         p_proposalId_uint256 = 0x0000000000000000000000000000000000000000000000000000000000000000 (0)
+    ///     [FAIL] check_canNotVoteTwice(uint256) (paths: 7, time: 0.63s, bounds: [])
+    ///
+    /// the counterexample values are not meaningful, but examining the trace shows
+    /// that halmos found a signature s.t. the voter can vote twice on the same proposal,
+    /// and the final vote count is 2
+    function check_canNotVoteTwice(uint256 proposalId) public {
+        // setup
+        bool support = true;
+        (address voter, uint256 privateKey) = makeAddrAndKey("voter");
+
+        bytes32 sigDigest = keccak256(abi.encode(proposalId, support, voter));
+        (uint8 v, bytes32 r, bytes32 s) = vm.sign(privateKey, sigDigest);
+        bytes memory signature = abi.encodePacked(r, s, v);
+
+        // we start with no vote
+        assertEq(elections.votesFor(proposalId), 0);
+
+        // when we cast the vote
+        elections.vote(proposalId, support, voter, signature);
+
+        // then the vote count increases
+        assertEq(elections.votesFor(proposalId), 1);
+
+        // when we vote again with the same signature, it reverts
+        try elections.vote(proposalId, support, voter, signature) {
+            assert(false);
+        } catch {
+            // expected
+        }
+
+        // when the same voter votes with a different signature
+        elections.vote(proposalId, support, voter, svm.createBytes(65, "fakeSig"));
+
+        // then the vote count remains unchanged
+        // @note spoiler alert: it does not
+        assertEq(elections.votesFor(proposalId), 1);
+    }
+}