System-level fault identification is a key subject for maintaining the reliability of multiprocessor interconnected systems. This task requires fast and accurate inferences based on huge data volumes, and the problem of fault identification in an unstructured graph has been proved to be NP-hard. In this paper, we adopt the PMC diagnostic model as the foundation of pointto-point probing technology, and a system contains only restricted-faults if every of its fault-free units has at least one fault-free neighbor. Under this condition we propose a robust method of identifying restricted-faults in the folded hypercube, which is a promising alternative to the popular hypercube topology.