Head

GCC Code Coverage Report

Directory:	.		Exec	Total	Coverage
File:	test/unit/node/node_algorithm_black.cpp	Lines:	93	93	100.0 %
Date:	2021-05-22	Branches:	311	886	35.1 %


/******************************************************************************
 * Top contributors (to current version):
 *   Aina Niemetz, Yoni Zohar, Abdalrhman Mohamed
 *
 * This file is part of the cvc5 project.
 *
 * Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
 * in the top-level source directory and their institutional affiliations.
 * All rights reserved.  See the file COPYING in the top-level source
 * directory for licensing information.
 * ****************************************************************************
 *
 * Black box testing of node_algorithm.{h,cpp}
 */

#include <string>
#include <vector>

#include "base/output.h"
#include "expr/node_algorithm.h"
#include "expr/node_manager.h"
#include "test_node.h"
#include "theory/bv/theory_bv_utils.h"
#include "util/integer.h"
#include "util/rational.h"

namespace cvc5 {

using namespace expr;
using namespace kind;

namespace test {

class TestNodeBlackNodeAlgorithm : public TestNode
{
};

TEST_F(TestNodeBlackNodeAlgorithm, get_symbols1)
{
  // The only symbol in ~x (x is a boolean varible) should be x
  Node x = d_skolemManager->mkDummySkolem("x", d_nodeManager->booleanType());
  Node n = d_nodeManager->mkNode(NOT, x);
  std::unordered_set<Node> syms;
  getSymbols(n, syms);
  ASSERT_EQ(syms.size(), 1);
  ASSERT_NE(syms.find(x), syms.end());
}

TEST_F(TestNodeBlackNodeAlgorithm, get_symbols2)
{
  // the only symbols in x=y ^ (exists var. var+var = x) are x and y, because
  // "var" is bound.

  // left conjunct
  Node x = d_skolemManager->mkDummySkolem("x", d_nodeManager->integerType());
  Node y = d_skolemManager->mkDummySkolem("y", d_nodeManager->integerType());
  Node left = d_nodeManager->mkNode(EQUAL, x, y);

  // right conjunct
  Node var = d_nodeManager->mkBoundVar(*d_intTypeNode);
  std::vector<Node> vars;
  vars.push_back(var);
  Node sum = d_nodeManager->mkNode(PLUS, var, var);
  Node qeq = d_nodeManager->mkNode(EQUAL, x, sum);
  Node bvl = d_nodeManager->mkNode(BOUND_VAR_LIST, vars);
  Node right = d_nodeManager->mkNode(EXISTS, bvl, qeq);

  // conjunction
  Node res = d_nodeManager->mkNode(AND, left, right);

  // symbols
  std::unordered_set<Node> syms;
  getSymbols(res, syms);

  // assertions
  ASSERT_EQ(syms.size(), 2);
  ASSERT_NE(syms.find(x), syms.end());
  ASSERT_NE(syms.find(y), syms.end());
  ASSERT_EQ(syms.find(var), syms.end());
}

TEST_F(TestNodeBlackNodeAlgorithm, get_operators_map)
{
  // map to store result
  std::map<TypeNode, std::unordered_set<Node> > result =
      std::map<TypeNode, std::unordered_set<Node> >();

  // create test formula
  Node x = d_skolemManager->mkDummySkolem("x", d_nodeManager->integerType());
  Node plus = d_nodeManager->mkNode(PLUS, x, x);
  Node mul = d_nodeManager->mkNode(MULT, x, x);
  Node eq1 = d_nodeManager->mkNode(EQUAL, plus, mul);

  Node y =
      d_skolemManager->mkDummySkolem("y", d_nodeManager->mkBitVectorType(4));
  Node ext1 = theory::bv::utils::mkExtract(y, 1, 0);
  Node ext2 = theory::bv::utils::mkExtract(y, 3, 2);
  Node eq2 = d_nodeManager->mkNode(EQUAL, ext1, ext2);

  Node formula = d_nodeManager->mkNode(AND, eq1, eq2);

  // call function
  expr::getOperatorsMap(formula, result);

  // Verify result
  // We should have only integer, bv and boolean as types
  ASSERT_EQ(result.size(), 3);
  ASSERT_NE(result.find(*d_intTypeNode), result.end());
  ASSERT_NE(result.find(*d_boolTypeNode), result.end());
  ASSERT_NE(result.find(*d_bvTypeNode), result.end());

  // in integers, we should only have plus and mult as operators
  ASSERT_EQ(result[*d_intTypeNode].size(), 2);
  ASSERT_NE(result[*d_intTypeNode].find(d_nodeManager->operatorOf(PLUS)),
            result[*d_intTypeNode].end());
  ASSERT_NE(result[*d_intTypeNode].find(d_nodeManager->operatorOf(MULT)),
            result[*d_intTypeNode].end());

  // in booleans, we should only have "=" and "and" as an operator.
  ASSERT_EQ(result[*d_boolTypeNode].size(), 2);
  ASSERT_NE(result[*d_boolTypeNode].find(d_nodeManager->operatorOf(EQUAL)),
            result[*d_boolTypeNode].end());
  ASSERT_NE(result[*d_boolTypeNode].find(d_nodeManager->operatorOf(AND)),
            result[*d_boolTypeNode].end());

  // in bv, we should only have "extract" as an operator.
  ASSERT_EQ(result[*d_boolTypeNode].size(), 2);
  Node extractOp1 =
      d_nodeManager->mkConst<BitVectorExtract>(BitVectorExtract(1, 0));
  Node extractOp2 =
      d_nodeManager->mkConst<BitVectorExtract>(BitVectorExtract(3, 2));
  ASSERT_NE(result[*d_bvTypeNode].find(extractOp1),
            result[*d_bvTypeNode].end());
  ASSERT_NE(result[*d_bvTypeNode].find(extractOp2),
            result[*d_bvTypeNode].end());
}

TEST_F(TestNodeBlackNodeAlgorithm, match)
{
  TypeNode integer = d_nodeManager->integerType();

  Node one = d_nodeManager->mkConst(Rational(1));
  Node two = d_nodeManager->mkConst(Rational(2));

  Node x = d_nodeManager->mkBoundVar(integer);
  Node a = d_skolemManager->mkDummySkolem("a", integer);

  Node n1 = d_nodeManager->mkNode(MULT, two, x);
  std::unordered_map<Node, Node> subs;

  // check reflexivity
  ASSERT_TRUE(match(n1, n1, subs));
  ASSERT_EQ(subs.size(), 0);

  Node n2 = d_nodeManager->mkNode(MULT, two, a);
  subs.clear();

  // check instance
  ASSERT_TRUE(match(n1, n2, subs));
  ASSERT_EQ(subs.size(), 1);
  ASSERT_EQ(subs[x], a);

  // should return false for flipped arguments (match is not symmetric)
  ASSERT_FALSE(match(n2, n1, subs));

  n2 = d_nodeManager->mkNode(MULT, one, a);

  // should return false since n2 is not an instance of n1
  ASSERT_FALSE(match(n1, n2, subs));

  n2 = d_nodeManager->mkNode(NONLINEAR_MULT, two, a);

  // should return false for similar operators
  ASSERT_FALSE(match(n1, n2, subs));

  n2 = d_nodeManager->mkNode(MULT, two, a, one);

  // should return false for different number of arguments
  ASSERT_FALSE(match(n1, n2, subs));

  n1 = x;
  n2 = d_nodeManager->mkConst(true);

  // should return false for different types
  ASSERT_FALSE(match(n1, n2, subs));

  n1 = d_nodeManager->mkNode(MULT, x, x);
  n2 = d_nodeManager->mkNode(MULT, two, a);

  // should return false for contradictory substitutions
  ASSERT_FALSE(match(n1, n2, subs));

  n2 = d_nodeManager->mkNode(MULT, a, a);
  subs.clear();

  // implementation: check if the cache works correctly
  ASSERT_TRUE(match(n1, n2, subs));
  ASSERT_EQ(subs.size(), 1);
  ASSERT_EQ(subs[x], a);
}
}  // namespace test
}  // namespace cvc5


