Flawfinder version 2.0.10, (C) 2001-2019 David A. Wheeler.
Number of rules (primarily dangerous function names) in C/C++ ruleset: 223
Examining data/mathicgb-1.0~git20200526/src/checksource/CheckSource.cpp
Examining data/mathicgb-1.0~git20200526/src/checksource/Scanner.cpp
Examining data/mathicgb-1.0~git20200526/src/checksource/Scanner.hpp
Examining data/mathicgb-1.0~git20200526/src/cli/CommonParams.cpp
Examining data/mathicgb-1.0~git20200526/src/cli/CommonParams.hpp
Examining data/mathicgb-1.0~git20200526/src/cli/GBAction.cpp
Examining data/mathicgb-1.0~git20200526/src/cli/GBAction.hpp
Examining data/mathicgb-1.0~git20200526/src/cli/GBCommonParams.cpp
Examining data/mathicgb-1.0~git20200526/src/cli/GBCommonParams.hpp
Examining data/mathicgb-1.0~git20200526/src/cli/GBMain.cpp
Examining data/mathicgb-1.0~git20200526/src/cli/HelpAction.cpp
Examining data/mathicgb-1.0~git20200526/src/cli/HelpAction.hpp
Examining data/mathicgb-1.0~git20200526/src/cli/MatrixAction.cpp
Examining data/mathicgb-1.0~git20200526/src/cli/MatrixAction.hpp
Examining data/mathicgb-1.0~git20200526/src/cli/SigGBAction.cpp
Examining data/mathicgb-1.0~git20200526/src/cli/SigGBAction.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb.h
Examining data/mathicgb-1.0~git20200526/src/mathicgb/Atomic.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/Basis.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/Basis.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/CFile.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/CFile.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ClassicGBAlg.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ClassicGBAlg.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/F4MatrixBuilder.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/F4MatrixBuilder.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/F4MatrixBuilder2.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/F4MatrixBuilder2.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/F4MatrixProjection.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/F4MatrixProjection.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/F4MatrixReducer.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/F4MatrixReducer.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/F4ProtoMatrix.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/F4ProtoMatrix.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/F4Reducer.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/F4Reducer.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/FixedSizeMonomialMap.h
Examining data/mathicgb-1.0~git20200526/src/mathicgb/KoszulQueue.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/LogDomain.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/LogDomain.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/LogDomainSet.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/LogDomainSet.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/MathicIO.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ModuleMonoSet.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ModuleMonoSet.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/MonoArena.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/MonoLookup.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/MonoLookup.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/MonoOrder.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/MonoProcessor.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/MonomialMap.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/NonCopyable.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/Poly.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/PolyBasis.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/PolyBasis.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/PolyHashTable.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/PolyHashTable.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/PolyRing.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/PolyRing.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/PrimeField.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/QuadMatrix.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/QuadMatrix.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/QuadMatrixBuilder.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/QuadMatrixBuilder.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/Range.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/RawVector.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/Reducer.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/Reducer.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerDedup.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerDedup.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerHash.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerHash.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerHashPack.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerHashPack.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerHelper.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerNoDedup.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerNoDedup.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerPack.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerPack.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerPackDedup.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ReducerPackDedup.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/SPairs.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/SPairs.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/Scanner.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/Scanner.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/ScopeExit.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/SigPolyBasis.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/SigPolyBasis.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/SigSPairQueue.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/SigSPairQueue.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/SigSPairs.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/SigSPairs.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/SignatureGB.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/SignatureGB.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/SparseMatrix.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/SparseMatrix.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/StaticMonoMap.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/TypicalReducer.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/TypicalReducer.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/Unchar.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/io-util.cpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/io-util.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/mtbb.hpp
Examining data/mathicgb-1.0~git20200526/src/mathicgb/stdinc.h
Examining data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp
Examining data/mathicgb-1.0~git20200526/src/test/F4MatrixBuilder.cpp
Examining data/mathicgb-1.0~git20200526/src/test/F4MatrixReducer.cpp
Examining data/mathicgb-1.0~git20200526/src/test/MathicIO.cpp
Examining data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp
Examining data/mathicgb-1.0~git20200526/src/test/PrimeField.cpp
Examining data/mathicgb-1.0~git20200526/src/test/QuadMatrixBuilder.cpp
Examining data/mathicgb-1.0~git20200526/src/test/Range.cpp
Examining data/mathicgb-1.0~git20200526/src/test/Scanner.cpp
Examining data/mathicgb-1.0~git20200526/src/test/SparseMatrix.cpp
Examining data/mathicgb-1.0~git20200526/src/test/gb-test.cpp
Examining data/mathicgb-1.0~git20200526/src/test/gtestInclude.cpp
Examining data/mathicgb-1.0~git20200526/src/test/ideals.cpp
Examining data/mathicgb-1.0~git20200526/src/test/ideals.hpp
Examining data/mathicgb-1.0~git20200526/src/test/mathicgb.cpp
Examining data/mathicgb-1.0~git20200526/src/test/poly-test.cpp
Examining data/mathicgb-1.0~git20200526/src/test/testMain.cpp

