Remove definition of unsigned_less_than from X-Macro definition.

And substitute it for a concrete class in `smt_bit_vector_theory.cpp`.

Author: NlightNFotis

src/solvers/smt2_incremental/smt_bit_vector_theory.cpp

@@ -42,3 +42,26 @@ static void validate_bit_vector_predicate_arguments(
     smt_bit_vector_theoryt::the_name{};
 #include "smt_bit_vector_theory.def"
 #undef SMT_BITVECTOR_THEORY_PREDICATE
+
+const char *smt_bit_vector_theoryt::unsigned_less_thant::identifier()
+{
+  return "bvult";
+}
+
+smt_sortt smt_bit_vector_theoryt::unsigned_less_thant::return_sort(
+  const smt_termt &lhs,
+  const smt_termt &rhs)
+{
+  return smt_bool_sortt{};
+}
+
+void smt_bit_vector_theoryt::unsigned_less_thant::validate(
+  const smt_termt &lhs,
+  const smt_termt &rhs)
+{
+  validate_bit_vector_predicate_arguments(lhs, rhs);
+}
+
+const smt_function_application_termt::factoryt<
+  smt_bit_vector_theoryt::unsigned_less_thant>
+  smt_bit_vector_theoryt::unsigned_less_than{};

src/solvers/smt2_incremental/smt_bit_vector_theory.def

@@ -3,7 +3,6 @@
 /// [X-macro](https://en.wikipedia.org/wiki/X_Macro) pattern. These define the
 /// set of bitvector theory functions which are implemented and it is used to
 /// automate repetitive parts of the implementation.
-SMT_BITVECTOR_THEORY_PREDICATE(bvult, unsigned_less_than)
 SMT_BITVECTOR_THEORY_PREDICATE(bvule, unsigned_less_than_or_equal)
 SMT_BITVECTOR_THEORY_PREDICATE(bvugt, unsigned_greater_than)
 SMT_BITVECTOR_THEORY_PREDICATE(bvuge, unsigned_greater_than_or_equal)

src/solvers/smt2_incremental/smt_bit_vector_theory.h

@@ -20,6 +20,15 @@ class smt_bit_vector_theoryt
   static const smt_function_application_termt::factoryt<the_name##t> the_name;
 #include "smt_bit_vector_theory.def"
 #undef SMT_BITVECTOR_THEORY_PREDICATE
+
+  struct unsigned_less_thant final
+  {
+    static const char *identifier();
+    static smt_sortt return_sort(const smt_termt &lhs, const smt_termt &rhs);
+    static void validate(const smt_termt &lhs, const smt_termt &rhs);
+  };
+  static const smt_function_application_termt::factoryt<unsigned_less_thant>
+    unsigned_less_than;
 };
 
 #endif // CPROVER_SOLVERS_SMT2_INCREMENTAL_SMT_BIT_VECTOR_THEORY_H