[SCIP] SCIP with signed and unsigned interger

[Alessandro Danese]

Good morning, 
I’m using SCIP to count the number of feasible solutions of a set of constraints.
My constraints involve bitvector variables. 

Example:
C1: x_1 + 256x_2 + 65536x_3 + 16777216x_4 -a = 0
C2: 300 + a < 44

Bounds
0 <=  x_1 <= 255
0 <=  x_2  <= 255
0 <=  x_3 <= 255
0 <=  x_4 <= 255
0 <=    a   <= 2^32

The above introduced problem does not have any feasible solution. 
However, when the variable ‘a' is greater / equals to 2^31, then it has negative value because of overflow. 

Can SCIP consider also overflow scenarios to compute a feasible solution?

Thank you for your help
Kind regards,

Alessandro Danese