What is the difference between between rem and mod in LIA?

[jparsert]

Are rem and mod the same in the LIA logic? According to this I only found the functions bvsrem, and bvurem. It seems to make a difference only in signed bitvectors where the sign follows the divisor and dividend. So, is it save to assume that other than that mod and rem are always the same?