 
                            The C Standard, 6.2.5, paragraph 9 11 [ISO/IEC 9899:20112024], states
A computation involving unsigned operands can never produce an overflow, because a result that cannot be represented by the resulting unsigned integer type is reduced modulo the number that is one greater than the largest value that can be represented by the resulting typearithmetic for the unsigned type is performed modulo 2^N .
This behavior is more informally called unsigned integer wrapping. Unsigned integer operations can wrap if the resulting value cannot be represented by the underlying representation of the integer. The following table indicates which operators can result in wrapping:
...
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| void func(unsigned int ui_a, unsigned int ui_b) {
  unsigned int usum = ui_a + ui_b;
  if (usum < ui_a) {
    /* Handle error */
  }
  /* ... */
} | 
...
Compliant Solution (C23, Checked Integers)
This compliant solution uses the new-to-C23 checked integer arithmetic to safely perform integer addition:
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| #include <stdckdint.h>
void func(unsigned int ui_a, unsigned int ui_b) {
  unsigned int usum;
  if (ckd_add(&usum, ui_a, ui_b) | 
...
Subtraction
Subtraction is between two operands of arithmetic type, two pointers to qualified or unqualified versions of compatible object types, or a pointer to an object type and an integer type. This rule applies only to subtraction between two operands of arithmetic type. (See ARR36-C. Do not subtract or compare two pointers that do not refer to the same array, ARR37-C. Do not add or subtract an integer to a pointer to a non-array object, and ARR30-C. Do not form or use out-of-bounds pointers or array subscripts for information about pointer subtraction.)
Decrementing is equivalent to subtracting 1.
Noncompliant Code Example
This noncompliant code example can result in an unsigned integer wrap during the subtraction of the unsigned operands ui_a and ui_b. If this behavior is unanticipated, it may lead to an exploitable vulnerability.
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| void func(unsigned int ui_a, unsigned int ui_b) { unsigned int udiff/* =Handle ui_a - ui_b;error */ } /* ... */ } | 
Compliant Solution (Precondition Test)
This compliant solution performs a precondition test of the unsigned operands of the subtraction operation to guarantee there is no possibility of unsigned wrap:
| Anchor | ||||
|---|---|---|---|---|
| 
 | 
Subtraction
Subtraction is between two operands of arithmetic type, two pointers to qualified or unqualified versions of compatible object types, or a pointer to an object type and an integer type. This rule applies only to subtraction between two operands of arithmetic type. (See ARR36-C. Do not subtract or compare two pointers that do not refer to the same array, ARR37-C. Do not add or subtract an integer to a pointer to a non-array object, and ARR30-C. Do not form or use out-of-bounds pointers or array subscripts for information about pointer subtraction.)
Decrementing is equivalent to subtracting 1.
Noncompliant Code Example
This noncompliant code example can result in an unsigned integer wrap during the subtraction of the unsigned operands ui_a and ui_b. If this behavior is unanticipated, it may lead to an exploitable vulnerability.
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| void func(unsigned int ui_a, unsigned int ui_b) {
  unsigned int udiff = ui_a - ui_b;
  /* ...  | ||||
| Code Block | ||||
| 
 | ||||
| void func(unsigned int ui_a, unsigned int ui_b) {
  unsigned int udiff;
  if (ui_a < ui_b){
    /* Handle error */
  } else {
    udiff = ui_a - ui_b;
  }
  /* ... */
} | 
Compliant Solution (
...
Precondition Test)
This compliant solution performs a postcondition precondition test that of the result unsigned operands of the unsigned subtraction operation udiff is not greater than the minuendto guarantee there is no possibility of unsigned wrap:
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| void func(unsigned int ui_a, unsigned int ui_b) {
  unsigned int udiff;
  =if (ui_a -< ui_b;){
   if (udiff/* > ui_a)Handle error */
  } else {
    udiff /* Handle error */= ui_a - ui_b;
  }
  /* ... */
} | 
...
Compliant Solution (Postcondition Test)
This compliant solution performs a postcondition test that the result of the unsigned subtraction operation udiff is not greater than the minuend:
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| void func(unsigned int ui_a, unsigned int ui_b) {
  unsigned int udiff = ui_a - ui_b;
  if (udiff > ui_a) {
    /* Handle error */
  }
  /* ... */
} | 
Compliant Solution (C23, Checked Integers)
This compliant solution uses the new-to-C23 checked integer arithmetic to safely perform integer subtraction:
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| #include <stdckdint.h>
void func(unsigned int ui_a, unsigned int ui_b) {
  unsigned int udiff;
  if (ckd_sub(&udiff, ui_a, ui_b)) {
    /* Handle error */
  }
  /* ... */
} | 
| Anchor | ||||
|---|---|---|---|---|
| 
 | 
Multiplication
Multiplication is between two operands of arithmetic type.
Noncompliant Code Example
The Mozilla Foundation Security Advisory 2007-01 describes a heap buffer overflow vulnerability in the Mozilla Scalable Vector Graphics (SVG) viewer resulting from an unsigned integer wrap during the multiplication of the signed int value pen->num_vertices and the size_t value sizeof(cairo_pen_vertex_t) [VU#551436]. The signed int operand is converted to size_t prior to the multiplication operation so that the multiplication takes place between two size_t integers, which are unsigned. (See INT02-C. Understand integer conversion rules.)
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| pen->num_vertices = _cairo_pen_vertices_needed(
  gstate->tolerance, radius, &gstate->ctm
); | 
...
Multiplication
Multiplication is between two operands of arithmetic type.
Noncompliant Code Example
The Mozilla Foundation Security Advisory 2007-01 describes a heap buffer overflow vulnerability in the Mozilla Scalable Vector Graphics (SVG) viewer resulting from an unsigned integer wrap during the multiplication of the signed int value pen->num_vertices and the size_t value sizeof(cairo_pen_vertex_t) [VU#551436]. The signed int operand is converted to size_t prior to the multiplication operation so that the multiplication takes place between two size_t integers, which are unsigned. (See INT02-C. Understand integer conversion rules.)
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| pen->num_vertices = _cairo_pen_vertices_needed(
  gstate->tolerance, radius, &gstate->ctm
);
pen->vertices = malloc(
  pen->num_vertices * sizeof(cairo_pen_vertex_t)
);
 | 
The unsigned integer wrap can result in allocating memory of insufficient size.
Compliant Solution
This compliant solution tests the operands of the multiplication to guarantee that there is no unsigned integer wrap:
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| pen->num_vertices = _cairo_pen_vertices_needed(
  gstate->tolerance, radius, &gstate->ctm
);
if (pen->num_vertices > SIZE_MAX / sizeof(cairo_pen_vertex_t)) {
  /* Handle error */
}
pen->vertices = malloc(
  pen->num_vertices * sizeof(cairo_pen_vertex_t)
);
 | 
Exceptions
INT30-C-EX1: Unsigned integers can exhibit modulo behavior (wrapping) when necessary for the proper execution of the program. It is recommended that the variable declaration be clearly commented as supporting modulo behavior and that each operation on that integer also be clearly commented as supporting modulo behavior.
INT30-C-EX2: Checks for wraparound can be omitted when it can be determined at compile time that wraparound will not occur. As such, the following operations on unsigned integers require no validation:
- Operations on two compile-time constants
- Operations on a variable and 0 (except division or remainder by 0)
- Subtracting any variable from its type's maximum; for example, any unsigned intmay safely be subtracted fromUINT_MAX
- Multiplying any variable by 1
- Division or remainder, as long as the divisor is nonzero
- Right-shifting any type maximum by any number no larger than the type precision; for example, UINT_MAX >> xis valid as long as0 <= x < 32(assuming that the precision ofunsigned intis 32 bits)
The unsigned integer wrap can result in allocating memory of insufficient size.
Compliant Solution
This compliant solution tests the operands of the multiplication to guarantee that there is no unsigned integer wrap:
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| pen->num_vertices = _cairo_pen_vertices_needed(
  gstate->tolerance, radius, &gstate->ctm
);
if (pen->num_vertices > SIZE_MAX / sizeof(cairo_pen_vertex_t)) {
  /* Handle error */
}
pen->vertices = malloc(
  pen->num_vertices * sizeof(cairo_pen_vertex_t)
);
 | 
Compliant Solution (C23, Checked Integers)
This compliant solution uses the new-to-C23 checked integer arithmetic to safely perform integer multiplication:
| Code Block | ||||
|---|---|---|---|---|
| 
 | ||||
| #include <stdckdint.h>
/* ... */
pen->num_vertices = _cairo_pen_vertices_needed(
  gstate->tolerance, radius, &gstate->ctm
);
size_t product;
if (ckd_mul(&product, pen->num_vertices, sizeof(cairo_pen_vertex_t))) {
  /* Handle error */
}
pen->vertices = malloc(product); | 
Exceptions
INT30-C-EX1: Unsigned integers can exhibit modulo behavior (wrapping) when necessary for the proper execution of the program. It is recommended that the variable declaration be clearly commented as supporting modulo behavior and that each operation on that integer also be clearly commented as supporting modulo behavior.
INT30-C-EX2: Checks for wraparound can be omitted when it can be determined at compile time that wraparound will not occur. As such, the following operations on unsigned integers require no validation:
- Operations on two compile-time constants
- Operations on a variable and 0 (except division or remainder by 0)
- Subtracting any variable from its type's maximum; for example, any unsigned intmay safely be subtracted fromUINT_MAX
- Multiplying any variable by 1
- Division or remainder, as long as the divisor is nonzero
- Right-shifting any type maximum by any number no larger than the type precision; for example, UINT_MAX >> xis valid as long as0 <= x < 32(assuming that the precision ofunsigned intis 32 bits)
| Anchor | ||||
|---|---|---|---|---|
| 
 | 
INT30-C-EX3. The left-shift operator takes two operands of integer type. Unsigned left shift << can exhibit modulo behavior (wrapping).  This exception is provided because of common usage, because this behavior is usually expected by the programmer, and because the behavior is well defined. For examples of usage of the left-shift operator, see INT34-C. Do not shift an expression by a Anchor 
<< can exhibit modulo behavior (wrapping).  This exception is provided because of common usage, because this behavior is usually expected by the programmer, and because the behavior is well defined. For examples of usage of the left-shift operator, see INT34-C. Do not shift an expression by a negative number of bits or by greater than or equal to the number of bits that exist in the operand....
Integer wrap can lead to buffer overflows and the execution of arbitrary code by an attackerarbitrary code by an attacker. Note that this rule is not automatically repairable in contrast to INT32-C. Ensure that operations on signed integers do not result in overflow. This is because integer wrapping is occasionally intended (see INT30-C-EX1), and repairing such wrapping would turn correct code into code that spuriously signals wraparound errors.
| Rule | Severity | Likelihood | Detectable | Remediation CostRepairable | Priority | Level | 
|---|---|---|---|---|---|---|
| INT30-C | High | Likely | No | HighNo | P9 | L2 | 
Automated Detection
| Tool | Version | Checker | Description | Astrée | ||||||||||||||||||||||||||||||||||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Include Page | Astrée_V | Astrée_V | integer-overflow | Fully checked | Axivion Bauhaus Suite | |||||||||||||||||||||||||||||||||||||||||||||||||
| Include Page | cplusplus:Axivion Bauhaus Suite_V | cplusplus:Axivion Bauhaus Suite_V | CertC-INT30 | Implemented | CodeSonar | |||||||||||||||||||||||||||||||||||||||||||||||||
| Include Page | CodeSonar_V | CodeSonar_V | ALLOC.SIZE.ADDOFLOW | Addition overflow of allocation size | Compass/ROSE | Can detect violations of this rule by ensuring that operations are checked for overflow before being performed (Be mindful of exception INT30-EX2 because it excuses many operations from requiring validation, including all the operations that would validate a potentially dangerous operation. For instance, adding two  | Version | Checker | Description | |||||||||||||||||||||||||||||||||||||||||||||
| Astrée | 
 | constant-expression-wrap-around | Fully checked | |||||||||||||||||||||||||||||||||||||||||||||||||||
| Axivion Bauhaus Suite | 
 | CertC-INT30 | Implemented | |||||||||||||||||||||||||||||||||||||||||||||||||||
| CodeSonar | 
 | ALLOC.SIZE.ADDOFLOW | Addition overflow of allocation size | |||||||||||||||||||||||||||||||||||||||||||||||||||
| Compass/ROSE | Can detect violations of this rule by ensuring that operations are checked for overflow before being performed (Be mindful of exception INT30-EX2 because it excuses many operations from requiring validation, including all the operations that would validate a potentially dangerous operation. For instance, adding two  | |||||||||||||||||||||||||||||||||||||||||||||||||||||
| Coverity | 
 | INTEGER_OVERFLOW | Implemented | |||||||||||||||||||||||||||||||||||||||||||||||||||
| Cppcheck Premium | 
 | premium-cert-int30-c | ||||||||||||||||||||||||||||||||||||||||||||||||||||
| Helix QAC | 
 | C2910, C3383, C3384, C3385, C3386 C++2910 DF2911, DF2912, DF2913, | ||||||||||||||||||||||||||||||||||||||||||||||||||||
| Klocwork | 
 | NUM.OVERFLOW | ||||||||||||||||||||||||||||||||||||||||||||||||||||
| LDRA tool suite | 
 | 493 S, 494 S | Partially implemented | |||||||||||||||||||||||||||||||||||||||||||||||||||
| Parasoft C/C++test | 
 | CERT_C-INT30-a | Avoid wraparounds when performing arithmetic integer operations | |||||||||||||||||||||||||||||||||||||||||||||||||||
| Polyspace Bug Finder | 
 | CERT C: Rule INT30-C | Checks for: 
 Rule partially covered. | Coverity | ||||||||||||||||||||||||||||||||||||||||||||||||||
| Include Page | Coverity_V | Coverity_V | INTEGER_OVERFLOW | Implemented | Helix QAC | |||||||||||||||||||||||||||||||||||||||||||||||||
| Include Page | Helix QAC_V | Helix QAC_V | C2910, C2911, C2912, C2913, C3383, C3384, C3385, C3386 C++2910, C++2911, C++2912, C++2913 | Klocwork | ||||||||||||||||||||||||||||||||||||||||||||||||||
| Include Page | Klocwork_V | Klocwork_V | NUM.OVERFLOW CWARN.NOEFFECT.OUTOFRANGE | LDRA tool suite | ||||||||||||||||||||||||||||||||||||||||||||||||||
| Include Page | LDRA_V | LDRA_V | 493 S, 494 S | Partially implemented | Parasoft C/C++test | |||||||||||||||||||||||||||||||||||||||||||||||||
| Include Page | Parasoft_V | Parasoft_V | CERT_C-INT30-a | Avoid integer overflows | Polyspace Bug Finder | |||||||||||||||||||||||||||||||||||||||||||||||||
| Include Page | Polyspace Bug Finder_V | Polyspace Bug Finder_V | CERT C: Rule INT30-C | Checks for: 
 Rule partially covered. | PRQA QA-C | |||||||||||||||||||||||||||||||||||||||||||||||||
| Include Page | PRQA QA-C_v | PRQA QA-C_v | 2910 [C], 2911 [D], 2912 [A], 2913 [S], 3383, 3384, 3385, 3386 | Partially implemented | PRQA QA-C++ | | Include Page |  | cplusplus:PRQA QA-C++_V | cplusplus:PRQA QA-C++_V2910, 2911, 2912, 2913 | |||||||||||||||||||||||||||||||||||||||||||||
| PVS-Studio | 
 | V658, V1012, V1028, V5005, V5011 | ||||||||||||||||||||||||||||||||||||||||||||||||||||
| RuleChecker | 
 | constant-expression-wrap-around | Fully checked | |||||||||||||||||||||||||||||||||||||||||||||||||||
| TrustInSoft Analyzer | 
 | unsigned overflow | Exhaustively verified. | 
Related Vulnerabilities
CVE-2009-1385 results from a violation of this rule. The value performs an unchecked subtraction on the length of a buffer and then adds those many bytes of data to another buffer [xorl 2009]. This can cause a buffer overflow, which allows an attacker to execute arbitrary code.
...
| [Bailey 2014] | Raising Lazarus - The 20 Year Old Bug that Went to Mars | 
| [Dowd 2006] | Chapter 6, "C Language Issues" ("Arithmetic Boundary Conditions," pp. 211–223) | 
| [ISO/IEC 9899:20112024] | Subclause 6.2.5, "Types" | 
| [Seacord 2013b] | Chapter 5, "Integer Security" | 
| [Viega 2005] | Section 5.2.7, "Integer Overflow" | 
| [VU#551436] | |
| [Warren 2002] | Chapter 2, "Basics" | 
| [Wojtczuk 2008] | |
| [xorl 2009] | "CVE-2009-1385: Linux Kernel E1000 Integer Underflow" | 
...