2017-07-06 09:05:05 +00:00
|
|
|
/*
|
|
|
|
This file is part of solidity.
|
|
|
|
|
|
|
|
solidity is free software: you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
solidity is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with solidity. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#pragma once
|
|
|
|
|
2017-09-28 13:24:24 +00:00
|
|
|
|
2017-07-13 16:22:51 +00:00
|
|
|
#include <libsolidity/formal/SolverInterface.h>
|
2018-10-22 08:29:03 +00:00
|
|
|
#include <libsolidity/formal/SymbolicVariables.h>
|
2018-01-17 20:02:23 +00:00
|
|
|
|
2017-09-28 13:24:24 +00:00
|
|
|
#include <libsolidity/ast/ASTVisitor.h>
|
|
|
|
|
2017-07-11 11:26:43 +00:00
|
|
|
#include <libsolidity/interface/ReadFile.h>
|
|
|
|
|
2018-11-12 11:21:25 +00:00
|
|
|
#include <libsolidity/parsing/Scanner.h>
|
|
|
|
|
2018-10-15 15:32:17 +00:00
|
|
|
#include <unordered_map>
|
2017-07-06 09:05:05 +00:00
|
|
|
#include <string>
|
2017-12-11 19:09:17 +00:00
|
|
|
#include <vector>
|
2017-07-06 09:05:05 +00:00
|
|
|
|
|
|
|
namespace dev
|
|
|
|
{
|
|
|
|
namespace solidity
|
|
|
|
{
|
|
|
|
|
2017-09-28 13:24:24 +00:00
|
|
|
class VariableUsage;
|
2017-07-06 09:05:05 +00:00
|
|
|
class ErrorReporter;
|
|
|
|
|
2017-07-11 11:26:43 +00:00
|
|
|
class SMTChecker: private ASTConstVisitor
|
2017-07-06 09:05:05 +00:00
|
|
|
{
|
|
|
|
public:
|
2017-07-13 19:06:04 +00:00
|
|
|
SMTChecker(ErrorReporter& _errorReporter, ReadCallback::Callback const& _readCallback);
|
2017-07-06 09:05:05 +00:00
|
|
|
|
2018-11-12 11:21:25 +00:00
|
|
|
void analyze(SourceUnit const& _sources, std::shared_ptr<Scanner> const& _scanner);
|
2017-07-06 09:05:05 +00:00
|
|
|
|
|
|
|
private:
|
2017-07-11 11:26:43 +00:00
|
|
|
// TODO: Check that we do not have concurrent reads and writes to a variable,
|
|
|
|
// because the order of expression evaluation is undefined
|
|
|
|
// TODO: or just force a certain order, but people might have a different idea about that.
|
|
|
|
|
2018-04-30 14:30:41 +00:00
|
|
|
virtual bool visit(ContractDefinition const& _node) override;
|
|
|
|
virtual void endVisit(ContractDefinition const& _node) override;
|
2017-07-11 11:26:43 +00:00
|
|
|
virtual void endVisit(VariableDeclaration const& _node) override;
|
|
|
|
virtual bool visit(FunctionDefinition const& _node) override;
|
|
|
|
virtual void endVisit(FunctionDefinition const& _node) override;
|
2017-07-14 09:49:27 +00:00
|
|
|
virtual bool visit(IfStatement const& _node) override;
|
|
|
|
virtual bool visit(WhileStatement const& _node) override;
|
2017-10-04 19:45:45 +00:00
|
|
|
virtual bool visit(ForStatement const& _node) override;
|
2017-07-11 11:26:43 +00:00
|
|
|
virtual void endVisit(VariableDeclarationStatement const& _node) override;
|
|
|
|
virtual void endVisit(Assignment const& _node) override;
|
|
|
|
virtual void endVisit(TupleExpression const& _node) override;
|
2017-10-05 13:23:25 +00:00
|
|
|
virtual void endVisit(UnaryOperation const& _node) override;
|
2017-07-11 11:26:43 +00:00
|
|
|
virtual void endVisit(BinaryOperation const& _node) override;
|
|
|
|
virtual void endVisit(FunctionCall const& _node) override;
|
|
|
|
virtual void endVisit(Identifier const& _node) override;
|
|
|
|
virtual void endVisit(Literal const& _node) override;
|
2018-10-10 12:31:49 +00:00
|
|
|
virtual void endVisit(Return const& _node) override;
|
2018-10-18 13:03:52 +00:00
|
|
|
virtual bool visit(MemberAccess const& _node) override;
|
2017-07-11 11:26:43 +00:00
|
|
|
|
|
|
|
void arithmeticOperation(BinaryOperation const& _op);
|
|
|
|
void compareOperation(BinaryOperation const& _op);
|
|
|
|
void booleanOperation(BinaryOperation const& _op);
|
|
|
|
|
2018-10-10 12:31:49 +00:00
|
|
|
void visitAssert(FunctionCall const&);
|
|
|
|
void visitRequire(FunctionCall const&);
|
2018-10-18 13:03:52 +00:00
|
|
|
void visitGasLeft(FunctionCall const&);
|
|
|
|
void visitBlockHash(FunctionCall const&);
|
2018-10-10 12:31:49 +00:00
|
|
|
/// Visits the FunctionDefinition of the called function
|
|
|
|
/// if available and inlines the return value.
|
|
|
|
void inlineFunctionCall(FunctionCall const&);
|
|
|
|
|
2018-10-18 13:03:52 +00:00
|
|
|
void defineSpecialVariable(std::string const& _name, Expression const& _expr, bool _increaseIndex = false);
|
2018-10-25 14:00:09 +00:00
|
|
|
void defineUninterpretedFunction(std::string const& _name, std::vector<smt::Sort> const& _domain, smt::Sort _codomain);
|
2018-10-18 13:03:52 +00:00
|
|
|
|
2017-10-05 17:20:46 +00:00
|
|
|
/// Division expression in the given type. Requires special treatment because
|
|
|
|
/// of rounding for signed division.
|
|
|
|
smt::Expression division(smt::Expression _left, smt::Expression _right, IntegerType const& _type);
|
|
|
|
|
2018-06-12 08:58:24 +00:00
|
|
|
void assignment(VariableDeclaration const& _variable, Expression const& _value, SourceLocation const& _location);
|
|
|
|
void assignment(VariableDeclaration const& _variable, smt::Expression const& _value, SourceLocation const& _location);
|
2017-09-28 13:24:24 +00:00
|
|
|
|
2017-12-18 18:43:15 +00:00
|
|
|
/// Maps a variable to an SSA index.
|
2018-10-17 09:32:01 +00:00
|
|
|
using VariableIndices = std::unordered_map<VariableDeclaration const*, int>;
|
2017-12-18 18:43:15 +00:00
|
|
|
|
|
|
|
/// Visits the branch given by the statement, pushes and pops the current path conditions.
|
|
|
|
/// @param _condition if present, asserts that this condition is true within the branch.
|
2018-10-17 09:32:01 +00:00
|
|
|
/// @returns the variable indices after visiting the branch.
|
|
|
|
VariableIndices visitBranch(Statement const& _statement, smt::Expression const* _condition = nullptr);
|
|
|
|
VariableIndices visitBranch(Statement const& _statement, smt::Expression _condition);
|
2017-09-28 11:44:56 +00:00
|
|
|
|
2017-09-29 14:53:26 +00:00
|
|
|
/// Check that a condition can be satisfied.
|
2017-07-11 11:26:43 +00:00
|
|
|
void checkCondition(
|
|
|
|
smt::Expression _condition,
|
|
|
|
SourceLocation const& _location,
|
|
|
|
std::string const& _description,
|
|
|
|
std::string const& _additionalValueName = "",
|
|
|
|
smt::Expression* _additionalValue = nullptr
|
|
|
|
);
|
2017-09-29 14:53:26 +00:00
|
|
|
/// Checks that a boolean condition is not constant. Do not warn if the expression
|
|
|
|
/// is a literal constant.
|
|
|
|
/// @param _description the warning string, $VALUE will be replaced by the constant value.
|
|
|
|
void checkBooleanNotConstant(
|
|
|
|
Expression const& _condition,
|
|
|
|
std::string const& _description
|
|
|
|
);
|
2017-10-05 13:23:25 +00:00
|
|
|
/// Checks that the value is in the range given by the type.
|
|
|
|
void checkUnderOverflow(smt::Expression _value, IntegerType const& _Type, SourceLocation const& _location);
|
|
|
|
|
2017-09-29 14:53:26 +00:00
|
|
|
|
|
|
|
std::pair<smt::CheckResult, std::vector<std::string>>
|
2017-12-18 16:31:27 +00:00
|
|
|
checkSatisfiableAndGenerateModel(std::vector<smt::Expression> const& _expressionsToEvaluate);
|
2017-09-29 14:53:26 +00:00
|
|
|
|
2017-12-18 16:31:27 +00:00
|
|
|
smt::CheckResult checkSatisfiable();
|
2017-07-11 11:26:43 +00:00
|
|
|
|
2017-09-28 13:24:24 +00:00
|
|
|
void initializeLocalVariables(FunctionDefinition const& _function);
|
2018-10-10 12:31:49 +00:00
|
|
|
void initializeFunctionCallParameters(FunctionDefinition const& _function, std::vector<smt::Expression> const& _callArgs);
|
2018-04-18 21:14:45 +00:00
|
|
|
void resetStateVariables();
|
2018-06-12 08:58:24 +00:00
|
|
|
void resetVariables(std::vector<VariableDeclaration const*> _variables);
|
2017-12-18 18:43:15 +00:00
|
|
|
/// Given two different branches and the touched variables,
|
|
|
|
/// merge the touched variables into after-branch ite variables
|
|
|
|
/// using the branch condition as guard.
|
2018-10-17 09:32:01 +00:00
|
|
|
void mergeVariables(std::vector<VariableDeclaration const*> const& _variables, smt::Expression const& _condition, VariableIndices const& _indicesEndTrue, VariableIndices const& _indicesEndFalse);
|
2017-10-05 17:31:17 +00:00
|
|
|
/// Tries to create an uninitialized variable and returns true on success.
|
|
|
|
/// This fails if the type is not supported.
|
|
|
|
bool createVariable(VariableDeclaration const& _varDecl);
|
2017-07-11 11:26:43 +00:00
|
|
|
|
2017-07-14 09:49:27 +00:00
|
|
|
/// @returns true if _delc is a variable that is known at the current point, i.e.
|
2018-10-17 09:32:01 +00:00
|
|
|
/// has a valid index
|
2018-06-12 08:58:24 +00:00
|
|
|
bool knownVariable(VariableDeclaration const& _decl);
|
2017-07-14 09:49:27 +00:00
|
|
|
/// @returns an expression denoting the value of the variable declared in @a _decl
|
|
|
|
/// at the current point.
|
2018-06-12 08:58:24 +00:00
|
|
|
smt::Expression currentValue(VariableDeclaration const& _decl);
|
2017-07-14 09:49:27 +00:00
|
|
|
/// @returns an expression denoting the value of the variable declared in @a _decl
|
2018-10-17 09:32:01 +00:00
|
|
|
/// at the given index. Does not ensure that this index exists.
|
|
|
|
smt::Expression valueAtIndex(VariableDeclaration const& _decl, int _index);
|
|
|
|
/// Allocates a new index for the declaration, updates the current
|
|
|
|
/// index to this value and returns the expression.
|
2018-06-12 08:58:24 +00:00
|
|
|
smt::Expression newValue(VariableDeclaration const& _decl);
|
2017-07-11 11:26:43 +00:00
|
|
|
|
2017-09-28 13:24:24 +00:00
|
|
|
/// Sets the value of the declaration to zero.
|
2018-06-12 08:58:24 +00:00
|
|
|
void setZeroValue(VariableDeclaration const& _decl);
|
2017-09-28 13:24:24 +00:00
|
|
|
/// Resets the variable to an unknown value (in its range).
|
2018-06-12 08:58:24 +00:00
|
|
|
void setUnknownValue(VariableDeclaration const& decl);
|
2017-07-14 09:49:27 +00:00
|
|
|
|
2017-10-05 13:23:25 +00:00
|
|
|
/// Returns the expression corresponding to the AST node. Throws if the expression does not exist.
|
2017-07-11 11:26:43 +00:00
|
|
|
smt::Expression expr(Expression const& _e);
|
2017-10-05 13:23:25 +00:00
|
|
|
/// Creates the expression (value can be arbitrary)
|
|
|
|
void createExpr(Expression const& _e);
|
2018-10-10 12:31:49 +00:00
|
|
|
/// Checks if expression was created
|
2018-10-18 13:03:52 +00:00
|
|
|
bool knownExpr(Expression const& _e) const;
|
2017-10-05 13:23:25 +00:00
|
|
|
/// Creates the expression and sets its value.
|
|
|
|
void defineExpr(Expression const& _e, smt::Expression _value);
|
2017-07-11 11:26:43 +00:00
|
|
|
|
2018-10-18 13:03:52 +00:00
|
|
|
/// Checks if special variable was seen.
|
|
|
|
bool knownSpecialVariable(std::string const& _var) const;
|
|
|
|
|
2017-12-11 19:09:17 +00:00
|
|
|
/// Adds a new path condition
|
|
|
|
void pushPathCondition(smt::Expression const& _e);
|
|
|
|
/// Remove the last path condition
|
|
|
|
void popPathCondition();
|
|
|
|
/// Returns the conjunction of all path conditions or True if empty
|
|
|
|
smt::Expression currentPathConditions();
|
2017-12-13 16:59:36 +00:00
|
|
|
/// Conjoin the current path conditions with the given parameter and add to the solver
|
|
|
|
void addPathConjoinedExpression(smt::Expression const& _e);
|
|
|
|
/// Add to the solver: the given expression implied by the current path conditions
|
|
|
|
void addPathImpliedExpression(smt::Expression const& _e);
|
2017-12-11 19:09:17 +00:00
|
|
|
|
2018-10-10 12:31:49 +00:00
|
|
|
/// Removes local variables from the context.
|
2018-06-06 10:11:58 +00:00
|
|
|
void removeLocalVariables();
|
2018-06-05 09:46:21 +00:00
|
|
|
|
2018-10-15 15:32:17 +00:00
|
|
|
/// Copy the SSA indices of m_variables.
|
2018-10-17 09:32:01 +00:00
|
|
|
VariableIndices copyVariableIndices();
|
|
|
|
/// Resets the variable indices.
|
|
|
|
void resetVariableIndices(VariableIndices const& _indices);
|
2018-10-15 15:32:17 +00:00
|
|
|
|
2017-07-13 16:22:51 +00:00
|
|
|
std::shared_ptr<smt::SolverInterface> m_interface;
|
2017-09-28 13:24:24 +00:00
|
|
|
std::shared_ptr<VariableUsage> m_variableUsage;
|
2018-04-19 07:28:44 +00:00
|
|
|
bool m_loopExecutionHappened = false;
|
2018-10-10 12:31:49 +00:00
|
|
|
/// An Expression may have multiple smt::Expression due to
|
|
|
|
/// repeated calls to the same function.
|
2018-10-17 16:00:42 +00:00
|
|
|
std::unordered_map<Expression const*, std::shared_ptr<SymbolicVariable>> m_expressions;
|
2018-10-15 15:32:17 +00:00
|
|
|
std::unordered_map<VariableDeclaration const*, std::shared_ptr<SymbolicVariable>> m_variables;
|
2018-10-18 13:03:52 +00:00
|
|
|
std::unordered_map<std::string, std::shared_ptr<SymbolicVariable>> m_specialVariables;
|
2018-10-25 14:00:09 +00:00
|
|
|
/// Stores the declaration of an Uninterpreted Function.
|
|
|
|
std::unordered_map<std::string, smt::Expression> m_uninterpretedFunctions;
|
|
|
|
/// Stores the instances of an Uninterpreted Function applied to arguments.
|
|
|
|
/// Used to retrieve models.
|
|
|
|
std::vector<Expression const*> m_uninterpretedTerms;
|
2017-12-11 19:09:17 +00:00
|
|
|
std::vector<smt::Expression> m_pathConditions;
|
2017-07-11 11:26:43 +00:00
|
|
|
ErrorReporter& m_errorReporter;
|
2018-11-12 11:21:25 +00:00
|
|
|
std::shared_ptr<Scanner> m_scanner;
|
2017-07-11 11:26:43 +00:00
|
|
|
|
2018-10-10 12:31:49 +00:00
|
|
|
/// Stores the current path of function calls.
|
|
|
|
std::vector<FunctionDefinition const*> m_functionPath;
|
|
|
|
/// Returns true if the current function was not visited by
|
|
|
|
/// a function call.
|
|
|
|
bool isRootFunction();
|
|
|
|
/// Returns true if _funDef was already visited.
|
|
|
|
bool visitedFunction(FunctionDefinition const* _funDef);
|
2017-07-06 09:05:05 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|