FINAL RESULTS:

data/mathicgb-1.0~git20200526/src/checksource/CheckSource.cpp:25:38:  [4] (shell) system:
  This causes a new program to execute and is difficult to use safely
  (CWE-78). try using a library call that implements the same functionality
  if available.
bool matchInclude(Scanner& in, bool& system) {
data/mathicgb-1.0~git20200526/src/checksource/CheckSource.cpp:72:8:  [4] (shell) system:
  This causes a new program to execute and is difficult to use safely
  (CWE-78). try using a library call that implements the same functionality
  if available.
  bool system;
data/mathicgb-1.0~git20200526/src/checksource/CheckSource.cpp:73:27:  [4] (shell) system:
  This causes a new program to execute and is difficult to use safely
  (CWE-78). try using a library call that implements the same functionality
  if available.
  while (matchInclude(in, system)) {
data/mathicgb-1.0~git20200526/src/checksource/CheckSource.cpp:74:23:  [4] (shell) system:
  This causes a new program to execute and is difficult to use safely
  (CWE-78). try using a library call that implements the same functionality
  if available.
    if (sawSystem && !system)
data/mathicgb-1.0~git20200526/src/checksource/CheckSource.cpp:76:17:  [4] (shell) system:
  This causes a new program to execute and is difficult to use safely
  (CWE-78). try using a library call that implements the same functionality
  if available.
    sawSystem = system;
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:481:12:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    return access(mono, exponentsIndexBegin() + var);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:496:12:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    return access(mono, componentIndex());
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:504:37:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      return static_cast<HashValue>(access(mono, hashIndex()));
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:512:11:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(a, i) != access(b, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:512:27:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(a, i) != access(b, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:539:18:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      orOfXor |= access(a, i) ^ access(b, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:539:33:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      orOfXor |= access(a, i) ^ access(b, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:550:11:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(ab, i) != access(a, i) + access(b, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:550:28:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(ab, i) != access(a, i) + access(b, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:550:43:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(ab, i) != access(a, i) + access(b, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:581:23:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      MATHICGB_ASSERT(access(a, i*2) >= 0);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:582:46:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      MATHICGB_ASSERT(i == varCount() / 2 || access(a, i*2+1) >= 0);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:642:11:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(div, i) > access(into, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:642:28:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(div, i) > access(into, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:660:11:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(div, i) > access(into, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:660:28:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(div, i) > access(into, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:721:25:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      const auto dive = access(div, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:722:11:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(div, i) > access(a, i) && access(div, i) > access(b, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:722:28:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(div, i) > access(a, i) && access(div, i) > access(b, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:722:44:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(div, i) > access(a, i) && access(div, i) > access(b, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:722:61:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(div, i) > access(a, i) && access(div, i) > access(b, i))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:753:11:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(lcmAB, i) != std::max(access(a, i), access(b, i)))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:753:40:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(lcmAB, i) != std::max(access(a, i), access(b, i)))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:753:54:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(lcmAB, i) != std::max(access(a, i), access(b, i)))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:815:24:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      const auto cmp = access(a, index) - access(b, index);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:815:43:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      const auto cmp = access(a, index) - access(b, index);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:853:9:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
        access(a, index) - (access(b1, index) + access(b2, index));
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:853:29:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
        access(a, index) - (access(b1, index) + access(b2, index));
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:853:49:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
        access(a, index) - (access(b1, index) + access(b2, index));
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:867:11:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(a, i) > 0 && access(b, i) > 0)
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:867:31:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (access(a, i) > 0 && access(b, i) > 0)
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:884:20:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      if (!inRange(access(mono, i)))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:907:14:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      return access(mono, orderIndexBegin() + grading);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:945:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(to, componentIndex()) = monoidFrom.component(from);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:955:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(to, hashIndex()) = monoidFrom.hash(from);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:969:22:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    auto& exponent = access(mono, exponentsIndexBegin() + var);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:999:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(mono, exponentsIndexBegin() + iVar) = exponents[eVar];
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1019:23:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
    auto& component = access(mono, componentIndex());
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1034:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(prod, i) = access(a, i) + access(b, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1034:25:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(prod, i) = access(a, i) + access(b, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1034:40:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(prod, i) = access(a, i) + access(b, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1045:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(prod, i) += access(a, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1045:26:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(prod, i) += access(a, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1057:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(quo, i) = access(num, i) - access(by, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1057:24:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(quo, i) = access(num, i) - access(by, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1057:41:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(quo, i) = access(num, i) - access(by, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1069:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(num, i) -= access(by, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1069:25:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(num, i) -= access(by, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1086:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(quo, i) = access(num, i) - access(by, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1086:24:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(quo, i) = access(num, i) - access(by, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1086:41:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(quo, i) = access(num, i) - access(by, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1102:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(out, componentIndex()) = component(mult);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1105:26:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      const auto colon = access(colonNum, i) - access(colonBy, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1105:48:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      const auto colon = access(colonNum, i) - access(colonBy, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1106:21:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      auto result = access(mult, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1109:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(out, i) = result;
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1138:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(aColonB, componentIndex()) = 0;
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1139:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(bColonA, componentIndex()) = 0;
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1143:23:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      const auto ae = access(a, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1144:23:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      const auto be = access(b, i);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1146:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(aColonB, i) = max - be;
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1147:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(bColonA, i) = max - ae;
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1162:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(lcmAB, componentIndex()) = access(a, componentIndex());
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1162:41:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(lcmAB, componentIndex()) = access(a, componentIndex());
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1165:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(lcmAB, i) = std::max(access(a, i), access(b, i));
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1165:35:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(lcmAB, i) = std::max(access(a, i), access(b, i));
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1165:49:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(lcmAB, i) = std::max(access(a, i), access(b, i));
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1184:7:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
      access(lcmAB, componentIndex()) =
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1771:13:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
  Exponent& access(MonoRef& m, const VarIndex index) const {
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1776:19:  [4] (race) access:
  This usually indicates a security flaw. If an attacker can change anything
  along the path between the call to access() and the file's actual use
  (e.g., by moving files), the attacker can exploit the race condition
  (CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
  and try to open the file directly.
  const Exponent& access(ConstMonoRef& m, const VarIndex index) const {
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:233:12:  [3] (random) srand:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
      std::srand(0); // To use the same hash coefficients every time.
data/mathicgb-1.0~git20200526/src/mathicgb/CFile.cpp:12:9:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  mFile(fopen(fileName.c_str(), mode)
data/mathicgb-1.0~git20200526/src/mathicgb/CFile.cpp:16:9:  [2] (misc) fopen:
  Check when opening files - can an attacker redirect it (via symlinks),
  force the opening of special file type (e.g., device files), move things
  around to create a race condition, control its ancestors, or change its
  contents? (CWE-362).
  mFile(fopen(fileName.c_str(), mode)
data/mathicgb-1.0~git20200526/src/mathicgb/RawVector.hpp:226:8:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
  void memcpy(const T* from, size_t countOfT) {
data/mathicgb-1.0~git20200526/src/mathicgb/RawVector.hpp:228:10:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
    std::memcpy(mEnd, from, countOfT * sizeof(T));
data/mathicgb-1.0~git20200526/src/mathicgb/SparseMatrix.cpp:187:19:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
  mBlock.mScalars.memcpy(data.mScalarsBegin, size);
data/mathicgb-1.0~git20200526/src/mathicgb/SparseMatrix.cpp:188:22:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
  mBlock.mColIndices.memcpy(data.mIndicesBegin, size);
data/mathicgb-1.0~git20200526/src/checksource/Scanner.cpp:47:31:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  mBuffer(input, input + std::strlen(input)),
data/mathicgb-1.0~git20200526/src/checksource/Scanner.cpp:66:26:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  const auto size = std::strlen(str);
data/mathicgb-1.0~git20200526/src/checksource/Scanner.cpp:164:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    mStream->read(readInto, readCount);
data/mathicgb-1.0~git20200526/src/cli/MatrixAction.cpp:72:24:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      modulus = matrix.read(file.handle());
data/mathicgb-1.0~git20200526/src/cli/MatrixAction.cpp:85:34:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      modulus = lowerRightMatrix.read(file.handle());
data/mathicgb-1.0~git20200526/src/cli/MatrixAction.cpp:103:23:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
      referenceMatrix.read(file.handle());
data/mathicgb-1.0~git20200526/src/mathicgb/F4MatrixBuilder2.cpp:125:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (!monoid().equal(*tasks[i].desiredLead, *mono))
data/mathicgb-1.0~git20200526/src/mathicgb/MonoArena.hpp:127:30:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    MATHICGB_ASSERT(monoid().equal(back(), mono));
data/mathicgb-1.0~git20200526/src/mathicgb/MonoArena.hpp:142:30:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    MATHICGB_ASSERT(monoid().equal(monoidMono, mono, back()));
data/mathicgb-1.0~git20200526/src/mathicgb/MonoArena.hpp:240:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    return monoid.equal(monoA, monoB);
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:510:8:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  bool equal(ConstMonoRef a, ConstMonoRef b) const {
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:518:8:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  bool equal(
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:540:39:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    MATHICGB_ASSERT((orOfXor == 0) == equal(a, b));
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1621:32:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      MATHICGB_ASSERT(monoid().equal(back(), mono));
data/mathicgb-1.0~git20200526/src/mathicgb/MonoMonoid.hpp:1634:32:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      MATHICGB_ASSERT(monoid().equal(monoidMono, mono, back()));
data/mathicgb-1.0~git20200526/src/mathicgb/PolyBasis.cpp:57:31:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    MATHICGB_ASSERT(!monoid().equal(lead, it->poly->leadMono()));
data/mathicgb-1.0~git20200526/src/mathicgb/PolyBasis.hpp:59:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      (monoid().equal(leadMono(index), newValue->leadMono()));
data/mathicgb-1.0~git20200526/src/mathicgb/PolyHashTable.hpp:65:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (monoid().equal(newNode->mono(), node->mono())) {
data/mathicgb-1.0~git20200526/src/mathicgb/PolyRing.hpp:523:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  return monoid().equal(a, b);
data/mathicgb-1.0~git20200526/src/mathicgb/QuadMatrix.cpp:356:34:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
SparseMatrix::Scalar QuadMatrix::read(FILE* file) {
data/mathicgb-1.0~git20200526/src/mathicgb/QuadMatrix.cpp:362:39:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  const auto topLeftModulus = topLeft.read(file);
data/mathicgb-1.0~git20200526/src/mathicgb/QuadMatrix.cpp:363:41:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  const auto topRightModulus = topRight.read(file);
data/mathicgb-1.0~git20200526/src/mathicgb/QuadMatrix.cpp:364:45:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  const auto bottomLeftModulus = bottomLeft.read(file);
data/mathicgb-1.0~git20200526/src/mathicgb/QuadMatrix.cpp:365:47:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  const auto bottomRightModulus = bottomRight.read(file);
data/mathicgb-1.0~git20200526/src/mathicgb/QuadMatrix.hpp:88:24:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  SparseMatrix::Scalar read(FILE* file);
data/mathicgb-1.0~git20200526/src/mathicgb/Range.hpp:455:8:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  bool equal(const Flatten& f) const {
data/mathicgb-1.0~git20200526/src/mathicgb/Range.hpp:494:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  return a.equal(b);
data/mathicgb-1.0~git20200526/src/mathicgb/RawVector.hpp:78:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    return std::equal(begin(), end(), v.begin());
data/mathicgb-1.0~git20200526/src/mathicgb/ReducerDedup.cpp:122:29:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (!mRing.monoid().equal(*entry.mono, *mLeadTerm.mono))
data/mathicgb-1.0~git20200526/src/mathicgb/ReducerNoDedup.cpp:118:29:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (!mRing.monoid().equal(*entry.mono, *mLeadTerm.mono))
data/mathicgb-1.0~git20200526/src/mathicgb/ReducerPack.cpp:180:29:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (!mRing.monoid().equal(*entry->current, *mLeadTerm.mono))
data/mathicgb-1.0~git20200526/src/mathicgb/ReducerPackDedup.cpp:234:42:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
          MATHICGB_ASSERT(mRing.monoid().equal(*chain->current, *mLeadTerm.mono));
data/mathicgb-1.0~git20200526/src/mathicgb/ReducerPackDedup.cpp:258:29:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        if (!mRing.monoid().equal(*entry->current, *mLeadTerm.mono))
data/mathicgb-1.0~git20200526/src/mathicgb/SPairs.cpp:472:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (bareMonoid().equal(*lcmAB, *lcm))
data/mathicgb-1.0~git20200526/src/mathicgb/SPairs.cpp:482:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (bareMonoid().equal(*lcmAB, *lcm))
data/mathicgb-1.0~git20200526/src/mathicgb/SPairs.cpp:660:54:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      if (!eliminated(node.first, other) && monoid().equal(*lcm, *lcmAB))
data/mathicgb-1.0~git20200526/src/mathicgb/Scanner.cpp:60:31:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  mBuffer(input, input + std::strlen(input)),
data/mathicgb-1.0~git20200526/src/mathicgb/Scanner.cpp:80:26:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  const auto size = std::strlen(str);
data/mathicgb-1.0~git20200526/src/mathicgb/Scanner.cpp:181:14:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
    mStream->read(readInto, readCount);
data/mathicgb-1.0~git20200526/src/mathicgb/SigPolyBasis.cpp:101:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if (monoid().equal(ratio, *mSigLeadRatio[*prev])) {
data/mathicgb-1.0~git20200526/src/mathicgb/SigPolyBasis.cpp:114:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if (monoid().equal(ratio, *mSigLeadRatio[*next])) {
data/mathicgb-1.0~git20200526/src/mathicgb/SigPolyBasis.cpp:464:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    if (monoid().equal(ratio, sigLeadRatio(*pos)))
data/mathicgb-1.0~git20200526/src/mathicgb/SigSPairQueue.cpp:71:16:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      monoid().equal(*mPairQueue.topPairData(), *sig)
data/mathicgb-1.0~git20200526/src/mathicgb/SigSPairQueue.cpp:84:34:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        MATHICGB_ASSERT(monoid().equal(*tmp, *pairs[i].signature));
data/mathicgb-1.0~git20200526/src/mathicgb/SignatureGB.cpp:215:40:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  if (!mKoszuls.empty() && R->monoid().equal(mKoszuls.top(), *sig)) {
data/mathicgb-1.0~git20200526/src/mathicgb/SparseMatrix.cpp:496:36:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
SparseMatrix::Scalar SparseMatrix::read(FILE* file) {
data/mathicgb-1.0~git20200526/src/mathicgb/SparseMatrix.hpp:256:10:  [1] (buffer) read:
  Check buffer boundaries if used in a loop including recursive loops
  (CWE-120, CWE-20).
  Scalar read(FILE* file);
data/mathicgb-1.0~git20200526/src/test/MathicIO.cpp:103:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(m.equal(*monoRead, *monoSet)) << "Str: " << str;
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:132:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(monoid.equal(v.back(), v2.back()));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:154:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  ASSERT_TRUE(monoid.equal(v.front(), *v2.begin())); // front, non-const
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:155:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  ASSERT_TRUE(monoid.equal(vc.front(), *v2.begin())); // front, const
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:156:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  ASSERT_TRUE(monoid.equal(vc.back(), v.back())); // back, non-const
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:446:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(m.equal(c, mono));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:452:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(m.equal(b, mono));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:459:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(m.equal(a, mono));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:466:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(m.equal(c, mono));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:495:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      ASSERT_TRUE(m.equal(b, mono));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:514:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      ASSERT_TRUE(m.equal(a, mono));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:529:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(m.equal(mono, b));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:533:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(m.equal(mono, a));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:590:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(m.equal(mono, lcm));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:596:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(m.equal(mono, lcm));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:604:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(m.equal(mono, lcm));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:606:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(m.equal(mono2, lcm));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:637:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
      ASSERT_TRUE(m.equal(*greater, *greater));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:641:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        ASSERT_FALSE(m.equal(*lesser, *greater));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:906:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(none.equal(none, none1, none1));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:907:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(none.equal(some, some1, none1));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:908:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(none.equal(all, all1, none1));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:909:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(none.equal(none, none1, none2));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:910:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(none.equal(some, some1, none2));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:911:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(none.equal(all, all1, none2));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:914:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(some.equal(none, none1, some1));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:915:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(some.equal(some, some1, some1));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:916:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(some.equal(all, all1, some1));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:917:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(some.equal(none, none1, some2));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:918:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(some.equal(some, some1, some2));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:919:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(some.equal(all, all1, some2));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:922:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(all.equal(none, none1, all1));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:923:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(all.equal(some, some1, all1));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:924:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(all.equal(all, all1, all1));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:925:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(all.equal(none, none1, all2));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:926:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(all.equal(some, some1, all2));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:927:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(all.equal(all, all1, all2));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:931:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(none.equal(none1, none3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:932:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(none.equal(none2, none3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:934:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(none.equal(none1, none3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:935:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(none.equal(none2, none3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:939:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(all.equal(all1, all3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:940:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(all.equal(all2, all3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:942:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(all.equal(all1, all3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:943:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(all.equal(all2, all3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:947:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(some.equal(some1, some3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:948:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(some.equal(some2, some3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:950:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(some.equal(some1, some3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:951:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(some.equal(some2, some3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:955:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(some.equal(some1, some3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:956:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(some.equal(some2, some3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:958:23:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_FALSE(some.equal(some1, some3));
data/mathicgb-1.0~git20200526/src/test/MonoMonoid.cpp:959:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(some.equal(some2, some3));
data/mathicgb-1.0~git20200526/src/test/Range.cpp:24:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
    ASSERT_TRUE(std::equal(std::begin(r1), std::end(r1), std::begin(r2)));
data/mathicgb-1.0~git20200526/src/test/poly-test.cpp:631:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
  EXPECT_TRUE(monoid.equal(lm, I->getPoly(0)->leadMono()));

ANALYSIS SUMMARY:

Hits = 184
Lines analyzed = 30195 in approximately 0.73 seconds (41276 lines/second)
Physical Source Lines of Code (SLOC) = 22006
Hits@level = [0]   6 [1] 102 [2]   6 [3]   1 [4]  75 [5]   0
Hits@level+ = [0+] 190 [1+] 184 [2+]  82 [3+]  76 [4+]  75 [5+]   0
Hits/KSLOC@level+ = [0+] 8.63401 [1+] 8.36136 [2+] 3.72626 [3+] 3.4536 [4+] 3.40816 [5+]   0
Dot directories skipped = 1 (--followdotdir overrides)
Minimum risk level = 1
Not every hit is necessarily a security vulnerability.
There may be other security vulnerabilities; review your code!
See 'Secure Programming HOWTO'
(https://dwheeler.com/secure-programs) for more information.