crypto/srp/srp_lib.c:73: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_mod_exp`.
Showing all 18 steps of the trace


crypto/srp/srp_lib.c:69:10: Call
67.       if (!BN_mod_exp(tmp, v, u, N, bn_ctx))
68.           goto err;
69.       if (!BN_mod_mul(tmp, A, tmp, N, bn_ctx))
               ^
70.           goto err;
71.   

crypto/bn/bn_mod.c:73:1: Parameter `r->top`
  71.   
  72.   /* slow but works */
  73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  74.                  BN_CTX *ctx)
  75.   {

crypto/srp/srp_lib.c:73:23: Call
71.   
72.       S = BN_new();
73.       if (S != NULL && !BN_mod_exp(S, tmp, b, N, bn_ctx)) {
                            ^
74.           BN_free(S);
75.           S = NULL;

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

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

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

crypto/bn/bn_exp.c:208:10: Call
    206.       }
    207.   
    208.       if (!BN_nnmod(val[0], a, m, ctx))
                    ^
    209.           goto err;               /* 1 */
    210.       if (BN_is_zero(val[0])) {

crypto/bn/bn_mod.c:13:1: Parameter `*r->d`
      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 `*rm->d`
        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_div.c:185:17: Call
        183.       if (!no_branch && BN_ucmp(num, divisor) < 0) {
        184.           if (rm != NULL) {
        185.               if (BN_copy(rm, num) == NULL)
                               ^
        186.                   return (0);
        187.           }

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:948:1: Parameter `*a->d`
            946.   }
            947.   
            948. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
            949.   {
            950.       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.       a->top = b->top;
