// verifast_options{disable_overflow_check target:ILP32}
extern void abort(void);
//@ requires true;
//@ ensures true;
void reach_error()
//@ requires false;
//@ ensures true;
{}extern short __VERIFIER_nondet_short(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(ps6_ll_valuebound100__verifast_instrumented, true);
//@ ensures junk();
{
    //@ open_module(); 
    short k;
    long long y, x, c;
    k = __VERIFIER_nondet_short();
    assume_abort_if_not(k>=0 && k<=100);
    assume_abort_if_not(k <= 256);

    y = 0;
    x = 0;
    c = 0;

while (1)
//@ invariant ((((((k <= 100) && (0 <= k)) && (((c * 9) + (c * y)) == ((y * 9) + (y * y)))) && ((c + (c * y)) == (y + (y * y)))) && ((((2 * (((((y * y) * y) * y) * y) * y)) + (6 * ((((y * y) * y) * y) * y))) + (5 * (((y * y) * y) * y))) == ((x * 12) + (y * y)))) && ((c < k) || ((y * y) == (k * y))));
    {
        __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0);

        if (!(c < k))
            break;

        c = c + 1;
        y = y + 1;
        x = y * y * y * y * y + x;
    }
    
    __VERIFIER_assert(-2*y*y*y*y*y*y - 6 * y*y*y*y*y - 5 * y*y*y*y + y*y + 12*x == 0);
    __VERIFIER_assert(k*y == y*y);		      
    return 0;
}