• Top
    • Documentation
    • Books
    • Recursion-and-induction
    • Boolean-reasoning
    • Debugging
    • Projects
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
      • Gl
      • Esim
      • Vl2014
        • Warnings
          • Vl-warninglist->types
          • Vl-warning
          • Propagating-errors
            • Vl-blamealist
            • Vl-design-propagate-errors
            • Vl-blame-alist-to-reportcard
            • Vl-blame-alist
            • Vl-design-zombies
            • Vl-blamealist-count
            • Vl-reportcard
            • Vl-warning-sort
            • Lint-warning-suppression
            • Clean-warnings
            • Warn
            • Vl-print-warnings-with-header
            • Vl-some-warning-fatalp
            • Vl-print-warnings-with-named-header
            • Flat-warnings
            • Vl-remove-warnings
            • Vl-keep-warnings
            • Vl-print-warnings
            • Vl-some-warning-of-type-p
            • Vl-clean-warnings
            • Vl-warnings-to-string
            • Vl-warninglist
            • Vl-print-warning
            • Ok
            • Vl-trace-warnings
            • Fatal
          • Primitives
          • Use-set
          • Syntax
          • Getting-started
          • Utilities
          • Loader
          • Transforms
          • Lint
          • Mlib
          • Server
          • Kit
          • Printer
          • Esim-vl
          • Well-formedness
        • Sv
        • Vwsim
        • Fgl
        • Vl
        • X86isa
        • Svl
        • Rtl
      • Software-verification
      • Testing-utilities
      • Math
    • Propagating-errors

    Vl-blamealist-count

    Signature
    (vl-blamealist-count x) → count
    Arguments
    x — Guard (vl-blamealist-p x).
    Returns
    count — Type (natp count).

    Definitions and Theorems

    Function: vl-blamealist-count

    (defun vl-blamealist-count (x)
      (declare (xargs :guard (vl-blamealist-p x)))
      (let ((__function__ 'vl-blamealist-count))
        (declare (ignorable __function__))
        (let ((x (mbe :logic (vl-blamealist-fix x)
                      :exec x)))
          (if (atom x)
              1
            (+ 1 (vl-blamealist-count (cdr x)))))))

    Theorem: natp-of-vl-blamealist-count

    (defthm natp-of-vl-blamealist-count
      (b* ((count (vl-blamealist-count x)))
        (natp count))
      :rule-classes :type-prescription)

    Theorem: vl-blamealist-count-of-vl-blamealist-fix-x

    (defthm vl-blamealist-count-of-vl-blamealist-fix-x
      (equal (vl-blamealist-count (vl-blamealist-fix x))
             (vl-blamealist-count x)))

    Theorem: vl-blamealist-count-vl-blamealist-equiv-congruence-on-x

    (defthm vl-blamealist-count-vl-blamealist-equiv-congruence-on-x
      (implies (vl-blamealist-equiv x x-equiv)
               (equal (vl-blamealist-count x)
                      (vl-blamealist-count x-equiv)))
      :rule-classes :congruence)

    Theorem: vl-blamealist-count-of-cons

    (defthm vl-blamealist-count-of-cons
      (>= (vl-blamealist-count (cons acl2::a acl2::b))
          (vl-blamealist-count acl2::b))
      :rule-classes :linear)

    Theorem: vl-blamealist-count-of-cdr

    (defthm vl-blamealist-count-of-cdr
      (<= (vl-blamealist-count (cdr x))
          (vl-blamealist-count x))
      :rule-classes :linear)

    Theorem: vl-blamealist-count-of-cdr-strong

    (defthm vl-blamealist-count-of-cdr-strong
      (implies (and (vl-blamealist-p x) (consp x))
               (< (vl-blamealist-count (cdr x))
                  (vl-blamealist-count x)))
      :rule-classes :linear)