We study the worst-case time complexity of relational programs for the canonical implementation of miniKanren. We propose a model that breaks the evaluation time in miniKanren into several different parts and provides methods to estimate the complexity of these parts. These methods can be combined into an approach for analyzing the complexity of recursive relations using the ideas originating from symbolic execution. Our approach puts a number of limitations on the program being analyzed but we show that is still practically applicable by applying it to a number of typical relations in miniKanren.