CBMC
diffblue.github.io
- Free plan
- Windows
- macOS
- Linux
- Self-hosted
What CBMC is
CBMC is a free, open-source bounded model checker for C and C++ programs. It examines possible execution paths to check assertions, including array bounds, pointer safety, exceptions, user-written assertions, and some undefined behavior such as signed integer overflow. Its analysis unwinds loops and sends the resulting equation to a decision procedure, so inputs may need a defined size bound. Supported languages include C89, C99, most of C11, C17, C23, many GCC and Visual Studio extensions, and SystemC through Scoot; the listed input languages also include Java bytecode. CBMC supports contracts and can produce counterexamples. Its incremental SMT2 backend can work with SMT-LIB 2.6-compliant solvers, with Z3 and CVC5 given as examples. It is available for Linux, macOS, and Windows, as well as self-hosted use. Distribution options include Homebrew instructions, Ubuntu DEB packages, Windows MSI installers, and Docker images. The 4-clause BSD-licensed project describes routine development and continuous integration use, and its guide points to third-party tools for reviewing findings and bringing verification into projects.
Who it suits
CBMC suits developers verifying C or C++ programs and teams that want to include model checking in routine development or continuous integration. It can also suit projects working with SystemC or Java bytecode, based on its listed language support.
Good to know, and what to watch
- Checks bounds, pointer safety, exceptions, and assertions
- Supports contracts and counterexamples
- Provides packages and instructions for major desktop platforms
- Can be integrated into Makefiles through goto-cc
- Supports incremental SMT2 solver connections
- Inputs may need a bounded size
- Loop unwinding is part of its analysis
- Develop versions are not recommended for production use
Plans
Every plan and priceCBMC
Free plan
The verdict
CBMC offers a broad set of code checks and several installation routes, with no license fee. Account for its bounded-input analysis and use released versions rather than develop versions for production.
What the maker publishes
- Bounded analysis
- CBMC may require restricting inputs to a bounded size, and its verification unwinds loops before passing the resulting equation to a decision procedure. source
- Build integration
- goto-cc can replace gcc or cl.exe in Makefiles to collect project models for verification. source
- Continuous integration
- The user guide describes using CBMC as part of routine software development and continuous integration. source
- Distribution
- The release page provides macOS Homebrew instructions, Ubuntu DEB packages, Windows MSI installers, and Docker container images. source
- Language support
- The repository states support for C89, C99, most of C11, C17, C23, many GCC and Visual Studio extensions, and SystemC using Scoot. source
- License
- The repository identifies CBMC as licensed under the 4-clause BSD license. source
- Platforms
- The installation guide points to installation instructions for macOS, Ubuntu, Windows, and Docker. source
- Purpose
- CBMC is a bounded model checker for C and C++ programs that explores possible execution paths and checks assertions. source
- Related tools
- The user guide names CBMC Viewer and CBMC Starter Kit as third-party tools for summarizing findings and adding verification to a project. source
- Release guidance
- The repository says released versions are tested and intended for production use, while develop versions are not recommended for production use. source
- Safety checks
- It can check array bounds, pointer safety, exceptions, user-specified assertions, and some undefined behavior such as signed integer overflow. source
- Solver support
- CBMC supports an incremental SMT2 backend that can use an SMT-LIB 2.6 compliant solver, with examples for Z3 and CVC5. source
- Support
- The repository asks users encountering problems to file a bug report as a GitHub issue. source
Checked against the maker's pages on 4 Oct 2026.