crypto/ec/ecp_smpl.c:1308: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_mod_inverse`.
Showing all 20 steps of the trace


crypto/ec/ecp_smpl.c:1259:11: Call
1257.   
1258.       BN_CTX_start(ctx);
1259.       tmp = BN_CTX_get(ctx);
                  ^
1260.       tmp_Z = BN_CTX_get(ctx);
1261.       if (tmp == NULL || tmp_Z == NULL)

crypto/bn/bn_ctx.c:284:5: Call
  282.       }
  283.       /* OK, make sure the returned bignum is "zero" */
  284.       BN_zero(ret);
             ^
  285.       ctx->used++;
  286.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
    528.   }
    529.   
    530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    531.   {
    532.       bn_check_top(a);

crypto/ec/ecp_smpl.c:1308:10: Call
1306.        */
1307.   
1308.       if (!BN_mod_inverse(tmp, prod_Z[num - 1], group->field, ctx)) {
                 ^
1309.           ECerr(EC_F_EC_GFP_SIMPLE_POINTS_MAKE_AFFINE, ERR_R_BN_LIB);
1310.           goto err;

crypto/bn/bn_gcd.c:226:1: Parameter `*in->d`
  224.                                           BN_CTX *ctx);
  225.   
  226. > BIGNUM *BN_mod_inverse(BIGNUM *in,
  227.                          const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
  228.   {

crypto/bn/bn_gcd.c:231:10: Call
  229.       BIGNUM *rv;
  230.       int noinv;
  231.       rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
                  ^
  232.       if (noinv)
  233.           BNerr(BN_F_BN_MOD_INVERSE, BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:237:1: Parameter `*in->d`
    235.   }
    236.   
    237. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
    238.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
    239.                              int *pnoinv)

crypto/bn/bn_gcd.c:250:16: Call
    248.       if ((BN_get_flags(a, BN_FLG_CONSTTIME) != 0)
    249.           || (BN_get_flags(n, BN_FLG_CONSTTIME) != 0)) {
    250.           return BN_mod_inverse_no_branch(in, a, n, ctx);
                          ^
    251.       }
    252.   

crypto/bn/bn_gcd.c:557:1: Parameter `*in->d`
      555.    * not contain branches that may leak sensitive information.
      556.    */
      557. > static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
      558.                                           const BIGNUM *a, const BIGNUM *n,
      559.                                           BN_CTX *ctx)

crypto/bn/bn_gcd.c:705:18: Call
      703.           /* Y*a == 1  (mod |n|) */
      704.           if (!Y->neg && BN_ucmp(Y, n) < 0) {
      705.               if (!BN_copy(R, Y))
                              ^
      706.                   goto err;
      707.           } else {

crypto/bn/bn_lib.c:429:1: Parameter `*a->d`
        427.   }
        428.   
        429. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
        430.   {
        431.       int i;

crypto/bn/bn_lib.c:439:9: Call
        437.       if (a == b)
        438.           return (a);
        439.       if (bn_wexpand(a, b->top) == NULL)
                       ^
        440.           return (NULL);
        441.   

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
          993.   }
          994.   
          995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          996.   {
          997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:997:37: Call
          995.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
          996.   {
          997.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                      ^
          998.   }
          999.   

crypto/bn/bn_lib.c:390:1: Parameter `*b->d`
            388.    */
            389.   
            390. > BIGNUM *bn_expand2(BIGNUM *b, int words)
            391.   {
            392.       bn_check_top(b);

crypto/bn/bn_lib.c:395:23: Call
            393.   
            394.       if (words > b->dmax) {
            395.           BN_ULONG *a = bn_expand_internal(b, words);
                                         ^
            396.           if (!a)
            397.               return NULL;

crypto/bn/bn_lib.c:300:1: <Length trace>
298.   /* This is used by bn_expand2() */
299.   /* The caller MUST check that words > b->dmax before calling this */
300. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
301.   {
302.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:300:1: Parameter `*b->d`
              298.   /* This is used by bn_expand2() */
              299.   /* The caller MUST check that words > b->dmax before calling this */
              300. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
              301.   {
              302.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:335:5: Assignment
              333.   
              334.   #if 1
              335.       B = b->d;
                         ^
              336.       /* Check if the previous number needs to be copied */
              337.       if (B != NULL) {

crypto/bn/bn_lib.c:352:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_mod_inverse` 
              350.               a1 = B[1];
              351.               a2 = B[2];
              352.               a3 = B[3];
                                      ^
              353.               A[0] = a0;
              354.               A[1] = a1;
