crypto/bn/bn_sqrt.c:98: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_mod_exp`.
Showing all 27 steps of the trace


crypto/bn/bn_sqrt.c:13:1: Parameter `p->top`
11.   #include "bn_lcl.h"
12.   
13. > BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
14.   /*
15.    * Returns 'ret' such that ret^2 == a (mod p), using the Tonelli/Shanks

crypto/bn/bn_sqrt.c:26:10: Call
24.       int e, i, j;
25.   
26.       if (!BN_is_odd(p) || BN_abs_is_word(p, 1)) {
               ^
27.           if (BN_abs_is_word(p, 2)) {
28.               if (ret == NULL)

crypto/bn/bn_lib.c:870:1: Parameter `a->top`
  868.   }
  869.   
  870. > int BN_is_odd(const BIGNUM *a)
  871.   {
  872.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_sqrt.c:26:26: Call
24.       int e, i, j;
25.   
26.       if (!BN_is_odd(p) || BN_abs_is_word(p, 1)) {
                               ^
27.           if (BN_abs_is_word(p, 2)) {
28.               if (ret == NULL)

crypto/bn/bn_lib.c:850:1: Parameter `a->top`
  848.   }
  849.   
  850. > int BN_abs_is_word(const BIGNUM *a, const BN_ULONG w)
  851.   {
  852.       return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));

crypto/bn/bn_sqrt.c:75:10: Call
73.   
74.       /* A = a mod p */
75.       if (!BN_nnmod(A, a, p, ctx))
               ^
76.           goto end;
77.   

crypto/bn/bn_mod.c:13:1: Parameter `d->top`
  11.   #include "bn_lcl.h"
  12.   
  13. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
  14.   {
  15.       /*

crypto/bn/bn_mod.c:20:11: Call
  18.        */
  19.   
  20.       if (!(BN_mod(r, m, d, ctx)))
                  ^
  21.           return 0;
  22.       if (!r->neg)

crypto/bn/bn_div.c:140:1: Parameter `divisor->top`
    138.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
    139.    */
    140. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
    141.              BN_CTX *ctx)
    142.   {

crypto/bn/bn_sqrt.c:80:13: Call
78.       /* now write  |p| - 1  as  2^e*q  where  q  is odd */
79.       e = 1;
80.       while (!BN_is_bit_set(p, e))
                  ^
81.           e++;
82.       /* we'll set  q  later (if needed) */

crypto/bn/bn_lib.c:667:1: Parameter `a->top`
  665.   }
  666.   
  667. > int BN_is_bit_set(const BIGNUM *a, int n)
  668.   {
  669.       int i, j;

crypto/bn/bn_sqrt.c:93:14: Call
91.            * so we can use exponent  (|p|+1)/4,  i.e.  (|p|-3)/4 + 1.
92.            */
93.           if (!BN_rshift(q, p, 2))
                   ^
94.               goto end;
95.           q->neg = 0;

crypto/bn/bn_shift.c:122:1: Parameter `a->top`
  120.   }
  121.   
  122. > int BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
  123.   {
  124.       int i, j, nw, lb, rb;

crypto/bn/bn_sqrt.c:98:14: Call
96.           if (!BN_add_word(q, 1))
97.               goto end;
98.           if (!BN_mod_exp(ret, A, q, p, ctx))
                    ^
99.               goto end;
100.           err = 0;

crypto/bn/bn_exp.c:88:1: Parameter `m->top`
  86.   }
  87.   
  88. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
  89.                  BN_CTX *ctx)
  90.   {

crypto/bn/bn_exp.c:133:9: Call
  131.   
  132.   #ifdef MONT_MUL_MOD
  133.       if (BN_is_odd(m)) {
                 ^
  134.   # ifdef MONT_EXP_WORD
  135.           if (a->top == 1 && !a->neg

crypto/bn/bn_lib.c:870:1: Parameter `a->top`
    868.   }
    869.   
    870. > int BN_is_odd(const BIGNUM *a)
    871.   {
    872.       return (a->top > 0) && (a->d[0] & 1);

crypto/bn/bn_exp.c:146:15: Call
  144.   #ifdef RECP_MUL_MOD
  145.       {
  146.           ret = BN_mod_exp_recp(r, a, p, m, ctx);
                       ^
  147.       }
  148.   #else

crypto/bn/bn_exp.c:158:1: Parameter `m->top`
    156.   }
    157.   
    158. > int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
    159.                       const BIGNUM *m, BN_CTX *ctx)
    160.   {

crypto/bn/bn_exp.c:195:14: Call
    193.       if (m->neg) {
    194.           /* ignore sign of 'm' */
    195.           if (!BN_copy(aa, m))
                        ^
    196.               goto err;
    197.           aa->neg = 0;

crypto/bn/bn_lib.c:323:1: <Offset trace>
321.   }
322.   
323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
324.   {
325.       bn_check_top(b);

crypto/bn/bn_lib.c:323:1: Parameter `b->top`
      321.   }
      322.   
      323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
      324.   {
      325.       bn_check_top(b);

crypto/bn/bn_lib.c:323:1: <Length trace>
321.   }
322.   
323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
324.   {
325.       bn_check_top(b);

crypto/bn/bn_lib.c:323:1: Parameter `*a->d`
      321.   }
      322.   
      323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
      324.   {
      325.       bn_check_top(b);

crypto/bn/bn_lib.c:329:9: Call
      327.       if (a == b)
      328.           return a;
      329.       if (bn_wexpand(a, b->top) == NULL)
                     ^
      330.           return NULL;
      331.   

crypto/bn/bn_lib.c:951:1: Parameter `*a->d`
        949.   }
        950.   
        951. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
        952.   {
        953.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:333:9: Array access: Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_mod_exp` 
      331.   
      332.       if (b->top > 0)
      333.           memcpy(a->d, b->d, sizeof(b->d[0]) * b->top);
                     ^
      334.   
      335.       if (BN_get_flags(b, BN_FLG_CONSTTIME) != 0)
