crypto/x509v3/v3_asid.c:346: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_add_word`.
Showing all 14 steps of the trace


crypto/x509v3/v3_asid.c:345:13: Call
343.            */
344.           if ((bn == NULL && (bn = BN_new()) == NULL) ||
345.               ASN1_INTEGER_to_BN(a_max, bn) == NULL ||
                   ^
346.               !BN_add_word(bn, 1) ||
347.               (a_max_plus_one =

crypto/asn1/a_int.c:629:12: Call
  627.   BIGNUM *ASN1_INTEGER_to_BN(const ASN1_INTEGER *ai, BIGNUM *bn)
  628.   {
  629.       return asn1_string_to_bn(ai, bn, V_ASN1_INTEGER);
                    ^
  630.   }
  631.   

crypto/asn1/a_int.c:563:1: Parameter `bn->d`
    561.   }
    562.   
    563. > static BIGNUM *asn1_string_to_bn(const ASN1_INTEGER *ai, BIGNUM *bn,
    564.                                    int itype)
    565.   {

crypto/x509v3/v3_asid.c:346:14: Call
344.           if ((bn == NULL && (bn = BN_new()) == NULL) ||
345.               ASN1_INTEGER_to_BN(a_max, bn) == NULL ||
346.               !BN_add_word(bn, 1) ||
                    ^
347.               (a_max_plus_one =
348.                BN_to_ASN1_INTEGER(bn, a_max_plus_one)) == NULL) {

crypto/bn/bn_word.c:123:1: Parameter `*a->d`
  121.   }
  122.   
  123. > int BN_add_word(BIGNUM *a, BN_ULONG w)
  124.   {
  125.       BN_ULONG l;

crypto/bn/bn_word.c:136:16: Call
  134.       /* degenerate case: a is zero */
  135.       if (BN_is_zero(a))
  136.           return BN_set_word(a, w);
                        ^
  137.       /* handle 'a' when negative */
  138.       if (a->neg) {

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/bn/bn_lib.c:533:9: Call
    531.   {
    532.       bn_check_top(a);
    533.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    534.           return (0);
    535.       a->neg = 0;

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_add_word` 
        350.               a1 = B[1];
        351.               a2 = B[2];
        352.               a3 = B[3];
                                ^
        353.               A[0] = a0;
        354.               A[1] = a1;
