(Binary Simulator) Uses InsnSemanticsExpr::total_nnodes()
(Binary Simulator) Made MultiWithConversion the default simulator policy

This policy is backward compatible with the simulator's concrete policy,
but quite a bit slower.
(Binary Simulator) Documentation for increasing simulator speed
(Binary Analysis) Added another SMTSolver::satisfiable() function
(Support) Added Combinatorics::flip_coin()
(Binary Analysis) Symbolic expression improvements

* Added LeafNode::create_boolean() as a convenient method to create
  a 1-bit integer value and give it the name "true" or "false".

* Changed LeafNode printing so that leaf nodes that are constants
  behave the same way as variables, namely if a leaf node has a non-empty
  comment and the printing mode is CMT_INSTEAD, the comment is printed
  instead of the constant.
(Binary Simulator) Disable forwarding of signals during analysis
(Binary Simulator) "h" is an abbreviation for "help"
(Binary Simulator) Added "reset" command to reset analysis to initial state
(Binary Simulator) Comments are allowed interactively with '#'
(Binary Simulator) Path feasibility is implemented

When a conditional branch is encountered and the resulting EIP value
is a symbolic if-then-else, then an SMT solver is used to determine
which of the two branch targets is feasible and adds it to a list
of path constraints.  If both branches are feasible then one is
chosen randomly (like before).