Matrix generation: 10
Determinant computation: 0
Matrix generation: 0
Determinant computation: 0
Graph generation: 20
Negative clauses identification: 90
Matrix generation: 0
Determinant computation: 10
Clause removal: 0
Incremental addition of new clauses: 20
Negative clauses identfication: 20
Detection of no-exit-edge nodes: 0
Detection of no-entry-edge nodes: 0
Adding edges corresponding to no-exit-edge nodes: 3676
Total number of increments:1148
Number of increments zero:997
Efficiency:0.13153310104529617
total running time:3846