From: trevor_hansen <trevor_hansen@e59a4935-1847-0410-ae03-e826735625c1>
Date: Wed, 23 Jun 2010 14:02:20 +0000 (+0000)
Subject: Fix grammar. Extra assertion.
X-Git-Url: https://git.unchartedbackwaters.co.uk/w/?a=commitdiff_plain;h=b699e97d76818eac3d9bb7328063d2226da51160;p=francis%2Fstp.git

Fix grammar. Extra assertion.

git-svn-id: https://stp-fast-prover.svn.sourceforge.net/svnroot/stp-fast-prover/trunk/stp@864 e59a4935-1847-0410-ae03-e826735625c1
---

diff --git a/src/simplifier/bvsolver.cpp b/src/simplifier/bvsolver.cpp
index a227b1e..1496b7e 100644
--- a/src/simplifier/bvsolver.cpp
+++ b/src/simplifier/bvsolver.cpp
@@ -941,7 +941,7 @@ namespace BEEV
 	// This builds a reduced version of a graph, where there
     // is only a new node if the number of non-array SYMBOLS
     // in the descendents changes. For example (EXTRACT 0 1 n)
-    // will have the same "Symbols" node as n, because there is
+    // will have the same "Symbols" node as n, because
     // no new symbols are introduced.
 	Symbols* BVSolver::BuildSymbolGraph(const ASTNode& n)
 	{
@@ -1012,6 +1012,8 @@ namespace BEEV
 
 	  bool BVSolver::VarSeenInTerm(const ASTNode& var, const ASTNode& term)
 	  {
+		  // This only returns true if we are searching for variables that aren't arrays.
+		  assert(var.GetKind() == SYMBOL && var.GetIndexWidth() == 0);
 		  BuildSymbolGraph(term);
 		  return VarSeenInTerm(var,symbol_graph[term]);
 	  }