A new algorithm for static rule termination analysis within active databases is introduced. This algorithm uses evolution graphs which simulating rule processing statically and considering both rule activation and deactivation. This algorithm has been refined for some cases that cannot be assured of termination this refinement by using Refined Evolution Graphs and analyzing transactions and triggers. A Static Tool Environment is proposed that can be used in termination analysis algorithm. The Static tool proposed is suitable for this algorithm where its component can execute the proposed algorithm. We show that several termination analysis algorithms are captured with our algorithm. The proposed algorithm tests rule termination is presented considering deferred and detached executions. The proposed algorithm turns out to be practical and general with respect to various rules languages and thus it may be applied to many databases