In 1994, Naor and Shamir proposed a secret sharing scheme with perfect security, called Visual Cryptography. In this paper, we address the issue of visual false positive secret, visual false positive black pixels and visual false positive white pixels, where qualified subsets of participants may visually recognize and accept these pixels as secret which is not true. To our best knowledge, this paper is the first attempt in the literature to demonstrate Visual Cryptography could cause unpredictable damages to qualified subsets of participants and applications based on it without suffering malicious attacks. The experimental results and the analysis demonstrate that visual false positive secret is possible in 2-out-of-n Visual Cryptography.