On Computational Complexity of Counting Fixed Points in Symmetric Boolean Graph Automata