./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursive/McCarthy91-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursive/McCarthy91-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 32bit --witnessprinter.graph.data.programhash a7241ade69e14c61e98aa837796de568ecf31fbd07f5084e15c262d93cdb3376 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:32:02,775 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:32:02,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:32:02,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:32:02,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:32:02,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:32:02,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:32:02,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:32:02,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:32:02,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:32:02,862 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:32:02,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:32:02,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:32:02,862 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:32:02,863 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:32:02,863 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:32:02,863 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:32:02,863 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:32:02,863 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:32:02,863 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:32:02,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:32:02,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:32:02,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:32:02,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:32:02,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:32:02,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:32:02,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:32:02,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:32:02,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:32:02,864 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:32:02,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:32:02,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:32:02,865 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:32:02,865 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:32:02,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:32:02,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:32:02,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:32:02,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:32:02,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:32:02,866 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:32:02,866 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/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7241ade69e14c61e98aa837796de568ecf31fbd07f5084e15c262d93cdb3376 [2025-03-09 07:32:03,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:32:03,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:32:03,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:32:03,113 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:32:03,113 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:32:03,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/McCarthy91-1.c [2025-03-09 07:32:04,292 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76940fecf/83a4388b0c754b13aa27aec15df958a0/FLAGf35147ec9 [2025-03-09 07:32:04,524 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:32:04,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/McCarthy91-1.c [2025-03-09 07:32:04,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76940fecf/83a4388b0c754b13aa27aec15df958a0/FLAGf35147ec9 [2025-03-09 07:32:04,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76940fecf/83a4388b0c754b13aa27aec15df958a0 [2025-03-09 07:32:04,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:32:04,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:32:04,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:32:04,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:32:04,889 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:32:04,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a747a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:04, skipping insertion in model container [2025-03-09 07:32:04,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:32:04" (1/1) ... [2025-03-09 07:32:04,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:32:04,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:32:05,003 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:32:05,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:32:05,023 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:32:05,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05 WrapperNode [2025-03-09 07:32:05,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:32:05,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:32:05,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:32:05,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:32:05,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (1/1) ... [2025-03-09 07:32:05,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (1/1) ... [2025-03-09 07:32:05,045 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 22 [2025-03-09 07:32:05,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:32:05,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:32:05,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:32:05,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:32:05,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (1/1) ... [2025-03-09 07:32:05,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (1/1) ... [2025-03-09 07:32:05,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (1/1) ... [2025-03-09 07:32:05,065 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 07:32:05,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (1/1) ... [2025-03-09 07:32:05,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (1/1) ... [2025-03-09 07:32:05,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (1/1) ... [2025-03-09 07:32:05,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (1/1) ... [2025-03-09 07:32:05,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (1/1) ... [2025-03-09 07:32:05,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (1/1) ... [2025-03-09 07:32:05,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:32:05,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:32:05,076 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:32:05,076 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:32:05,077 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (1/1) ... [2025-03-09 07:32:05,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,106 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:05,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 07:32:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:32:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:32:05,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:32:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:32:05,129 INFO L130 BoogieDeclarations]: Found specification of procedure f91 [2025-03-09 07:32:05,129 INFO L138 BoogieDeclarations]: Found implementation of procedure f91 [2025-03-09 07:32:05,168 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:32:05,169 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:32:05,229 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: havoc #t~ret4;havoc #t~ret5; [2025-03-09 07:32:05,235 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-03-09 07:32:05,235 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:32:05,244 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:32:05,244 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:32:05,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:32:05 BoogieIcfgContainer [2025-03-09 07:32:05,244 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:32:05,245 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:32:05,245 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:32:05,249 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:32:05,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:32:05,250 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:32:04" (1/3) ... [2025-03-09 07:32:05,250 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dd789be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:32:05, skipping insertion in model container [2025-03-09 07:32:05,250 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:32:05,250 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:32:05" (2/3) ... [2025-03-09 07:32:05,251 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dd789be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:32:05, skipping insertion in model container [2025-03-09 07:32:05,251 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:32:05,251 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:32:05" (3/3) ... [2025-03-09 07:32:05,252 INFO L363 chiAutomizerObserver]: Analyzing ICFG McCarthy91-1.c [2025-03-09 07:32:05,293 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:32:05,293 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:32:05,293 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:32:05,293 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:32:05,293 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:32:05,294 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:32:05,294 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:32:05,294 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:32:05,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-03-09 07:32:05,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:32:05,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:05,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:05,310 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 07:32:05,310 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:32:05,310 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:32:05,311 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-03-09 07:32:05,311 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:32:05,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:05,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:05,312 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-09 07:32:05,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:32:05,315 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "call main_#t~ret7#1 := f91(main_~x~0#1);"< [2025-03-09 07:32:05,316 INFO L754 eck$LassoCheckResult]: Loop: "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< [2025-03-09 07:32:05,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:05,320 INFO L85 PathProgramCache]: Analyzing trace with hash 38707, now seen corresponding path program 1 times [2025-03-09 07:32:05,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:05,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887953114] [2025-03-09 07:32:05,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:05,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:05,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:05,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:05,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:05,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:05,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:05,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:05,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash 46647, now seen corresponding path program 1 times [2025-03-09 07:32:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:05,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669681446] [2025-03-09 07:32:05,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:05,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:05,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:05,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:05,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,419 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:05,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:05,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:05,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:05,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:05,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1153137093, now seen corresponding path program 1 times [2025-03-09 07:32:05,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:05,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257520773] [2025-03-09 07:32:05,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:05,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:05,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:32:05,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:32:05,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:05,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:32:05,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:32:05,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:05,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:05,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:05,544 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:05,545 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:05,545 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:05,545 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:05,545 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:05,545 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,546 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:05,546 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:05,548 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-1.c_Iteration1_Loop [2025-03-09 07:32:05,548 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:05,548 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:05,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,638 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:05,639 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:05,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:05,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 07:32:05,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:05,650 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:05,665 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:05,666 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:05,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-09 07:32:05,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:05,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 07:32:05,678 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:05,678 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:05,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:05,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:05,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 07:32:05,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:05,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:05,824 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:05,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 07:32:05,831 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:05,831 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:05,831 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:05,831 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:05,831 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:05,831 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,831 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:05,831 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:05,831 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-1.c_Iteration1_Loop [2025-03-09 07:32:05,831 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:05,831 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:05,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:05,889 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:05,892 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:05,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,896 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:05,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 07:32:05,900 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-03-09 07:32:05,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:05,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:05,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:05,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:05,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:05,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:05,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:05,921 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:05,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:05,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,930 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:05,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 07:32:05,933 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-03-09 07:32:05,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:05,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:05,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:05,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:05,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:05,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:05,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:05,949 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:05,955 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:05,957 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:05,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:05,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:05,960 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:05,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 07:32:05,962 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:05,962 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:05,962 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:05,962 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -2*f91_#in~x + 211 Supporting invariants [] [2025-03-09 07:32:05,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:05,970 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:05,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:06,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:06,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:06,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:06,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:06,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:32:06,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:06,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:06,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:06,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:06,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:06,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:32:06,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:06,093 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-03-09 07:32:06,094 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-03-09 07:32:06,163 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 35 states and 43 transitions. Complement of second has 16 states. [2025-03-09 07:32:06,165 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-03-09 07:32:06,167 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-03-09 07:32:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2025-03-09 07:32:06,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 3 letters. [2025-03-09 07:32:06,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:06,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 6 letters. Loop has 3 letters. [2025-03-09 07:32:06,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:06,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 6 letters. [2025-03-09 07:32:06,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:06,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2025-03-09 07:32:06,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:32:06,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 19 states and 25 transitions. [2025-03-09 07:32:06,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 07:32:06,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-09 07:32:06,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2025-03-09 07:32:06,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:06,182 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-09 07:32:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2025-03-09 07:32:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-03-09 07:32:06,199 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-03-09 07:32:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-03-09 07:32:06,200 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-09 07:32:06,201 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-03-09 07:32:06,201 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:32:06,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 21 transitions. [2025-03-09 07:32:06,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:32:06,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:06,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:06,202 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:06,202 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:06,202 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "call main_#t~ret7#1 := f91(main_~x~0#1);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" [2025-03-09 07:32:06,202 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" [2025-03-09 07:32:06,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:06,202 INFO L85 PathProgramCache]: Analyzing trace with hash 590804261, now seen corresponding path program 1 times [2025-03-09 07:32:06,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:06,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484440935] [2025-03-09 07:32:06,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:06,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:06,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:32:06,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:32:06,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:06,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:06,219 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:06,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:32:06,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:32:06,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:06,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:06,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:06,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:06,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1180657404, now seen corresponding path program 1 times [2025-03-09 07:32:06,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:06,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778699907] [2025-03-09 07:32:06,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:06,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:06,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:06,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:06,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:06,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:06,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:06,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:06,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:06,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:06,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:06,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:06,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1632490968, now seen corresponding path program 1 times [2025-03-09 07:32:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:06,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234571246] [2025-03-09 07:32:06,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:06,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:06,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 07:32:06,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 07:32:06,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:06,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:06,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:06,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:06,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 07:32:06,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 07:32:06,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:06,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:06,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:06,443 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:06,443 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:06,443 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:06,443 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:06,443 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:06,443 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,443 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:06,443 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:06,444 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-1.c_Iteration2_Loop [2025-03-09 07:32:06,444 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:06,444 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:06,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:06,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:06,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:06,488 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:06,488 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:06,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:06,490 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:06,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 07:32:06,493 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:06,493 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:06,504 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:06,504 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret5=0} Honda state: {f91_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:06,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-09 07:32:06,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:06,513 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:06,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 07:32:06,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:06,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:06,527 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:06,527 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:06,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:06,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:06,535 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:06,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 07:32:06,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:06,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:06,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:06,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:06,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:06,571 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:06,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 07:32:06,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:06,573 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:07,130 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:07,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 07:32:07,145 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:07,145 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:07,145 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:07,145 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:07,145 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:07,145 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:07,145 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:07,145 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:07,145 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-1.c_Iteration2_Loop [2025-03-09 07:32:07,145 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:07,145 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:07,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:07,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:07,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:07,196 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:07,196 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:07,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:07,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:07,202 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:07,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 07:32:07,205 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-03-09 07:32:07,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:07,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:07,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:07,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:07,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:07,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:07,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:07,219 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:07,221 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:07,221 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:07,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:07,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:07,223 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:07,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 07:32:07,226 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:07,226 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:07,226 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:07,226 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#t~ret4) = -2*f91_#t~ret4 + 201 Supporting invariants [] [2025-03-09 07:32:07,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:07,234 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:07,235 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #t~ret4 [2025-03-09 07:32:07,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:32:07,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:32:07,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:07,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:32:07,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:07,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:07,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:07,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:07,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:32:07,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:07,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:07,450 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-03-09 07:32:07,451 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-03-09 07:32:07,621 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-03-09 07:32:07,622 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-03-09 07:32:07,623 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-03-09 07:32:07,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2025-03-09 07:32:07,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 8 letters. [2025-03-09 07:32:07,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:07,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 8 letters. [2025-03-09 07:32:07,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:07,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 10 letters. Loop has 16 letters. [2025-03-09 07:32:07,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:07,624 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 73 transitions. [2025-03-09 07:32:07,629 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:32:07,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 42 states and 62 transitions. [2025-03-09 07:32:07,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-09 07:32:07,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-09 07:32:07,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 62 transitions. [2025-03-09 07:32:07,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:07,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 62 transitions. [2025-03-09 07:32:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 62 transitions. [2025-03-09 07:32:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2025-03-09 07:32:07,636 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-03-09 07:32:07,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2025-03-09 07:32:07,637 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 51 transitions. [2025-03-09 07:32:07,637 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2025-03-09 07:32:07,637 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:32:07,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 51 transitions. [2025-03-09 07:32:07,638 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2025-03-09 07:32:07,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:07,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:07,638 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:07,638 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 07:32:07,638 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "call main_#t~ret7#1 := f91(main_~x~0#1);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume !(~x > 100);" [2025-03-09 07:32:07,638 INFO L754 eck$LassoCheckResult]: Loop: "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume !(~x > 100);" [2025-03-09 07:32:07,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash -126218833, now seen corresponding path program 2 times [2025-03-09 07:32:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864304286] [2025-03-09 07:32:07,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-09 07:32:07,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:32:07,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:32:07,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:07,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:32:07,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:32:07,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:07,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash 52437, now seen corresponding path program 2 times [2025-03-09 07:32:07,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845183282] [2025-03-09 07:32:07,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:07,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:07,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:07,662 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:32:07,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,662 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:07,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:07,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:07,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:07,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:07,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:07,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:07,666 INFO L85 PathProgramCache]: Analyzing trace with hash -2088847257, now seen corresponding path program 3 times [2025-03-09 07:32:07,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:07,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586344339] [2025-03-09 07:32:07,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:32:07,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:07,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 4 equivalence classes. [2025-03-09 07:32:07,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:32:07,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 07:32:07,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 07:32:07,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:07,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586344339] [2025-03-09 07:32:07,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586344339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:32:07,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:32:07,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 07:32:07,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544745086] [2025-03-09 07:32:07,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:32:07,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:07,905 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:07,906 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:07,906 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:07,906 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:07,906 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:07,906 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:07,906 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:07,906 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:07,906 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-1.c_Iteration3_Loop [2025-03-09 07:32:07,906 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:07,906 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:07,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:07,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:07,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:07,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:07,948 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:07,949 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:07,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:07,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:07,951 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:07,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 07:32:07,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:07,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:07,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-09 07:32:07,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:07,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:07,984 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:07,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 07:32:07,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:07,987 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:08,305 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:08,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 07:32:08,315 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:08,315 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:08,315 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:08,315 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:08,315 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:08,315 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,315 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:08,315 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:08,315 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-1.c_Iteration3_Loop [2025-03-09 07:32:08,315 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:08,315 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:08,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:08,354 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:08,354 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:08,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:08,357 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:08,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 07:32:08,358 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-03-09 07:32:08,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:08,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:08,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:08,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:08,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:08,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:08,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:08,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:08,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:08,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:08,379 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:08,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 07:32:08,381 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-03-09 07:32:08,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:08,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:08,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:08,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:08,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:08,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:08,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:08,395 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:08,398 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:08,398 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:08,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:08,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:08,400 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:08,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 07:32:08,402 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:08,402 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:08,402 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:08,402 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_~x) = -2*f91_~x + 189 Supporting invariants [] [2025-03-09 07:32:08,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:08,409 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:08,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:08,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:32:08,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:32:08,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:08,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:08,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:08,528 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-03-09 07:32:08,528 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-03-09 07:32:08,574 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-03-09 07:32:08,575 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-03-09 07:32:08,576 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-03-09 07:32:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2025-03-09 07:32:08,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-09 07:32:08,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:08,576 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:08,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:08,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:32:08,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:32:08,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:08,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:08,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:08,672 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-03-09 07:32:08,673 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-03-09 07:32:08,718 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-03-09 07:32:08,718 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-03-09 07:32:08,718 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-03-09 07:32:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2025-03-09 07:32:08,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-09 07:32:08,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:08,719 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:08,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:08,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 07:32:08,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 07:32:08,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:32:08,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:32:08,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:08,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:32:08,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:08,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:08,814 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-03-09 07:32:08,814 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-03-09 07:32:08,868 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-03-09 07:32:08,869 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-03-09 07:32:08,869 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-03-09 07:32:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2025-03-09 07:32:08,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-09 07:32:08,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:08,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 16 letters. Loop has 3 letters. [2025-03-09 07:32:08,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:08,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-09 07:32:08,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:08,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 100 transitions. [2025-03-09 07:32:08,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2025-03-09 07:32:08,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 48 states and 74 transitions. [2025-03-09 07:32:08,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-09 07:32:08,874 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-09 07:32:08,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 74 transitions. [2025-03-09 07:32:08,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:08,875 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 74 transitions. [2025-03-09 07:32:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 74 transitions. [2025-03-09 07:32:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2025-03-09 07:32:08,877 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-03-09 07:32:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2025-03-09 07:32:08,878 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 60 transitions. [2025-03-09 07:32:08,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:08,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 07:32:08,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-09 07:32:08,881 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-03-09 07:32:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:08,958 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2025-03-09 07:32:08,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 82 transitions. [2025-03-09 07:32:08,959 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 07:32:08,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 58 states and 75 transitions. [2025-03-09 07:32:08,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2025-03-09 07:32:08,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-03-09 07:32:08,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 75 transitions. [2025-03-09 07:32:08,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:08,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 75 transitions. [2025-03-09 07:32:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 75 transitions. [2025-03-09 07:32:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-03-09 07:32:08,965 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-03-09 07:32:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2025-03-09 07:32:08,966 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 74 transitions. [2025-03-09 07:32:08,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 07:32:08,967 INFO L432 stractBuchiCegarLoop]: Abstraction has 57 states and 74 transitions. [2025-03-09 07:32:08,967 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:32:08,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 74 transitions. [2025-03-09 07:32:08,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2025-03-09 07:32:08,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:08,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:08,969 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 07:32:08,969 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 2, 2, 2, 2, 2, 1, 1] [2025-03-09 07:32:08,969 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "call main_#t~ret7#1 := f91(main_~x~0#1);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#22#return;" "#res := #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< [2025-03-09 07:32:08,969 INFO L754 eck$LassoCheckResult]: Loop: "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#22#return;" "#res := #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< [2025-03-09 07:32:08,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:08,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1368746910, now seen corresponding path program 1 times [2025-03-09 07:32:08,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:08,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743434514] [2025-03-09 07:32:08,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:08,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:08,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:08,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:08,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:08,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:08,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:08,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:08,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:08,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:08,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:08,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:08,996 INFO L85 PathProgramCache]: Analyzing trace with hash -77812524, now seen corresponding path program 1 times [2025-03-09 07:32:08,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:08,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137063720] [2025-03-09 07:32:08,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:32:08,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:08,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:32:09,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:32:09,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:09,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:09,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:09,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:32:09,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:32:09,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:09,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:09,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:09,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:09,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1527524653, now seen corresponding path program 2 times [2025-03-09 07:32:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:09,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771729258] [2025-03-09 07:32:09,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:09,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:09,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-09 07:32:09,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:32:09,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:32:09,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:09,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 07:32:09,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:32:09,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771729258] [2025-03-09 07:32:09,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771729258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:32:09,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621374742] [2025-03-09 07:32:09,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:09,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:32:09,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,150 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:32:09,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 07:32:09,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-09 07:32:09,187 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:32:09,187 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:32:09,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:09,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:32:09,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 07:32:09,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:32:09,414 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 31 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-09 07:32:09,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621374742] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:32:09,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:32:09,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-03-09 07:32:09,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223725029] [2025-03-09 07:32:09,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:32:09,548 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:09,548 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:09,548 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:09,548 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:09,548 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:09,548 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,548 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:09,548 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:09,549 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-1.c_Iteration4_Loop [2025-03-09 07:32:09,549 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:09,549 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:09,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,580 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:09,580 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:09,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,582 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:09,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 07:32:09,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:09,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:09,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:09,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,610 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:09,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 07:32:09,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:09,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:09,625 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:09,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:09,632 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:09,632 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:09,632 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:09,632 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:09,632 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:09,632 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,632 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:09,632 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:09,632 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-1.c_Iteration4_Loop [2025-03-09 07:32:09,632 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:09,632 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:09,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:09,663 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:09,664 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:09,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,667 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:09,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 07:32:09,668 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-03-09 07:32:09,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:09,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:09,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:09,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:09,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:09,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:09,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:09,681 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:09,682 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:09,682 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:09,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:09,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:09,686 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:09,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-09 07:32:09,688 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:09,688 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:09,688 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:09,688 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -1*f91_#in~x + 90 Supporting invariants [] [2025-03-09 07:32:09,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-09 07:32:09,694 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:09,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:09,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:09,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:09,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:09,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:09,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 07:32:09,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:09,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 07:32:09,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:32:09,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:32:09,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:09,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:09,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:32:09,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:10,015 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 07:32:10,016 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2025-03-09 07:32:10,017 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-03-09 07:32:10,286 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-03-09 07:32:10,287 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-03-09 07:32:10,287 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-03-09 07:32:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2025-03-09 07:32:10,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 35 transitions. Stem has 22 letters. Loop has 19 letters. [2025-03-09 07:32:10,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:10,288 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:10,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:10,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:10,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:10,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:10,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 07:32:10,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:10,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:32:10,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:32:10,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:10,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:32:10,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 07:32:10,608 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-03-09 07:32:10,608 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-03-09 07:32:10,841 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-03-09 07:32:10,843 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-03-09 07:32:10,844 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-03-09 07:32:10,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2025-03-09 07:32:10,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 35 transitions. Stem has 22 letters. Loop has 19 letters. [2025-03-09 07:32:10,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:10,846 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:10,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:10,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:32:10,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:32:10,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:10,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-09 07:32:10,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:10,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:32:10,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:32:10,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:10,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:10,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:32:10,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 07:32:11,121 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-03-09 07:32:11,121 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-03-09 07:32:11,557 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-03-09 07:32:11,557 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-03-09 07:32:11,558 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-03-09 07:32:11,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 50 transitions. [2025-03-09 07:32:11,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 50 transitions. Stem has 22 letters. Loop has 19 letters. [2025-03-09 07:32:11,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:11,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 50 transitions. Stem has 41 letters. Loop has 19 letters. [2025-03-09 07:32:11,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:11,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 50 transitions. Stem has 22 letters. Loop has 38 letters. [2025-03-09 07:32:11,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:11,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 325 states and 417 transitions. [2025-03-09 07:32:11,566 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2025-03-09 07:32:11,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 325 states to 169 states and 230 transitions. [2025-03-09 07:32:11,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2025-03-09 07:32:11,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2025-03-09 07:32:11,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 230 transitions. [2025-03-09 07:32:11,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:11,570 INFO L218 hiAutomatonCegarLoop]: Abstraction has 169 states and 230 transitions. [2025-03-09 07:32:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 230 transitions. [2025-03-09 07:32:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 140. [2025-03-09 07:32:11,576 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-03-09 07:32:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 178 transitions. [2025-03-09 07:32:11,580 INFO L240 hiAutomatonCegarLoop]: Abstraction has 140 states and 178 transitions. [2025-03-09 07:32:11,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:32:11,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 07:32:11,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-03-09 07:32:11,581 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-03-09 07:32:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:32:11,714 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2025-03-09 07:32:11,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 163 transitions. [2025-03-09 07:32:11,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:32:11,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 101 states and 121 transitions. [2025-03-09 07:32:11,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2025-03-09 07:32:11,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-03-09 07:32:11,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 121 transitions. [2025-03-09 07:32:11,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:32:11,723 INFO L218 hiAutomatonCegarLoop]: Abstraction has 101 states and 121 transitions. [2025-03-09 07:32:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 121 transitions. [2025-03-09 07:32:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2025-03-09 07:32:11,729 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-03-09 07:32:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2025-03-09 07:32:11,729 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97 states and 117 transitions. [2025-03-09 07:32:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 07:32:11,732 INFO L432 stractBuchiCegarLoop]: Abstraction has 97 states and 117 transitions. [2025-03-09 07:32:11,733 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:32:11,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 117 transitions. [2025-03-09 07:32:11,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-09 07:32:11,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:32:11,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:32:11,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-09 07:32:11,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-09 07:32:11,739 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;havoc main_#t~nondet6#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;" "call main_#t~ret7#1 := f91(main_~x~0#1);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#22#return;" "#res := #t~ret5;havoc #t~ret4;havoc #t~ret5;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< [2025-03-09 07:32:11,739 INFO L754 eck$LassoCheckResult]: Loop: "~x := #in~x;" "assume !(~x > 100);" "call #t~ret4 := f91(11 + ~x);"< "~x := #in~x;" "assume ~x > 100;#res := ~x - 10;" "assume true;" >"#24#return;" "call #t~ret5 := f91(#t~ret4);"< [2025-03-09 07:32:11,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1550656996, now seen corresponding path program 3 times [2025-03-09 07:32:11,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:11,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453787483] [2025-03-09 07:32:11,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:32:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:11,742 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 7 equivalence classes. [2025-03-09 07:32:11,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 07:32:11,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-09 07:32:11,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:11,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 07:32:11,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 07:32:11,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:11,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:11,760 INFO L85 PathProgramCache]: Analyzing trace with hash -254776738, now seen corresponding path program 2 times [2025-03-09 07:32:11,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:11,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009514664] [2025-03-09 07:32:11,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:32:11,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:11,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-03-09 07:32:11,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:11,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:32:11,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:11,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:11,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:11,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:11,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:11,765 INFO L85 PathProgramCache]: Analyzing trace with hash -870254215, now seen corresponding path program 4 times [2025-03-09 07:32:11,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:32:11,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343513617] [2025-03-09 07:32:11,766 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:32:11,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:32:11,768 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 46 statements into 2 equivalence classes. [2025-03-09 07:32:11,772 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 07:32:11,772 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:32:11,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:32:11,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 07:32:11,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 07:32:11,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:11,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:32:11,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:32:11,832 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:11,832 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:11,832 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:11,832 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:11,832 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:32:11,832 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,832 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:11,832 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:11,832 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-1.c_Iteration5_Loop [2025-03-09 07:32:11,832 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:11,833 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:11,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,859 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:11,859 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:32:11,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,861 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 07:32:11,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:11,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:11,873 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:11,873 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#res=0} Honda state: {f91_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:11,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-09 07:32:11,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,880 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 07:32:11,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:11,883 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:11,893 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:32:11,893 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {f91_#t~ret4=0} Honda state: {f91_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-09 07:32:11,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-09 07:32:11,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,901 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 07:32:11,905 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:32:11,905 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:11,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 07:32:11,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,922 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 07:32:11,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:32:11,924 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:32:11,935 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:32:11,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 07:32:11,940 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:32:11,940 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:32:11,940 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:32:11,940 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:32:11,940 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:32:11,940 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,940 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:32:11,940 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:32:11,940 INFO L132 ssoRankerPreferences]: Filename of dumped script: McCarthy91-1.c_Iteration5_Loop [2025-03-09 07:32:11,940 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:32:11,940 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:32:11,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:32:11,969 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:32:11,969 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:32:11,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,971 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 07:32:11,973 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-03-09 07:32:11,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:11,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:11,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:11,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:11,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:11,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:11,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:11,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:11,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 07:32:11,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:11,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:11,991 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:11,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 07:32:11,993 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-03-09 07:32:12,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:12,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:12,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:12,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:12,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:12,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:12,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:12,004 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:32:12,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 07:32:12,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,011 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 07:32:12,013 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-03-09 07:32:12,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:32:12,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:32:12,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:32:12,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:32:12,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:32:12,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:32:12,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:32:12,025 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:32:12,027 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:32:12,027 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:32:12,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:32:12,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:32:12,028 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:32:12,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 07:32:12,030 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:32:12,030 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:32:12,030 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:32:12,030 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(f91_#in~x) = -2*f91_#in~x + 201 Supporting invariants [] [2025-03-09 07:32:12,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:12,036 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:32:12,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:12,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 07:32:12,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 07:32:12,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 07:32:12,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:12,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:32:12,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:12,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:12,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:12,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:12,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:32:12,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:12,315 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-03-09 07:32:12,316 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-03-09 07:32:12,386 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-03-09 07:32:12,388 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-03-09 07:32:12,388 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-03-09 07:32:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2025-03-09 07:32:12,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 38 letters. Loop has 8 letters. [2025-03-09 07:32:12,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:12,389 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:12,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:12,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 07:32:12,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 07:32:12,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:12,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:32:12,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:12,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:12,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:12,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:12,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:32:12,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:12,658 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-03-09 07:32:12,658 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-03-09 07:32:12,782 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-03-09 07:32:12,784 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-03-09 07:32:12,784 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-03-09 07:32:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2025-03-09 07:32:12,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 38 letters. Loop has 8 letters. [2025-03-09 07:32:12,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:12,786 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:12,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:12,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 07:32:12,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 07:32:12,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:12,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:32:12,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:12,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:12,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:12,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:12,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:12,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:32:12,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:13,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:13,049 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-03-09 07:32:13,049 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-03-09 07:32:13,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 147 states and 167 transitions. Complement of second has 17 states. [2025-03-09 07:32:13,128 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-03-09 07:32:13,129 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-03-09 07:32:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-03-09 07:32:13,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 38 letters. Loop has 8 letters. [2025-03-09 07:32:13,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:13,129 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:32:13,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:32:13,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 07:32:13,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 07:32:13,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:13,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:13,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:32:13,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:13,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 07:32:13,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 07:32:13,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:32:13,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:32:13,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:32:13,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:32:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:32:13,391 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-03-09 07:32:13,391 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-03-09 07:32:13,623 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-03-09 07:32:13,623 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-03-09 07:32:13,624 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-03-09 07:32:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2025-03-09 07:32:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 38 letters. Loop has 8 letters. [2025-03-09 07:32:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 46 letters. Loop has 8 letters. [2025-03-09 07:32:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 27 transitions. Stem has 38 letters. Loop has 16 letters. [2025-03-09 07:32:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:32:13,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 209 transitions. [2025-03-09 07:32:13,627 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:32:13,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 0 states and 0 transitions. [2025-03-09 07:32:13,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 07:32:13,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 07:32:13,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 07:32:13,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:32:13,627 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:32:13,627 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:32:13,627 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:32:13,627 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 07:32:13,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 07:32:13,628 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:32:13,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 07:32:13,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:32:13 BoogieIcfgContainer [2025-03-09 07:32:13,633 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:32:13,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:32:13,634 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:32:13,634 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:32:13,635 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:32:05" (3/4) ... [2025-03-09 07:32:13,636 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 07:32:13,637 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:32:13,637 INFO L158 Benchmark]: Toolchain (without parser) took 8759.33ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 106.3MB in the beginning and 196.1MB in the end (delta: -89.8MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2025-03-09 07:32:13,637 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:32:13,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.79ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 96.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:32:13,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.94ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 95.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:32:13,638 INFO L158 Benchmark]: Boogie Preprocessor took 27.43ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 93.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:32:13,638 INFO L158 Benchmark]: IcfgBuilder took 168.98ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 84.0MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 07:32:13,638 INFO L158 Benchmark]: BuchiAutomizer took 8388.36ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 84.0MB in the beginning and 196.2MB in the end (delta: -112.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2025-03-09 07:32:13,639 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 293.6MB. Free memory was 196.2MB in the beginning and 196.1MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:32:13,639 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.79ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 96.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.94ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 95.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.43ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 93.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 168.98ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 84.0MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 8388.36ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 84.0MB in the beginning and 196.2MB in the end (delta: -112.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 293.6MB. Free memory was 196.2MB in the beginning and 196.1MB in the end (delta: 41.6kB). 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~ret4 * 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 long) -2 * \old(x))) 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 long) -2 * x) + 189) and consists of 6 locations. One nondeterministic module has affine ranking function (((long long) -1 * \old(x)) + 90) and consists of 19 locations. One nondeterministic module has affine ranking function (((long long) -2 * \old(x)) + 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 8.3s and 6 iterations. TraceHistogramMax:8. Analysis of lassos took 3.4s. Construction of modules took 0.5s. Büchi inclusion checks took 4.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s 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, 262 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 426 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 240 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 897 IncrementalHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 186 mSDtfsCounter, 897 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: unsat Degree: 0 Time: 28ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 07:32:13,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-09 07:32:13,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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