Head

GCC Code Coverage Report

Directory:	.		Exec	Total	Coverage
File:	src/preprocessing/passes/theory_rewrite_eq.cpp	Lines:	53	53	100.0 %
Date:	2021-09-04	Branches:	109	234	46.6 %


/******************************************************************************
 * Top contributors (to current version):
 *   Andrew Reynolds, Aina Niemetz
 *
 * 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.
 * ****************************************************************************
 *
 * The TheoryRewriteEq preprocessing pass.
 */

#include "preprocessing/passes/theory_rewrite_eq.h"

#include "preprocessing/assertion_pipeline.h"
#include "preprocessing/preprocessing_pass_context.h"
#include "theory/theory_engine.h"

using namespace cvc5::theory;

namespace cvc5 {
namespace preprocessing {
namespace passes {

TheoryRewriteEq::TheoryRewriteEq(PreprocessingPassContext* preprocContext)
    : PreprocessingPass(preprocContext, "theory-rewrite-eq"){};

PreprocessingPassResult TheoryRewriteEq::applyInternal(
    AssertionPipeline* assertions)
{
  // apply ppRewrite to all equalities in assertions
  for (std::size_t i = 0, size = assertions->size(); i < size; ++i)
  {
    Node assertion = (*assertions)[i];
    TrustNode trn = rewriteAssertion(assertion);
    if (!trn.isNull())
    {
      // replace based on the trust node
      assertions->replaceTrusted(i, trn);
    }
  }
  return PreprocessingPassResult::NO_CONFLICT;
}

TrustNode TheoryRewriteEq::rewriteAssertion(TNode n)
{
  NodeManager* nm = NodeManager::currentNM();
  TheoryEngine* te = d_preprocContext->getTheoryEngine();
  std::unordered_map<TNode, Node> visited;
  std::unordered_map<TNode, Node>::iterator it;
  std::vector<TNode> visit;
  TNode cur;
  visit.push_back(n);
  do
  {
    cur = visit.back();
    visit.pop_back();
    it = visited.find(cur);

    if (it == visited.end())
    {
      if (cur.getNumChildren()==0)
      {
        visited[cur] = cur;
      }
      else
      {
        visited[cur] = Node::null();
        visit.push_back(cur);
        visit.insert(visit.end(), cur.begin(), cur.end());
      }
    }
    else if (it->second.isNull())
    {
      Node ret = cur;
      bool childChanged = false;
      std::vector<Node> children;
      if (cur.getMetaKind() == kind::metakind::PARAMETERIZED)
      {
        children.push_back(cur.getOperator());
      }
      for (const Node& cn : cur)
      {
        it = visited.find(cn);
        Assert(it != visited.end());
        Assert(!it->second.isNull());
        childChanged = childChanged || cn != it->second;
        children.push_back(it->second);
      }
      if (childChanged)
      {
        ret = nm->mkNode(cur.getKind(), children);
      }
      if (ret.getKind() == kind::EQUAL && !ret[0].getType().isBoolean())
      {
        // For example, (= x y) ---> (and (>= x y) (<= x y))
        TrustNode trn = te->ppRewriteEquality(ret);
        // can make proof producing by using proof generator from trn
        ret = trn.isNull() ? Node(ret) : trn.getNode();
      }
      visited[cur] = ret;
    }
  } while (!visit.empty());
  Assert(visited.find(n) != visited.end());
  Assert(!visited.find(n)->second.isNull());
  Node ret = visited[n];
  if (ret == n)
  {
    return TrustNode::null();
  }
  // can make proof producing by providing a term conversion generator here
  return TrustNode::mkTrustRewrite(n, ret, nullptr);
}

}  // namespace passes
}  // namespace preprocessing
}  // namespace cvc5


Generated by: GCOVR (Version 3.2)

