Termination Analyzer Purpose Provides expert guidance on proving termination of algorithms through ranking functions, well-founded orderings, and automated analysis. Capabilities - Identify ranking/variant functions automatically - Prove well-founded orderings - Handle mutual recursion - Detect potential non-termination - Generate termination certificates - Analyze complex control flow Usage Guidelines 1. Structure Analysis : Identify recursive calls and loop structures 2. Ranking Function : Find or construct appropriate ranking function 3. Ordering Proof : Prove well-foundedness of the order…