When we do not use a bitprecise predicate analysis,
and there is a modulo operator in the source,
we can add an SMT term stating that the operation actually behaves like
a modulo operation.
However, this is only supported for MathSAT with
cpa.predicate.encodeBitvectorAs=Integers
and constant literals as second parameter for modulo.

git-svn-id: https://svn.sosy-lab.org/software/cpachecker/trunk@14161 4712c6d2-40bb-43ae-aa4b-fec3f1bdfe4c