Generated by: GCOVR (Version 3.2)

Line	Exec	Source
1		/******************************************************************************
2		* Top contributors (to current version):
3		* Aina Niemetz, Yoni Zohar, Abdalrhman Mohamed
4		*
5		* This file is part of the cvc5 project.
6		*
7		* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
8		* in the top-level source directory and their institutional affiliations.
9		* All rights reserved. See the file COPYING in the top-level source
10		* directory for licensing information.
11		* ****************************************************************************
12		*
13		* Black box testing of node_algorithm.{h,cpp}
14		*/
15
16		#include <string>
17		#include <vector>
18
19		#include "base/output.h"
20		#include "expr/node_algorithm.h"
21		#include "expr/node_manager.h"
22		#include "test_node.h"
23		#include "theory/bv/theory_bv_utils.h"
24		#include "util/integer.h"
25		#include "util/rational.h"
26
27		namespace cvc5 {
28
29		using namespace expr;
30		using namespace kind;
31
32		namespace test {
33
34	16	class TestNodeBlackNodeAlgorithm : public TestNode
35		{
36		};
37
38	13	TEST_F(TestNodeBlackNodeAlgorithm, get_symbols1)
39		{
40		// The only symbol in ~x (x is a boolean varible) should be x
41	4	Node x = d_skolemManager->mkDummySkolem("x", d_nodeManager->booleanType());
42	4	Node n = d_nodeManager->mkNode(NOT, x);
43	4	std::unordered_set<Node> syms;
44	2	getSymbols(n, syms);
45	2	ASSERT_EQ(syms.size(), 1);
46	2	ASSERT_NE(syms.find(x), syms.end());
47		}
48
49	13	TEST_F(TestNodeBlackNodeAlgorithm, get_symbols2)
50		{
51		// the only symbols in x=y ^ (exists var. var+var = x) are x and y, because
52		// "var" is bound.
53
54		// left conjunct
55	4	Node x = d_skolemManager->mkDummySkolem("x", d_nodeManager->integerType());
56	4	Node y = d_skolemManager->mkDummySkolem("y", d_nodeManager->integerType());
57	4	Node left = d_nodeManager->mkNode(EQUAL, x, y);
58
59		// right conjunct
60	4	Node var = d_nodeManager->mkBoundVar(*d_intTypeNode);
61	4	std::vector<Node> vars;
62	2	vars.push_back(var);
63	4	Node sum = d_nodeManager->mkNode(PLUS, var, var);
64	4	Node qeq = d_nodeManager->mkNode(EQUAL, x, sum);
65	4	Node bvl = d_nodeManager->mkNode(BOUND_VAR_LIST, vars);
66	4	Node right = d_nodeManager->mkNode(EXISTS, bvl, qeq);
67
68		// conjunction
69	4	Node res = d_nodeManager->mkNode(AND, left, right);
70
71		// symbols
72	4	std::unordered_set<Node> syms;
73	2	getSymbols(res, syms);
74
75		// assertions
76	2	ASSERT_EQ(syms.size(), 2);
77	2	ASSERT_NE(syms.find(x), syms.end());
78	2	ASSERT_NE(syms.find(y), syms.end());
79	2	ASSERT_EQ(syms.find(var), syms.end());
80		}
81
82	13	TEST_F(TestNodeBlackNodeAlgorithm, get_operators_map)
83		{
84		// map to store result
85		std::map<TypeNode, std::unordered_set<Node> > result =
86	4	std::map<TypeNode, std::unordered_set<Node> >();
87
88		// create test formula
89	4	Node x = d_skolemManager->mkDummySkolem("x", d_nodeManager->integerType());
90	4	Node plus = d_nodeManager->mkNode(PLUS, x, x);
91	4	Node mul = d_nodeManager->mkNode(MULT, x, x);
92	4	Node eq1 = d_nodeManager->mkNode(EQUAL, plus, mul);
93
94		Node y =
95	4	d_skolemManager->mkDummySkolem("y", d_nodeManager->mkBitVectorType(4));
96	4	Node ext1 = theory::bv::utils::mkExtract(y, 1, 0);
97	4	Node ext2 = theory::bv::utils::mkExtract(y, 3, 2);
98	4	Node eq2 = d_nodeManager->mkNode(EQUAL, ext1, ext2);
99
100	4	Node formula = d_nodeManager->mkNode(AND, eq1, eq2);
101
102		// call function
103	2	expr::getOperatorsMap(formula, result);
104
105		// Verify result
106		// We should have only integer, bv and boolean as types
107	2	ASSERT_EQ(result.size(), 3);
108	2	ASSERT_NE(result.find(*d_intTypeNode), result.end());
109	2	ASSERT_NE(result.find(*d_boolTypeNode), result.end());
110	2	ASSERT_NE(result.find(*d_bvTypeNode), result.end());
111
112		// in integers, we should only have plus and mult as operators
113	2	ASSERT_EQ(result[*d_intTypeNode].size(), 2);
114	2	ASSERT_NE(result[*d_intTypeNode].find(d_nodeManager->operatorOf(PLUS)),
115	2	result[*d_intTypeNode].end());
116	2	ASSERT_NE(result[*d_intTypeNode].find(d_nodeManager->operatorOf(MULT)),
117	2	result[*d_intTypeNode].end());
118
119		// in booleans, we should only have "=" and "and" as an operator.
120	2	ASSERT_EQ(result[*d_boolTypeNode].size(), 2);
121	2	ASSERT_NE(result[*d_boolTypeNode].find(d_nodeManager->operatorOf(EQUAL)),
122	2	result[*d_boolTypeNode].end());
123	2	ASSERT_NE(result[*d_boolTypeNode].find(d_nodeManager->operatorOf(AND)),
124	2	result[*d_boolTypeNode].end());
125
126		// in bv, we should only have "extract" as an operator.
127	2	ASSERT_EQ(result[*d_boolTypeNode].size(), 2);
128		Node extractOp1 =
129	4	d_nodeManager->mkConst<BitVectorExtract>(BitVectorExtract(1, 0));
130		Node extractOp2 =
131	4	d_nodeManager->mkConst<BitVectorExtract>(BitVectorExtract(3, 2));
132	2	ASSERT_NE(result[*d_bvTypeNode].find(extractOp1),
133	2	result[*d_bvTypeNode].end());
134	2	ASSERT_NE(result[*d_bvTypeNode].find(extractOp2),
135	2	result[*d_bvTypeNode].end());
136		}
137
138	13	TEST_F(TestNodeBlackNodeAlgorithm, match)
139		{
140	4	TypeNode integer = d_nodeManager->integerType();
141
142	4	Node one = d_nodeManager->mkConst(Rational(1));
143	4	Node two = d_nodeManager->mkConst(Rational(2));
144
145	4	Node x = d_nodeManager->mkBoundVar(integer);
146	4	Node a = d_skolemManager->mkDummySkolem("a", integer);
147
148	4	Node n1 = d_nodeManager->mkNode(MULT, two, x);
149	4	std::unordered_map<Node, Node> subs;
150
151		// check reflexivity
152	2	ASSERT_TRUE(match(n1, n1, subs));
153	2	ASSERT_EQ(subs.size(), 0);
154
155	4	Node n2 = d_nodeManager->mkNode(MULT, two, a);
156	2	subs.clear();
157
158		// check instance
159	2	ASSERT_TRUE(match(n1, n2, subs));
160	2	ASSERT_EQ(subs.size(), 1);
161	2	ASSERT_EQ(subs[x], a);
162
163		// should return false for flipped arguments (match is not symmetric)
164	2	ASSERT_FALSE(match(n2, n1, subs));
165
166	2	n2 = d_nodeManager->mkNode(MULT, one, a);
167
168		// should return false since n2 is not an instance of n1
169	2	ASSERT_FALSE(match(n1, n2, subs));
170
171	2	n2 = d_nodeManager->mkNode(NONLINEAR_MULT, two, a);
172
173		// should return false for similar operators
174	2	ASSERT_FALSE(match(n1, n2, subs));
175
176	2	n2 = d_nodeManager->mkNode(MULT, two, a, one);
177
178		// should return false for different number of arguments
179	2	ASSERT_FALSE(match(n1, n2, subs));
180
181	2	n1 = x;
182	2	n2 = d_nodeManager->mkConst(true);
183
184		// should return false for different types
185	2	ASSERT_FALSE(match(n1, n2, subs));
186
187	2	n1 = d_nodeManager->mkNode(MULT, x, x);
188	2	n2 = d_nodeManager->mkNode(MULT, two, a);
189
190		// should return false for contradictory substitutions
191	2	ASSERT_FALSE(match(n1, n2, subs));
192
193	2	n2 = d_nodeManager->mkNode(MULT, a, a);
194	2	subs.clear();
195
196		// implementation: check if the cache works correctly
197	2	ASSERT_TRUE(match(n1, n2, subs));
198	2	ASSERT_EQ(subs.size(), 1);
199	2	ASSERT_EQ(subs[x], a);
200		}
201		} // namespace test
202	37559	} // namespace cvc5