Line	Exec	Source
1		/******************************************************************************
2		* Top contributors (to current version):
3		* Andrew Reynolds, Aina Niemetz
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		* The TheoryRewriteEq preprocessing pass.
14		*/
15
16		#include "preprocessing/passes/theory_rewrite_eq.h"
17
18		#include "preprocessing/assertion_pipeline.h"
19		#include "preprocessing/preprocessing_pass_context.h"
20		#include "theory/theory_engine.h"
21
22		using namespace cvc5::theory;
23
24		namespace cvc5 {
25		namespace preprocessing {
26		namespace passes {
27
28	9927	TheoryRewriteEq::TheoryRewriteEq(PreprocessingPassContext* preprocContext)
29	9927	: PreprocessingPass(preprocContext, "theory-rewrite-eq"){};
30
31	13792	PreprocessingPassResult TheoryRewriteEq::applyInternal(
32		AssertionPipeline* assertions)
33		{
34		// apply ppRewrite to all equalities in assertions
35	119575	for (std::size_t i = 0, size = assertions->size(); i < size; ++i)
36		{
37	211566	Node assertion = (*assertions)[i];
38	211566	TrustNode trn = rewriteAssertion(assertion);
39	105783	if (!trn.isNull())
40		{
41		// replace based on the trust node
42	1734	assertions->replaceTrusted(i, trn);
43		}
44		}
45	13792	return PreprocessingPassResult::NO_CONFLICT;
46		}
47
48	105783	TrustNode TheoryRewriteEq::rewriteAssertion(TNode n)
49		{
50	105783	NodeManager* nm = NodeManager::currentNM();
51	105783	TheoryEngine* te = d_preprocContext->getTheoryEngine();
52	211566	std::unordered_map<TNode, Node> visited;
53	105783	std::unordered_map<TNode, Node>::iterator it;
54	211566	std::vector<TNode> visit;
55	211566	TNode cur;
56	105783	visit.push_back(n);
57	5393967	do
58		{
59	5499750	cur = visit.back();
60	5499750	visit.pop_back();
61	5499750	it = visited.find(cur);
62
63	5499750	if (it == visited.end())
64		{
65	1995958	if (cur.getNumChildren()==0)
66		{
67	449950	visited[cur] = cur;
68		}
69		else
70		{
71	1546008	visited[cur] = Node::null();
72	1546008	visit.push_back(cur);
73	1546008	visit.insert(visit.end(), cur.begin(), cur.end());
74		}
75		}
76	3503792	else if (it->second.isNull())
77		{
78	3092016	Node ret = cur;
79	1546008	bool childChanged = false;
80	3092016	std::vector<Node> children;
81	1546008	if (cur.getMetaKind() == kind::metakind::PARAMETERIZED)
82		{
83	192933	children.push_back(cur.getOperator());
84		}
85	5393967	for (const Node& cn : cur)
86		{
87	3847959	it = visited.find(cn);
88	3847959	Assert(it != visited.end());
89	3847959	Assert(!it->second.isNull());
90	3847959	childChanged = childChanged \|\| cn != it->second;
91	3847959	children.push_back(it->second);
92		}
93	1546008	if (childChanged)
94		{
95	21431	ret = nm->mkNode(cur.getKind(), children);
96		}
97	1546008	if (ret.getKind() == kind::EQUAL && !ret[0].getType().isBoolean())
98		{
99		// For example, (= x y) ---> (and (>= x y) (<= x y))
100	398002	TrustNode trn = te->ppRewriteEquality(ret);
101		// can make proof producing by using proof generator from trn
102	199001	ret = trn.isNull() ? Node(ret) : trn.getNode();
103		}
104	1546008	visited[cur] = ret;
105		}
106	5499750	} while (!visit.empty());
107	105783	Assert(visited.find(n) != visited.end());
108	105783	Assert(!visited.find(n)->second.isNull());
109	211566	Node ret = visited[n];
110	105783	if (ret == n)
111		{
112	104049	return TrustNode::null();
113		}
114		// can make proof producing by providing a term conversion generator here
115	1734	return TrustNode::mkTrustRewrite(n, ret, nullptr);
116		}
117
118		} // namespace passes
119		} // namespace preprocessing
120	29505	} // namespace cvc5