mk_bvsrem method

Z3_ast mk_bvsrem(Z3_context c, Z3_ast t1, Z3_ast t2)

\brief Two's complement signed remainder (sign follows dividend).

It is defined as \ccode{t1 - (t1 /s t2) * t2}, where \ccode{/s} represents signed division. The most significant bit (sign) of the result is equal to the most significant bit of \c t1.

If \ccode{t2} is zero, then the result is undefined.

The nodes \c t1 and \c t2 must have the same bit-vector sort.

\sa Z3_mk_bvsmod

def_API('Z3_mk_bvsrem', AST, (_in(CONTEXT), _in(AST), _in(AST)))

Implementation

Z3_ast mk_bvsrem(
  Z3_context c,
  Z3_ast t1,
  Z3_ast t2,
) {
  return _mk_bvsrem(
    c,
    t1,
    t2,
  );
}