./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b4d53423478efbe88c69a2c2de1bb984f61e7e586fd7bb6761452f26ace425f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:58:38,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:58:38,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-02-06 18:58:38,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:58:38,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:58:38,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 18:58:38,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:58:38,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:58:38,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:58:38,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:58:38,295 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:58:38,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:58:38,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:58:38,296 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:58:38,296 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 18:58:38,296 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 18:58:38,296 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 18:58:38,296 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 18:58:38,296 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 18:58:38,297 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 18:58:38,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:58:38,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 18:58:38,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:58:38,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:58:38,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 18:58:38,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 18:58:38,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 18:58:38,298 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:58:38,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:58:38,298 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 18:58:38,298 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:58:38,298 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:58:38,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:58:38,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:58:38,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:58:38,299 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:58:38,299 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 18:58:38,300 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4d53423478efbe88c69a2c2de1bb984f61e7e586fd7bb6761452f26ace425f7 [2025-02-06 18:58:38,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:58:38,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:58:38,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:58:38,581 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:58:38,581 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:58:38,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c [2025-02-06 18:58:39,897 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d28b6e52/978f7120aaf44745b552dc0cc57ea0c2/FLAG924e21f28 [2025-02-06 18:58:40,172 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:58:40,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-crafted/McCarthy91_Recursion.c [2025-02-06 18:58:40,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d28b6e52/978f7120aaf44745b552dc0cc57ea0c2/FLAG924e21f28 [2025-02-06 18:58:40,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d28b6e52/978f7120aaf44745b552dc0cc57ea0c2 [2025-02-06 18:58:40,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:58:40,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:58:40,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:58:40,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:58:40,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:58:40,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a272a20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40, skipping insertion in model container [2025-02-06 18:58:40,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:58:40,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:58:40,601 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:58:40,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:58:40,622 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:58:40,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40 WrapperNode [2025-02-06 18:58:40,622 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:58:40,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:58:40,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:58:40,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:58:40,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,644 INFO L138 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7 [2025-02-06 18:58:40,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:58:40,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:58:40,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:58:40,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:58:40,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,656 INFO L175 MemorySlicer]: No memory access in input program. [2025-02-06 18:58:40,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,658 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:58:40,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:58:40,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:58:40,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:58:40,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (1/1) ... [2025-02-06 18:58:40,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:40,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:40,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:40,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 18:58:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:58:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:58:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 [2025-02-06 18:58:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 [2025-02-06 18:58:40,765 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:58:40,766 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:58:40,854 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2025-02-06 18:58:40,854 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:58:40,863 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:58:40,863 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:58:40,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:58:40 BoogieIcfgContainer [2025-02-06 18:58:40,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:58:40,865 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 18:58:40,866 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 18:58:40,871 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 18:58:40,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 18:58:40,872 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 06:58:40" (1/3) ... [2025-02-06 18:58:40,873 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c332fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 06:58:40, skipping insertion in model container [2025-02-06 18:58:40,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 18:58:40,873 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:58:40" (2/3) ... [2025-02-06 18:58:40,873 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c332fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 06:58:40, skipping insertion in model container [2025-02-06 18:58:40,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 18:58:40,874 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:58:40" (3/3) ... [2025-02-06 18:58:40,875 INFO L363 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Recursion.c [2025-02-06 18:58:40,915 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 18:58:40,915 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 18:58:40,915 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 18:58:40,915 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 18:58:40,915 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 18:58:40,915 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 18:58:40,916 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 18:58:40,916 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 18:58:40,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:58:40,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 18:58:40,933 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:40,933 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:40,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 18:58:40,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 18:58:40,939 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 18:58:40,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 18:58:40,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 18:58:40,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:40,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:40,941 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 18:58:40,941 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 18:58:40,947 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "call main_#t~ret3#1 := mc91(main_~x~0#1);"< [2025-02-06 18:58:40,948 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< [2025-02-06 18:58:40,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash 33741, now seen corresponding path program 1 times [2025-02-06 18:58:40,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:40,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838873087] [2025-02-06 18:58:40,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:41,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:41,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:41,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:41,028 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:41,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:41,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:41,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:41,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:41,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash 40689, now seen corresponding path program 1 times [2025-02-06 18:58:41,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:41,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384359047] [2025-02-06 18:58:41,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:41,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:41,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:41,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:41,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:41,066 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:41,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:41,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:41,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:41,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:41,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1005189029, now seen corresponding path program 1 times [2025-02-06 18:58:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:41,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652751417] [2025-02-06 18:58:41,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:41,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:41,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:58:41,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:58:41,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:41,083 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:41,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:58:41,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:58:41,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:41,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:41,190 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:41,191 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:41,191 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:41,191 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:41,192 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 18:58:41,192 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:41,192 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:41,192 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:41,192 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration1_Loop [2025-02-06 18:58:41,192 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:41,193 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:41,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:41,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:41,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:41,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:41,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:41,291 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:41,292 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 18:58:41,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:41,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:41,297 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:41,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 18:58:41,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 18:58:41,299 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:41,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-06 18:58:41,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:41,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:41,328 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:41,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 18:58:41,332 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 18:58:41,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:41,365 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 18:58:41,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-06 18:58:41,370 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:41,370 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:41,370 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:41,370 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:41,370 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 18:58:41,370 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:41,370 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:41,370 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:41,370 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration1_Loop [2025-02-06 18:58:41,370 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:41,370 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:41,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:41,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:41,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:41,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:41,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:41,424 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:41,427 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 18:58:41,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:41,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:41,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:41,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 18:58:41,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:41,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:41,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:41,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:41,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:41,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:41,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:41,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:41,465 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 18:58:41,469 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 18:58:41,472 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 18:58:41,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:41,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:41,475 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:41,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 18:58:41,479 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 18:58:41,479 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 18:58:41,480 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 18:58:41,480 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 211 Supporting invariants [] [2025-02-06 18:58:41,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:41,492 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 18:58:41,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:41,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:41,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:41,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:41,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:58:41,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:41,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:41,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:41,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:41,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 18:58:41,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:58:41,663 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-06 18:58:41,665 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:41,778 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 39 transitions. Complement of second has 16 states. [2025-02-06 18:58:41,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:58:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2025-02-06 18:58:41,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 3 letters. [2025-02-06 18:58:41,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:41,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 6 letters. Loop has 3 letters. [2025-02-06 18:58:41,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:41,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 6 letters. [2025-02-06 18:58:41,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:41,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2025-02-06 18:58:41,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 18:58:41,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 19 states and 25 transitions. [2025-02-06 18:58:41,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-02-06 18:58:41,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-02-06 18:58:41,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2025-02-06 18:58:41,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:41,806 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-02-06 18:58:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2025-02-06 18:58:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-02-06 18:58:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 18:58:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-02-06 18:58:41,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-06 18:58:41,830 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-06 18:58:41,830 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 18:58:41,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2025-02-06 18:58:41,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 18:58:41,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:41,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:41,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:58:41,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:58:41,833 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "call main_#t~ret3#1 := mc91(main_~x~0#1);"< "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume ~n > 100;#res := ~n - 10;" "assume true;" >"#18#return;" [2025-02-06 18:58:41,833 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret1 := mc91(#t~ret0);"< "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume ~n > 100;#res := ~n - 10;" "assume true;" >"#18#return;" [2025-02-06 18:58:41,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:41,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1053772474, now seen corresponding path program 1 times [2025-02-06 18:58:41,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:41,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831326509] [2025-02-06 18:58:41,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:41,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:41,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:58:41,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:58:41,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:41,845 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:41,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:58:41,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:58:41,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:41,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:41,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:41,855 INFO L85 PathProgramCache]: Analyzing trace with hash 39827909, now seen corresponding path program 1 times [2025-02-06 18:58:41,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:41,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56429230] [2025-02-06 18:58:41,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:41,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:41,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:41,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:41,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:41,868 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:41,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:41,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:41,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:41,874 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:41,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash -327329270, now seen corresponding path program 1 times [2025-02-06 18:58:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:41,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464685675] [2025-02-06 18:58:41,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:41,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:41,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 18:58:41,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 18:58:41,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:41,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:41,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 18:58:41,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 18:58:41,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:41,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:41,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:42,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 18:58:42,077 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:42,077 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:42,077 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:42,078 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:42,078 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 18:58:42,078 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:42,078 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:42,078 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:42,078 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration2_Loop [2025-02-06 18:58:42,078 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:42,078 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:42,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:42,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:42,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:42,130 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:42,131 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 18:58:42,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:42,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:42,133 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:42,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 18:58:42,136 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 18:58:42,136 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:42,150 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 18:58:42,151 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret1=0} Honda state: {mc91_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 18:58:42,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-02-06 18:58:42,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:42,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:42,159 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:42,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 18:58:42,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 18:58:42,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:42,173 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 18:58:42,173 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 18:58:42,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-06 18:58:42,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:42,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:42,180 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:42,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 18:58:42,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 18:58:42,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:42,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-06 18:58:42,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:42,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:42,218 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:42,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 18:58:42,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 18:58:42,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:42,730 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 18:58:42,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-02-06 18:58:42,747 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:42,747 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:42,747 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:42,747 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:42,747 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 18:58:42,747 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:42,747 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:42,747 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:42,747 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration2_Loop [2025-02-06 18:58:42,748 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:42,748 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:42,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:42,754 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:42,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:42,810 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:42,810 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 18:58:42,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:42,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:42,812 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:42,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 18:58:42,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:42,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:42,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:42,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:42,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:42,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:42,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:42,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:42,830 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:42,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:42,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:42,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:42,841 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:42,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 18:58:42,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:42,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:42,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:42,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:42,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:42,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:42,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:42,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:42,865 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 18:58:42,869 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 18:58:42,869 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 18:58:42,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:42,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:42,871 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:42,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-02-06 18:58:42,875 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 18:58:42,875 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 18:58:42,875 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 18:58:42,875 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#t~ret0) = -2*mc91_#t~ret0 + 201 Supporting invariants [] [2025-02-06 18:58:42,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:42,883 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 18:58:42,886 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret0 [2025-02-06 18:58:42,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:42,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:58:42,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:58:42,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:42,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:42,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:58:42,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:43,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:43,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:43,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:43,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:43,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 18:58:43,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:58:43,135 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2025-02-06 18:58:43,136 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6 Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:58:43,323 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 21 transitions. cyclomatic complexity: 6. Second operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 51 states and 73 transitions. Complement of second has 32 states. [2025-02-06 18:58:43,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 18:58:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2025-02-06 18:58:43,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 8 letters. [2025-02-06 18:58:43,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:43,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 8 letters. [2025-02-06 18:58:43,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:43,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 16 letters. [2025-02-06 18:58:43,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:43,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 73 transitions. [2025-02-06 18:58:43,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-06 18:58:43,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 42 states and 62 transitions. [2025-02-06 18:58:43,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-06 18:58:43,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-02-06 18:58:43,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 62 transitions. [2025-02-06 18:58:43,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:43,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 62 transitions. [2025-02-06 18:58:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 62 transitions. [2025-02-06 18:58:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2025-02-06 18:58:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-06 18:58:43,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2025-02-06 18:58:43,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 51 transitions. [2025-02-06 18:58:43,345 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2025-02-06 18:58:43,345 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 18:58:43,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2025-02-06 18:58:43,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-02-06 18:58:43,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:43,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:43,347 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:58:43,347 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-06 18:58:43,347 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "call main_#t~ret3#1 := mc91(main_~x~0#1);"< "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume ~n > 100;#res := ~n - 10;" "assume true;" >"#18#return;" "call #t~ret1 := mc91(#t~ret0);"< "~n := #in~n;" "assume !(~n > 100);" [2025-02-06 18:58:43,347 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume !(~n > 100);" [2025-02-06 18:58:43,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:43,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1019791704, now seen corresponding path program 2 times [2025-02-06 18:58:43,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:43,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998461738] [2025-02-06 18:58:43,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:58:43,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:43,354 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-06 18:58:43,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:58:43,359 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:58:43,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:43,360 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:43,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:58:43,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:58:43,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:43,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:43,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:43,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:43,368 INFO L85 PathProgramCache]: Analyzing trace with hash 46479, now seen corresponding path program 2 times [2025-02-06 18:58:43,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:43,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31214722] [2025-02-06 18:58:43,369 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:58:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:43,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:43,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:43,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:58:43,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:43,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:43,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:43,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:43,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:43,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:43,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:43,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1984014728, now seen corresponding path program 3 times [2025-02-06 18:58:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:43,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229835757] [2025-02-06 18:58:43,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:58:43,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:43,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 4 equivalence classes. [2025-02-06 18:58:43,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 18:58:43,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 18:58:43,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:58:43,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:58:43,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229835757] [2025-02-06 18:58:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229835757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:58:43,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:58:43,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:58:43,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97525850] [2025-02-06 18:58:43,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:58:43,635 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:43,635 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:43,635 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:43,635 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:43,635 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 18:58:43,635 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:43,635 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:43,635 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:43,635 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration3_Loop [2025-02-06 18:58:43,635 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:43,635 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:43,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:43,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:43,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:43,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:43,690 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:43,690 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 18:58:43,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:43,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:43,693 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:43,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-02-06 18:58:43,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 18:58:43,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:43,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-06 18:58:43,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:43,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:43,734 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:43,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-02-06 18:58:43,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 18:58:43,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:44,104 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 18:58:44,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-06 18:58:44,116 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:44,116 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:44,116 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:44,117 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:44,117 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 18:58:44,117 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:44,117 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:44,117 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:44,117 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration3_Loop [2025-02-06 18:58:44,117 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:44,117 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:44,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:44,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:44,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:44,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:44,157 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:44,157 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 18:58:44,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:44,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:44,160 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:44,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 18:58:44,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:44,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:44,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:44,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:44,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:44,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:44,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:44,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:44,186 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 18:58:44,190 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 18:58:44,190 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 18:58:44,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:44,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:44,212 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:44,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 18:58:44,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 18:58:44,214 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 18:58:44,214 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 18:58:44,214 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_~n) = -2*mc91_~n + 189 Supporting invariants [] [2025-02-06 18:58:44,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:44,222 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 18:58:44,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-02-06 18:58:44,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 18:58:44,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:44,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:58:44,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:58:44,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:44,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:44,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 18:58:44,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:44,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:44,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:44,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:44,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:44,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 18:58:44,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:58:44,400 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-02-06 18:58:44,400 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:58:44,471 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 43 states and 59 transitions. Complement of second has 13 states. [2025-02-06 18:58:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:58:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2025-02-06 18:58:44,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2025-02-06 18:58:44,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:44,476 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 18:58:44,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:44,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:58:44,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:58:44,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:44,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:44,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 18:58:44,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:44,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:44,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:44,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:44,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:44,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 18:58:44,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:58:44,605 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2025-02-06 18:58:44,605 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:58:44,668 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 43 states and 59 transitions. Complement of second has 13 states. [2025-02-06 18:58:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:44,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:58:44,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2025-02-06 18:58:44,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2025-02-06 18:58:44,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:44,672 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 18:58:44,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:44,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:58:44,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:58:44,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:44,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:44,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 18:58:44,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:44,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:58:44,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:58:44,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:44,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:44,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 18:58:44,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:58:44,806 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2025-02-06 18:58:44,806 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19 Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:58:44,886 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 51 transitions. cyclomatic complexity: 19. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 71 states and 100 transitions. Complement of second has 16 states. [2025-02-06 18:58:44,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:58:44,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2025-02-06 18:58:44,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2025-02-06 18:58:44,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:44,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2025-02-06 18:58:44,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:44,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2025-02-06 18:58:44,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:44,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 100 transitions. [2025-02-06 18:58:44,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-02-06 18:58:44,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 48 states and 74 transitions. [2025-02-06 18:58:44,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-02-06 18:58:44,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-02-06 18:58:44,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 74 transitions. [2025-02-06 18:58:44,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:44,895 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2025-02-06 18:58:44,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 74 transitions. [2025-02-06 18:58:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2025-02-06 18:58:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 11 states have call successors, (18), 9 states have call predecessors, (18), 5 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2025-02-06 18:58:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2025-02-06 18:58:44,899 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 60 transitions. [2025-02-06 18:58:44,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:58:44,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:58:44,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:58:44,901 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 18:58:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:58:44,991 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2025-02-06 18:58:44,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 82 transitions. [2025-02-06 18:58:44,993 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-02-06 18:58:44,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 58 states and 75 transitions. [2025-02-06 18:58:44,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-02-06 18:58:44,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-02-06 18:58:44,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 75 transitions. [2025-02-06 18:58:44,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:44,999 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 75 transitions. [2025-02-06 18:58:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 75 transitions. [2025-02-06 18:58:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-02-06 18:58:45,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 13 states have call successors, (18), 11 states have call predecessors, (18), 9 states have return successors, (19), 8 states have call predecessors, (19), 11 states have call successors, (19) [2025-02-06 18:58:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2025-02-06 18:58:45,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 74 transitions. [2025-02-06 18:58:45,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:58:45,009 INFO L432 stractBuchiCegarLoop]: Abstraction has 57 states and 74 transitions. [2025-02-06 18:58:45,009 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 18:58:45,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 74 transitions. [2025-02-06 18:58:45,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-02-06 18:58:45,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:45,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:45,011 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:58:45,011 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2025-02-06 18:58:45,011 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "call main_#t~ret3#1 := mc91(main_~x~0#1);"< "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume ~n > 100;#res := ~n - 10;" "assume true;" >"#18#return;" "call #t~ret1 := mc91(#t~ret0);"< "~n := #in~n;" "assume ~n > 100;#res := ~n - 10;" "assume true;" >"#16#return;" "#res := #t~ret1;havoc #t~ret0;havoc #t~ret1;" "assume true;" >"#18#return;" "call #t~ret1 := mc91(#t~ret0);"< [2025-02-06 18:58:45,011 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume ~n > 100;#res := ~n - 10;" "assume true;" >"#18#return;" "call #t~ret1 := mc91(#t~ret0);"< "~n := #in~n;" "assume ~n > 100;#res := ~n - 10;" "assume true;" >"#16#return;" "#res := #t~ret1;havoc #t~ret0;havoc #t~ret1;" "assume true;" >"#18#return;" "call #t~ret1 := mc91(#t~ret0);"< [2025-02-06 18:58:45,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:45,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1867148514, now seen corresponding path program 1 times [2025-02-06 18:58:45,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:45,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790927786] [2025-02-06 18:58:45,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:45,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:45,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:58:45,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:58:45,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:45,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:45,019 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:45,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:58:45,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:58:45,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:45,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:45,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:45,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:45,026 INFO L85 PathProgramCache]: Analyzing trace with hash 161545262, now seen corresponding path program 1 times [2025-02-06 18:58:45,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:45,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923625825] [2025-02-06 18:58:45,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:58:45,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:45,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:58:45,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:58:45,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:45,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:45,033 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:45,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:58:45,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:58:45,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:45,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:45,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:45,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:45,039 INFO L85 PathProgramCache]: Analyzing trace with hash 230980013, now seen corresponding path program 2 times [2025-02-06 18:58:45,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:45,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351036010] [2025-02-06 18:58:45,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:58:45,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:45,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-06 18:58:45,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 18:58:45,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:58:45,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 18:58:45,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:58:45,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351036010] [2025-02-06 18:58:45,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351036010] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:58:45,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372789454] [2025-02-06 18:58:45,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:58:45,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:58:45,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:45,210 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:58:45,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 18:58:45,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-06 18:58:45,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 18:58:45,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:58:45,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:45,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 18:58:45,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 18:58:45,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:58:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-06 18:58:45,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372789454] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:58:45,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:58:45,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-02-06 18:58:45,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074558784] [2025-02-06 18:58:45,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:58:45,701 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:45,702 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:45,702 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:45,702 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:45,702 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 18:58:45,702 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:45,702 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:45,702 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:45,702 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration4_Loop [2025-02-06 18:58:45,702 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:45,702 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:45,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:45,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:45,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:45,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:45,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:45,735 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:45,735 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 18:58:45,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:45,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:45,737 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:45,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 18:58:45,741 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 18:58:45,741 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:45,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 18:58:45,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:45,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:45,765 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:45,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 18:58:45,767 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 18:58:45,767 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:45,779 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 18:58:45,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-02-06 18:58:45,786 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:45,786 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:45,786 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:45,786 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:45,786 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 18:58:45,786 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:45,786 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:45,786 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:45,786 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration4_Loop [2025-02-06 18:58:45,786 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:45,786 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:45,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:45,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:45,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:45,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:45,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:45,817 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:45,818 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 18:58:45,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:45,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:45,820 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:45,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 18:58:45,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:45,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:45,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:45,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:45,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:45,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:45,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:45,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:45,839 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 18:58:45,841 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 18:58:45,841 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 18:58:45,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:45,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:45,843 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:45,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-06 18:58:45,846 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 18:58:45,846 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 18:58:45,846 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 18:58:45,846 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -1*mc91_#in~n + 90 Supporting invariants [] [2025-02-06 18:58:45,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:45,853 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 18:58:45,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:45,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:58:45,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:58:45,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:45,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:45,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 18:58:45,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:46,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:58:46,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:58:46,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:46,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:46,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 18:58:46,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:46,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-06 18:58:46,291 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2025-02-06 18:58:46,292 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 18:58:46,646 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Result 125 states and 150 transitions. Complement of second has 49 states. [2025-02-06 18:58:46,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 6 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-06 18:58:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 35 transitions. [2025-02-06 18:58:46,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 35 transitions. Stem has 22 letters. Loop has 19 letters. [2025-02-06 18:58:46,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:46,650 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 18:58:46,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:46,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:58:46,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:58:46,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:46,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:46,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 18:58:46,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:46,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:58:46,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:58:46,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:46,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:46,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 18:58:46,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:58:47,012 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2025-02-06 18:58:47,012 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 18:58:47,312 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Result 125 states and 150 transitions. Complement of second has 39 states. [2025-02-06 18:58:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 18:58:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2025-02-06 18:58:47,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 35 transitions. Stem has 22 letters. Loop has 19 letters. [2025-02-06 18:58:47,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:47,314 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 18:58:47,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:47,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:58:47,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:58:47,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:47,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:47,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 18:58:47,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:47,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:58:47,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:58:47,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:47,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:47,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 18:58:47,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:58:47,643 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2025-02-06 18:58:47,644 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21 Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 18:58:48,099 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 74 transitions. cyclomatic complexity: 21. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Result 325 states and 417 transitions. Complement of second has 131 states. [2025-02-06 18:58:48,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 2 stem states 16 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-06 18:58:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 50 transitions. [2025-02-06 18:58:48,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 50 transitions. Stem has 22 letters. Loop has 19 letters. [2025-02-06 18:58:48,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:48,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 50 transitions. Stem has 41 letters. Loop has 19 letters. [2025-02-06 18:58:48,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:48,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 50 transitions. Stem has 22 letters. Loop has 38 letters. [2025-02-06 18:58:48,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:48,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 417 transitions. [2025-02-06 18:58:48,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-02-06 18:58:48,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 169 states and 230 transitions. [2025-02-06 18:58:48,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2025-02-06 18:58:48,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2025-02-06 18:58:48,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 230 transitions. [2025-02-06 18:58:48,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:48,124 INFO L218 hiAutomatonCegarLoop]: Abstraction has 169 states and 230 transitions. [2025-02-06 18:58:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 230 transitions. [2025-02-06 18:58:48,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 140. [2025-02-06 18:58:48,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 86 states have (on average 1.0813953488372092) internal successors, (93), 88 states have internal predecessors, (93), 32 states have call successors, (42), 26 states have call predecessors, (42), 22 states have return successors, (43), 25 states have call predecessors, (43), 28 states have call successors, (43) [2025-02-06 18:58:48,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 178 transitions. [2025-02-06 18:58:48,134 INFO L240 hiAutomatonCegarLoop]: Abstraction has 140 states and 178 transitions. [2025-02-06 18:58:48,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:58:48,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 18:58:48,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-06 18:58:48,135 INFO L87 Difference]: Start difference. First operand 140 states and 178 transitions. Second operand has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 8 states have internal predecessors, (22), 7 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 18:58:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 18:58:48,317 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2025-02-06 18:58:48,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 163 transitions. [2025-02-06 18:58:48,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 18:58:48,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 101 states and 121 transitions. [2025-02-06 18:58:48,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2025-02-06 18:58:48,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-02-06 18:58:48,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 121 transitions. [2025-02-06 18:58:48,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-06 18:58:48,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 121 transitions. [2025-02-06 18:58:48,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 121 transitions. [2025-02-06 18:58:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-02-06 18:58:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.05) internal successors, (63), 61 states have internal predecessors, (63), 22 states have call successors, (29), 19 states have call predecessors, (29), 15 states have return successors, (25), 16 states have call predecessors, (25), 18 states have call successors, (25) [2025-02-06 18:58:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2025-02-06 18:58:48,337 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 117 transitions. [2025-02-06 18:58:48,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 18:58:48,340 INFO L432 stractBuchiCegarLoop]: Abstraction has 97 states and 117 transitions. [2025-02-06 18:58:48,340 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 18:58:48,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 117 transitions. [2025-02-06 18:58:48,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-02-06 18:58:48,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 18:58:48,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 18:58:48,342 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-02-06 18:58:48,342 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:58:48,342 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;" "call main_#t~ret3#1 := mc91(main_~x~0#1);"< "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume ~n > 100;#res := ~n - 10;" "assume true;" >"#18#return;" "call #t~ret1 := mc91(#t~ret0);"< "~n := #in~n;" "assume ~n > 100;#res := ~n - 10;" "assume true;" >"#16#return;" "#res := #t~ret1;havoc #t~ret0;havoc #t~ret1;" "assume true;" >"#18#return;" "call #t~ret1 := mc91(#t~ret0);"< "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume ~n > 100;#res := ~n - 10;" "assume true;" >"#18#return;" "call #t~ret1 := mc91(#t~ret0);"< "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume ~n > 100;#res := ~n - 10;" "assume true;" >"#18#return;" "call #t~ret1 := mc91(#t~ret0);"< [2025-02-06 18:58:48,342 INFO L754 eck$LassoCheckResult]: Loop: "~n := #in~n;" "assume !(~n > 100);" "call #t~ret0 := mc91(11 + ~n);"< "~n := #in~n;" "assume ~n > 100;#res := ~n - 10;" "assume true;" >"#18#return;" "call #t~ret1 := mc91(#t~ret0);"< [2025-02-06 18:58:48,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:48,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1720383910, now seen corresponding path program 3 times [2025-02-06 18:58:48,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:48,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919566853] [2025-02-06 18:58:48,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:58:48,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:48,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 7 equivalence classes. [2025-02-06 18:58:48,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 18:58:48,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-06 18:58:48,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:48,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:48,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 18:58:48,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 18:58:48,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:48,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:48,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:48,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash 965737405, now seen corresponding path program 2 times [2025-02-06 18:58:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:48,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600290288] [2025-02-06 18:58:48,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:58:48,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:48,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-02-06 18:58:48,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:48,365 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:58:48,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:48,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:48,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:48,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:48,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:48,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:48,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:48,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:48,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1268147946, now seen corresponding path program 4 times [2025-02-06 18:58:48,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:58:48,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674283647] [2025-02-06 18:58:48,369 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 18:58:48,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:58:48,372 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-02-06 18:58:48,378 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 18:58:48,380 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 18:58:48,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:48,380 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 18:58:48,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 18:58:48,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 18:58:48,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:48,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 18:58:48,400 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 18:58:48,458 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:48,458 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:48,459 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:48,459 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:48,459 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-06 18:58:48,459 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:48,459 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:48,459 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:48,459 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration5_Loop [2025-02-06 18:58:48,459 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:48,459 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:48,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:48,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:48,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:48,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:48,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:48,500 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:48,501 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-06 18:58:48,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:48,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:48,503 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:48,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 18:58:48,506 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 18:58:48,506 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:48,517 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 18:58:48,517 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#t~ret0=0} Honda state: {mc91_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 18:58:48,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-02-06 18:58:48,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:48,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:48,524 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:48,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 18:58:48,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 18:58:48,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:48,536 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-06 18:58:48,536 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {mc91_#res=0} Honda state: {mc91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-02-06 18:58:48,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-02-06 18:58:48,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:48,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:48,544 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:48,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 18:58:48,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-06 18:58:48,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:48,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-02-06 18:58:48,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:48,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:48,564 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:48,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 18:58:48,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-06 18:58:48,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-06 18:58:48,577 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-06 18:58:48,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-06 18:58:48,583 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 18:58:48,583 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 18:58:48,583 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 18:58:48,583 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 18:58:48,584 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 18:58:48,584 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:48,584 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 18:58:48,584 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 18:58:48,584 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Recursion.c_Iteration5_Loop [2025-02-06 18:58:48,584 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 18:58:48,584 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 18:58:48,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:48,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:48,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:48,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:48,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 18:58:48,612 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 18:58:48,612 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 18:58:48,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:48,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:48,614 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:48,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 18:58:48,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:48,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:48,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:48,625 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:48,625 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:48,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:48,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:48,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:48,627 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:48,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 18:58:48,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:48,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:48,636 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:48,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-06 18:58:48,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:48,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:48,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:48,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:48,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:48,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:48,650 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:48,650 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:48,652 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 18:58:48,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-02-06 18:58:48,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:48,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:48,661 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:48,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-02-06 18:58:48,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 18:58:48,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 18:58:48,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 18:58:48,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 18:58:48,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 18:58:48,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 18:58:48,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 18:58:48,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 18:58:48,677 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 18:58:48,678 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-02-06 18:58:48,678 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-06 18:58:48,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 18:58:48,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:58:48,680 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 18:58:48,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-02-06 18:58:48,682 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 18:58:48,682 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-06 18:58:48,682 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 18:58:48,682 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(mc91_#in~n) = -2*mc91_#in~n + 201 Supporting invariants [] [2025-02-06 18:58:48,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-02-06 18:58:48,688 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-06 18:58:48,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:48,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 18:58:48,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 18:58:48,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:48,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:48,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 18:58:48,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:48,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-02-06 18:58:48,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:48,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:48,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:48,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:48,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 18:58:48,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:58:49,057 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2025-02-06 18:58:49,057 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 117 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 18:58:49,126 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 117 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 107 states and 127 transitions. Complement of second has 16 states. [2025-02-06 18:58:49,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 18:58:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2025-02-06 18:58:49,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 38 letters. Loop has 8 letters. [2025-02-06 18:58:49,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:49,128 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 18:58:49,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:49,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 18:58:49,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 18:58:49,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:49,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:49,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 18:58:49,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:49,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:49,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:49,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:49,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:49,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 18:58:49,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:58:49,454 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2025-02-06 18:58:49,454 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 117 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 18:58:49,621 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 117 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 125 states and 146 transitions. Complement of second has 28 states. [2025-02-06 18:58:49,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 18:58:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2025-02-06 18:58:49,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 38 letters. Loop has 8 letters. [2025-02-06 18:58:49,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:49,623 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 18:58:49,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:49,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 18:58:49,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 18:58:49,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:49,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:49,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 18:58:49,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:49,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:49,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:49,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:49,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:49,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 18:58:49,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:58:49,939 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2025-02-06 18:58:49,940 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 117 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 18:58:50,026 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 117 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 147 states and 167 transitions. Complement of second has 17 states. [2025-02-06 18:58:50,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 18:58:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-02-06 18:58:50,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 38 letters. Loop has 8 letters. [2025-02-06 18:58:50,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:50,028 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-02-06 18:58:50,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:58:50,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 18:58:50,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 18:58:50,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:50,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:50,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 18:58:50,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:50,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:58:50,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:58:50,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:58:50,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:58:50,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 18:58:50,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:58:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:58:50,346 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2025-02-06 18:58:50,346 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97 states and 117 transitions. cyclomatic complexity: 24 Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 18:58:50,549 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97 states and 117 transitions. cyclomatic complexity: 24. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 182 states and 209 transitions. Complement of second has 51 states. [2025-02-06 18:58:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2025-02-06 18:58:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-06 18:58:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2025-02-06 18:58:50,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 38 letters. Loop has 8 letters. [2025-02-06 18:58:50,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:50,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 46 letters. Loop has 8 letters. [2025-02-06 18:58:50,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:50,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 38 letters. Loop has 16 letters. [2025-02-06 18:58:50,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 18:58:50,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 209 transitions. [2025-02-06 18:58:50,554 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 18:58:50,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 0 states and 0 transitions. [2025-02-06 18:58:50,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 18:58:50,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 18:58:50,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 18:58:50,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 18:58:50,554 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 18:58:50,554 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 18:58:50,555 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 18:58:50,555 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 18:58:50,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 18:58:50,555 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 18:58:50,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 18:58:50,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 06:58:50 BoogieIcfgContainer [2025-02-06 18:58:50,565 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 18:58:50,565 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 18:58:50,565 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 18:58:50,566 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 18:58:50,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:58:40" (3/4) ... [2025-02-06 18:58:50,568 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 18:58:50,568 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 18:58:50,569 INFO L158 Benchmark]: Toolchain (without parser) took 10096.05ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 64.6MB in the end (delta: 41.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2025-02-06 18:58:50,569 INFO L158 Benchmark]: CDTParser took 1.15ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:58:50,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.73ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 96.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 18:58:50,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.24ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 95.3MB in the end (delta: 867.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:58:50,569 INFO L158 Benchmark]: Boogie Preprocessor took 17.68ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.5MB in the end (delta: 813.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:58:50,570 INFO L158 Benchmark]: IcfgBuilder took 201.28ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 85.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 18:58:50,570 INFO L158 Benchmark]: BuchiAutomizer took 9699.28ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 66.0MB in the end (delta: 18.7MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2025-02-06 18:58:50,570 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 142.6MB. Free memory was 64.6MB in the beginning and 64.6MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 18:58:50,571 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.15ms. Allocated memory is still 201.3MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.73ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 96.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.24ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 95.3MB in the end (delta: 867.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.68ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 94.5MB in the end (delta: 813.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 201.28ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 85.1MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 9699.28ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 66.0MB in the end (delta: 18.7MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 142.6MB. Free memory was 64.6MB in the beginning and 64.6MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #t~ret0 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 2 deterministic, 3 nondeterministic). One deterministic module has affine ranking function (211 + ((long) -2 * \old(n))) and consists of 5 locations. One deterministic module has affine ranking function null and consists of 8 locations. One nondeterministic module has affine ranking function (((long) -2 * n) + 189) and consists of 6 locations. One nondeterministic module has affine ranking function (90 + ((long) -1 * \old(n))) and consists of 19 locations. One nondeterministic module has affine ranking function (((long) -2 * \old(n)) + 201) and consists of 12 locations. 2 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.6s and 6 iterations. TraceHistogramMax:8. Analysis of lassos took 3.6s. Construction of modules took 0.6s. Büchi inclusion checks took 5.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 48 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 2, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 10/24 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 260 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 246 mSDsluCounter, 447 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 261 mSDsCounter, 205 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 944 IncrementalHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 205 mSolverCounterUnsat, 186 mSDtfsCounter, 944 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq171 hnf91 smp100 dnf100 smp100 tf110 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 52ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-06 18:58:50,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-06 18:58:50,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE