• Top
  • Documentation
  • Books
  • Boolean-reasoning
    • Ipasir
    • Aignet
      • Base-api
        • Aignet-case
        • Aignet-init
        • Aignet-add-xor
        • Aignet-add-and
        • Ci-id->ionum
        • Literal
        • Gate-id->fanin1
        • Gate-id->fanin0
        • Aignet-set-nxst
        • Aignet-clear
        • Aignet-add-out
        • Regnum->nxst
        • Id->slot1
        • Id->phase
        • Num-regs
        • Num-ins
        • Num-fanins
        • Id->slot0
        • Regnum->id
        • Id->type
        • Id->regp
        • Outnum->fanin
        • Innum->id
        • Id-existsp
        • Aignet-add-reg
        • Aignet-add-in
        • Aignet-rollback
        • Num-outs
        • Num-nxsts
        • Num-gates
        • Fanin-litp
      • Aignet-construction
      • Representation
      • Aignet-copy-init
      • Aignet-simplify-with-tracking
      • Aignet-simplify-marked-with-tracking
      • Aignet-cnf
      • Aignet-simplify-marked
      • Aignet-complete-copy
      • Aignet-transforms
      • Aignet-eval
      • Semantics
      • Aignet-read-aiger
      • Aignet-write-aiger
      • Aignet-abc-interface
      • Utilities
    • Aig
    • Satlink
    • Truth
    • Ubdds
    • Bdd
    • Faig
    • Bed
    • 4v
  • Projects
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Base-api

Aignet-rollback

(aignet-rollback n aignet) rewinds the aignet so that node n is the last node.

Logically this is just:

(lookup-id n aignet)

The guard requires that there are no next-state nodes that will be removed; this is because the implementation of removing a next-state node is somewhat more complicated than other kinds.