To secure logic circuits against the illegal copying the insertion of the so-called key bit inputs using XOR/XNOR gates has been proposed in . The inserted gates modify (lock) the behavior of the original circuit and only the correct choice of the secret key bits guarantees the equivalent behaviour of the locked circuit to the original circuit. To break this kind of security, i.e. to find the secret key bits, there was a SAT solver based attack proposed in . The aim of this work is to experimentally verify this attack on several locked circuits with various number of primary inputs and outputs and with various number of gates. Except for the random placement of the key gates we evaluate also the positioning with chaining elimination. The obtained and presented results show that we were able to unlock 10 of 11 circuits within few minutes on a common PC.