Matrix generation: 10
Determinant computation: 0
Matrix generation: 0
Determinant computation: 0
Graph generation: 20
Negative clauses identification: 100
Matrix generation: 0
Determinant computation: 10
Clause removal: 11
Incremental addition of new clauses: 0
Negative clauses identfication: 150
Detection of no-exit-edge nodes: 0
Detection of no-entry-edge nodes: 0
Adding edges corresponding to no-exit-edge nodes: 1693
Total number of increments:707
Number of increments zero:619
Efficiency:0.12446958981612447
total running time:1994