The method of verifying the algorithms  was developed in which the deductive approach to checking the implementation of necessary requirements was used. The basis of the method is a mathematical model describing the algorithm behavior – the element of reflexive-transitive closure in the algorithm. When developing the method it was possible to eliminate cyclomatic complexity by means of lowering the method precision and using the search algorithms.