From bde69593f4d4f9107ee6e094b4ae371cc18b5b6f Mon Sep 17 00:00:00 2001
From: Joran Honig <joran.honig@gmail.com>
Date: Sun, 28 Oct 2018 19:32:37 +0100
Subject: [PATCH] Don't check for requires as this results in false negatives

---
 mythril/analysis/modules/integer.py | 23 -----------------------
 1 file changed, 23 deletions(-)

diff --git a/mythril/analysis/modules/integer.py b/mythril/analysis/modules/integer.py
index b5c952f8..c46638cd 100644
--- a/mythril/analysis/modules/integer.py
+++ b/mythril/analysis/modules/integer.py
@@ -290,8 +290,6 @@ def _search_children(
             element = _check_usage(current_state, taint_result)
             if len(element) < 1:
                 continue
-            if _check_requires(element[0], node, statespace, constraint):
-                continue
             results += element
 
     # Recursively search children
@@ -313,24 +311,3 @@ def _search_children(
         )
 
     return results
-
-
-def _check_requires(state, node, statespace, constraint):
-    """Checks if usage of overflowed statement results in a revert statement"""
-    instruction = state.get_current_instruction()
-    if instruction["opcode"] is not "JUMPI":
-        return False
-    children = [
-        statespace.nodes[edge.node_to]
-        for edge in statespace.edges
-        if edge.node_from == node.uid
-    ]
-
-    for child in children:
-        opcodes = [s.get_current_instruction()["opcode"] for s in child.states]
-        if "REVERT" in opcodes or "ASSERT_FAIL" in opcodes:
-            return True
-    # I added the following case, bc of false positives if the max depth is not high enough
-    if len(children) == 0:
-        return True
-    return False