// verifast_options{disable_overflow_check target:ILP32}
extern void abort(void);
//@ requires true;
//@ ensures true;


void reach_error()
//@ requires false;
//@ ensures true;
{}extern unsigned __VERIFIER_nondet_uint(void);
//@ requires true;
//@ ensures true;
void assume_abort_if_not(int cond) 
//@ requires true;
//@ ensures (cond != 0);
{  if(!cond) {abort();}
}
void __VERIFIER_assert(int cond) 
//@ requires (1 <= cond);
//@ ensures (1 <= cond);
{    if (!(cond)) {
    ERROR:
        {reach_error();}
    }
    return;
}
int main() 
//@ requires module(divbin_valuebound1__verifast_instrumented, true);
//@ ensures junk();
{
    //@ open_module(); 
  unsigned A, B;
  unsigned q, r, b;
    A = __VERIFIER_nondet_uint();
    assume_abort_if_not(A>=0 && A<=1);
    B = __VERIFIER_nondet_uint();
    assume_abort_if_not(B>=0 && B<=1);
    assume_abort_if_not(B < (0x7fffffff * 2U + 1U)/2);
    assume_abort_if_not(B >= 1);
    q = 0;
    r = A;
    b = B;
while (1)
//@ invariant (((((((B == 1) && (r == A)) && (0 <= (2 * (((b / 2) + ( - 1 * B)) / 4294967296)))) && (A <= 1)) && (b <= (B * 2))) && (q == 0)) || ((((((b == 1) && (r == A)) && (0 <= 0)) && (A <= 1)) && (B == b)) && (q == 0)));
    {
        if (!(r >= b)) break;
        b = 2 * b;
    }
while (1)
//@ invariant ((((((((B == 1) && (b == 1)) && (r <= 0)) && (r == A)) && (q == 0)) || ((((0 <= 0) && (0 <= 0)) && (A == ((r + ( b * q)) % 4294967296))) && (B == b))) || ((((((B == 1) && (r == A)) && (0 <= (2 * (((b / 2) + ( - 1 * B)) / 4294967296)))) && (A <= 1)) && (b <= (B * 2))) && (q == 0))) || (((((B == 1) && (b == 1)) && (r <= 0)) && (A == (( r + 1) % 4294967296))) && (q == 1)));
    {
        __VERIFIER_assert(A == q * b + r);
        if (!(b != B)) break;
        q = 2 * q;
        b = b / 2;
        if (r >= b) {
            q = q + 1;
            r = r - b;
        }
    }
    __VERIFIER_assert(A == q * b + r);
    return 0;
}