./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 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/bitvector/soft_float_4-2a.c.cil.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 20:03:01,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 20:03:01,977 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-17 20:03:01,981 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 20:03:01,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 20:03:01,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 20:03:02,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 20:03:02,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 20:03:02,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 20:03:02,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 20:03:02,007 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 20:03:02,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 20:03:02,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 20:03:02,007 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 20:03:02,007 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 20:03:02,008 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 20:03:02,008 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 20:03:02,008 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 20:03:02,008 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 20:03:02,008 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 20:03:02,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 20:03:02,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 20:03:02,008 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 20:03:02,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 20:03:02,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 20:03:02,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 20:03:02,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 20:03:02,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 20:03:02,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 20:03:02,009 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 20:03:02,009 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 20:03:02,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 20:03:02,009 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 20:03:02,009 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 20:03:02,009 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 20:03:02,010 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 20:03:02,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 20:03:02,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 20:03:02,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 20:03:02,010 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 20:03:02,010 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2025-03-17 20:03:02,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 20:03:02,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 20:03:02,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 20:03:02,243 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 20:03:02,243 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 20:03:02,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-03-17 20:03:03,396 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e68ece1/45362f1ae1864a2ba2218f4e3a983b6c/FLAG99d17cb17 [2025-03-17 20:03:03,680 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 20:03:03,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-03-17 20:03:03,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e68ece1/45362f1ae1864a2ba2218f4e3a983b6c/FLAG99d17cb17 [2025-03-17 20:03:03,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71e68ece1/45362f1ae1864a2ba2218f4e3a983b6c [2025-03-17 20:03:03,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 20:03:03,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 20:03:03,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 20:03:03,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 20:03:03,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 20:03:03,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:03,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8353d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03, skipping insertion in model container [2025-03-17 20:03:03,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:03,733 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 20:03:03,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:03:03,887 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 20:03:03,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 20:03:03,938 INFO L204 MainTranslator]: Completed translation [2025-03-17 20:03:03,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03 WrapperNode [2025-03-17 20:03:03,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 20:03:03,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 20:03:03,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 20:03:03,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 20:03:03,946 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:03,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:03,981 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 407 [2025-03-17 20:03:03,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 20:03:03,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 20:03:03,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 20:03:03,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 20:03:03,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:03,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:03,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:04,015 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-17 20:03:04,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:04,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:04,022 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:04,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:04,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:04,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:04,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 20:03:04,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 20:03:04,026 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 20:03:04,026 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 20:03:04,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (1/1) ... [2025-03-17 20:03:04,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:04,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:04,059 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-17 20:03:04,062 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-17 20:03:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 20:03:04,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 20:03:04,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 20:03:04,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 20:03:04,135 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 20:03:04,136 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 20:03:04,624 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-03-17 20:03:04,624 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 20:03:04,645 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 20:03:04,646 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 20:03:04,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:03:04 BoogieIcfgContainer [2025-03-17 20:03:04,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 20:03:04,647 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 20:03:04,647 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 20:03:04,650 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 20:03:04,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:03:04,651 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 08:03:03" (1/3) ... [2025-03-17 20:03:04,652 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ed5e754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:03:04, skipping insertion in model container [2025-03-17 20:03:04,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:03:04,652 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 08:03:03" (2/3) ... [2025-03-17 20:03:04,652 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ed5e754 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 08:03:04, skipping insertion in model container [2025-03-17 20:03:04,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 20:03:04,652 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:03:04" (3/3) ... [2025-03-17 20:03:04,653 INFO L363 chiAutomizerObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2025-03-17 20:03:04,688 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 20:03:04,688 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 20:03:04,688 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 20:03:04,688 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 20:03:04,689 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 20:03:04,689 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 20:03:04,689 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 20:03:04,690 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 20:03:04,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 113 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:04,711 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-03-17 20:03:04,713 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:04,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:04,717 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:03:04,717 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:04,717 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 20:03:04,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 113 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:04,725 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-03-17 20:03:04,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:04,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:04,727 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-17 20:03:04,727 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:04,732 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(24, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:04,732 INFO L754 eck$LassoCheckResult]: Loop: "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:04,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:04,737 INFO L85 PathProgramCache]: Analyzing trace with hash 273040, now seen corresponding path program 1 times [2025-03-17 20:03:04,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:04,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573534154] [2025-03-17 20:03:04,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:04,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:04,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:03:04,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:03:04,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:04,921 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-17 20:03:04,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 20:03:04,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573534154] [2025-03-17 20:03:04,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573534154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 20:03:04,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 20:03:04,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 20:03:04,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806318306] [2025-03-17 20:03:04,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 20:03:04,927 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 20:03:04,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:04,929 INFO L85 PathProgramCache]: Analyzing trace with hash 8283, now seen corresponding path program 1 times [2025-03-17 20:03:04,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:04,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473462079] [2025-03-17 20:03:04,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:04,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:04,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:04,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:04,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:04,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:04,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:04,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:04,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:04,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:05,015 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:05,015 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:05,016 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:05,016 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:05,016 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:05,016 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,016 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:05,016 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:05,016 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration1_Loop [2025-03-17 20:03:05,016 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:05,016 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:05,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,149 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:05,149 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:05,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,152 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-17 20:03:05,154 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-17 20:03:05,155 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:05,155 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:05,173 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:05,173 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m#1=0} Honda state: {ULTIMATE.start_base2flt_~m#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:05,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:05,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,179 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-17 20:03:05,181 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-17 20:03:05,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:05,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:05,198 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-17 20:03:05,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,200 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-17 20:03:05,201 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-17 20:03:05,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:05,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:05,225 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:05,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:05,230 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:05,230 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:05,230 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:05,230 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:05,230 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:05,230 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,230 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:05,230 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:05,230 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration1_Loop [2025-03-17 20:03:05,230 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:05,230 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:05,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,327 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:05,329 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:05,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,333 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-17 20:03:05,335 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-17 20:03:05,337 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-17 20:03:05,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:05,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:05,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:05,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:05,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:05,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:05,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:05,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:05,364 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-17 20:03:05,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,368 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-17 20:03:05,370 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-17 20:03:05,370 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-17 20:03:05,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:05,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:05,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:05,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:05,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:05,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:05,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:05,384 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:05,390 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:05,392 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:05,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,395 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-17 20:03:05,396 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-17 20:03:05,396 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:05,396 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:05,396 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:05,396 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2025-03-17 20:03:05,402 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-17 20:03:05,404 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:05,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:05,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 20:03:05,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 20:03:05,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:05,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:05,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:05,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:05,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:05,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:05,453 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:05,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:05,479 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-17 20:03:05,498 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:03:05,500 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 114 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 113 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,609 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 114 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 113 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 352 states and 561 transitions. Complement of second has 6 states. [2025-03-17 20:03:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:05,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 366 transitions. [2025-03-17 20:03:05,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 366 transitions. Stem has 3 letters. Loop has 2 letters. [2025-03-17 20:03:05,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:05,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 366 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-17 20:03:05,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:05,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 366 transitions. Stem has 3 letters. Loop has 4 letters. [2025-03-17 20:03:05,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:05,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 352 states and 561 transitions. [2025-03-17 20:03:05,634 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 18 [2025-03-17 20:03:05,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 352 states to 70 states and 109 transitions. [2025-03-17 20:03:05,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2025-03-17 20:03:05,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2025-03-17 20:03:05,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 109 transitions. [2025-03-17 20:03:05,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:05,640 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 109 transitions. [2025-03-17 20:03:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 109 transitions. [2025-03-17 20:03:05,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2025-03-17 20:03:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 53 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 88 transitions. [2025-03-17 20:03:05,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 88 transitions. [2025-03-17 20:03:05,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 20:03:05,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 20:03:05,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 20:03:05,661 INFO L87 Difference]: Start difference. First operand 54 states and 88 transitions. Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 20:03:05,697 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2025-03-17 20:03:05,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. [2025-03-17 20:03:05,698 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-03-17 20:03:05,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 35 transitions. [2025-03-17 20:03:05,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-17 20:03:05,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-17 20:03:05,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 35 transitions. [2025-03-17 20:03:05,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:03:05,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-03-17 20:03:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 35 transitions. [2025-03-17 20:03:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-17 20:03:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:05,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2025-03-17 20:03:05,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-03-17 20:03:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 20:03:05,701 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2025-03-17 20:03:05,701 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 20:03:05,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2025-03-17 20:03:05,701 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-03-17 20:03:05,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:05,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:05,702 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:03:05,702 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:05,702 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(24, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:05,702 INFO L754 eck$LassoCheckResult]: Loop: "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:05,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:05,702 INFO L85 PathProgramCache]: Analyzing trace with hash 262336524, now seen corresponding path program 1 times [2025-03-17 20:03:05,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:05,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656488265] [2025-03-17 20:03:05,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:05,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:05,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:05,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:05,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:05,716 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:05,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:05,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:05,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:05,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:05,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:05,728 INFO L85 PathProgramCache]: Analyzing trace with hash 7067, now seen corresponding path program 1 times [2025-03-17 20:03:05,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:05,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141179871] [2025-03-17 20:03:05,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:05,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:05,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:05,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:05,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:05,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:05,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:05,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:05,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:05,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:05,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:05,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1297664794, now seen corresponding path program 1 times [2025-03-17 20:03:05,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:05,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849235630] [2025-03-17 20:03:05,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:05,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:05,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:05,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:05,751 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:05,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:05,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:05,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:05,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:05,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:05,799 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:05,799 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:05,799 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:05,799 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:05,799 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:05,799 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,799 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:05,799 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:05,799 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration2_Loop [2025-03-17 20:03:05,799 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:05,799 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:05,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,804 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,895 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:05,895 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:05,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,897 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-17 20:03:05,899 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-17 20:03:05,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:05,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:05,918 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-17 20:03:05,918 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m#1=0} Honda state: {ULTIMATE.start_base2flt_~m#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-17 20:03:05,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:05,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,925 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-17 20:03:05,926 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-17 20:03:05,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:05,927 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:05,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 20:03:05,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:05,945 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-17 20:03:05,947 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-17 20:03:05,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:05,948 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:05,969 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:05,974 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-17 20:03:05,974 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:05,974 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:05,974 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:05,974 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:05,974 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:05,974 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:05,974 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:05,974 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:05,974 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration2_Loop [2025-03-17 20:03:05,974 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:05,974 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:05,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:05,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 20:03:06,081 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:06,081 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:06,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,083 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-17 20:03:06,084 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-17 20:03:06,085 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-17 20:03:06,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:06,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:06,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:06,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:06,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:06,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:06,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:06,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:06,107 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-17 20:03:06,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,109 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-17 20:03:06,110 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-17 20:03:06,111 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-17 20:03:06,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:06,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:06,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:06,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:06,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:06,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:06,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:06,125 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:06,126 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:06,127 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:06,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,129 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-17 20:03:06,130 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-17 20:03:06,131 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:06,131 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:06,131 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:06,132 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2025-03-17 20:03:06,138 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-17 20:03:06,139 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:06,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:06,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:06,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:06,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:06,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:06,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:06,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:06,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:06,179 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:06,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:06,193 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-17 20:03:06,194 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:03:06,194 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,222 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 35 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 49 states and 68 transitions. Complement of second has 5 states. [2025-03-17 20:03:06,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-17 20:03:06,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-17 20:03:06,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:06,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-17 20:03:06,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:06,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 20:03:06,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:06,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 68 transitions. [2025-03-17 20:03:06,226 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-03-17 20:03:06,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 42 states and 59 transitions. [2025-03-17 20:03:06,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-17 20:03:06,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-03-17 20:03:06,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 59 transitions. [2025-03-17 20:03:06,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:06,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 59 transitions. [2025-03-17 20:03:06,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 59 transitions. [2025-03-17 20:03:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2025-03-17 20:03:06,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2025-03-17 20:03:06,232 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 38 transitions. [2025-03-17 20:03:06,232 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 38 transitions. [2025-03-17 20:03:06,232 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 20:03:06,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 38 transitions. [2025-03-17 20:03:06,233 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-17 20:03:06,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:06,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:06,234 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-03-17 20:03:06,234 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:06,235 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(24, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" [2025-03-17 20:03:06,235 INFO L754 eck$LassoCheckResult]: Loop: "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2;" [2025-03-17 20:03:06,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash 262336525, now seen corresponding path program 1 times [2025-03-17 20:03:06,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:06,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499554618] [2025-03-17 20:03:06,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:06,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:06,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:06,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:06,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:06,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:06,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:06,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:06,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash 7327, now seen corresponding path program 1 times [2025-03-17 20:03:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625088690] [2025-03-17 20:03:06,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:06,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:06,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:06,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,271 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:06,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:06,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:06,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:06,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1297663573, now seen corresponding path program 1 times [2025-03-17 20:03:06,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:06,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865118993] [2025-03-17 20:03:06,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:06,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:06,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:06,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:06,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,290 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:06,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:06,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:06,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:06,318 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:06,318 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:06,318 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:06,318 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:06,318 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:06,318 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,318 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:06,318 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:06,318 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration3_Loop [2025-03-17 20:03:06,318 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:06,318 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:06,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,400 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:06,401 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:06,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,406 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-17 20:03:06,407 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-17 20:03:06,408 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:06,408 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:06,424 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-17 20:03:06,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,426 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-17 20:03:06,427 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-17 20:03:06,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:06,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:06,450 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:06,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:06,454 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:06,454 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:06,454 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:06,454 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:06,454 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:06,454 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,454 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:06,454 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:06,454 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration3_Loop [2025-03-17 20:03:06,454 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:06,454 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:06,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,524 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:06,524 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:06,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,526 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-17 20:03:06,527 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-17 20:03:06,528 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-17 20:03:06,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:06,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:06,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:06,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:06,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:06,539 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:06,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:06,541 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:06,543 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:06,543 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:06,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,550 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-17 20:03:06,552 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-17 20:03:06,552 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:06,552 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:06,553 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:06,553 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2025-03-17 20:03:06,560 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-17 20:03:06,561 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:06,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 20:03:06,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 20:03:06,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:06,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:06,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:06,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:06,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:06,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:06,594 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:06,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:06,597 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-17 20:03:06,597 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:03:06,597 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 38 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,624 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 38 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 50 states and 72 transitions. Complement of second has 5 states. [2025-03-17 20:03:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-03-17 20:03:06,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 5 letters. Loop has 2 letters. [2025-03-17 20:03:06,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:06,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-17 20:03:06,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:06,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 5 letters. Loop has 4 letters. [2025-03-17 20:03:06,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:06,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 72 transitions. [2025-03-17 20:03:06,626 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-03-17 20:03:06,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 43 states and 62 transitions. [2025-03-17 20:03:06,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-03-17 20:03:06,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-03-17 20:03:06,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 62 transitions. [2025-03-17 20:03:06,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:06,627 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 62 transitions. [2025-03-17 20:03:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 62 transitions. [2025-03-17 20:03:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2025-03-17 20:03:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.5) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2025-03-17 20:03:06,628 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2025-03-17 20:03:06,628 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2025-03-17 20:03:06,628 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 20:03:06,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2025-03-17 20:03:06,628 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-17 20:03:06,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:06,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:06,628 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:06,628 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:06,628 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(24, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret21#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:06,628 INFO L754 eck$LassoCheckResult]: Loop: "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-17 20:03:06,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1297727032, now seen corresponding path program 1 times [2025-03-17 20:03:06,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:06,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515422742] [2025-03-17 20:03:06,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:06,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:06,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:06,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:06,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,636 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:06,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:06,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:06,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:06,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,642 INFO L85 PathProgramCache]: Analyzing trace with hash 5851, now seen corresponding path program 1 times [2025-03-17 20:03:06,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:06,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117951224] [2025-03-17 20:03:06,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:06,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:06,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:06,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:06,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,644 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:06,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:06,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:06,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:06,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1575157022, now seen corresponding path program 1 times [2025-03-17 20:03:06,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:06,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970684000] [2025-03-17 20:03:06,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:06,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:06,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:06,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:06,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,662 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:06,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:06,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:06,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:06,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:06,702 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:06,702 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:06,702 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:06,708 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:06,708 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:06,708 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,708 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:06,708 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:06,709 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration4_Loop [2025-03-17 20:03:06,709 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:06,709 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:06,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,790 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:06,790 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:06,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,792 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-17 20:03:06,792 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-17 20:03:06,793 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:06,793 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:06,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-17 20:03:06,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,810 INFO L229 MonitoredProcess]: Starting monitored process 19 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-17 20:03:06,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 20:03:06,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:06,813 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:06,834 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:06,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:06,839 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:06,839 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:06,839 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:06,839 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:06,839 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:06,839 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,839 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:06,839 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:06,839 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration4_Loop [2025-03-17 20:03:06,839 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:06,839 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:06,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:06,925 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:06,925 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:06,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,929 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-17 20:03:06,930 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-17 20:03:06,931 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-17 20:03:06,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:06,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:06,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:06,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:06,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:06,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:06,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:06,945 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:06,948 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:06,948 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:06,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:06,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:06,950 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-17 20:03:06,951 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-17 20:03:06,952 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:06,952 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:06,952 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:06,953 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2025-03-17 20:03:06,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 20:03:06,961 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:06,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:06,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:06,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:06,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:06,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:06,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:06,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:07,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:07,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:07,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:07,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:07,002 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:07,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:07,015 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-17 20:03:07,016 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 20:03:07,016 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 18 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:07,025 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 42 transitions. cyclomatic complexity: 18. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 44 transitions. Complement of second has 4 states. [2025-03-17 20:03:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-03-17 20:03:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-17 20:03:07,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-17 20:03:07,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:07,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-17 20:03:07,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:07,028 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 44 transitions. [2025-03-17 20:03:07,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:03:07,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 26 states and 39 transitions. [2025-03-17 20:03:07,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-03-17 20:03:07,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-03-17 20:03:07,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 39 transitions. [2025-03-17 20:03:07,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 20:03:07,029 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 39 transitions. [2025-03-17 20:03:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 39 transitions. [2025-03-17 20:03:07,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-17 20:03:07,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:07,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 39 transitions. [2025-03-17 20:03:07,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 39 transitions. [2025-03-17 20:03:07,032 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 39 transitions. [2025-03-17 20:03:07,032 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 20:03:07,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 39 transitions. [2025-03-17 20:03:07,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-17 20:03:07,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 20:03:07,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 20:03:07,052 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 20:03:07,052 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 20:03:07,052 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(24, 2);call #Ultimate.allocInit(12, 3);assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;main_#t~ret21#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" [2025-03-17 20:03:07,052 INFO L754 eck$LassoCheckResult]: Loop: "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2;" [2025-03-17 20:03:07,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:07,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1297727031, now seen corresponding path program 1 times [2025-03-17 20:03:07,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:07,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966915461] [2025-03-17 20:03:07,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:07,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:07,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:07,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-17 20:03:07,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:07,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:07,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:07,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:07,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:07,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-17 20:03:07,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:07,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:07,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:07,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:07,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash 6111, now seen corresponding path program 1 times [2025-03-17 20:03:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:07,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640305340] [2025-03-17 20:03:07,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:07,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:07,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:07,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:07,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 20:03:07,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:07,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:07,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:07,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:07,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:07,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:07,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:07,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:07,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:07,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1575155801, now seen corresponding path program 1 times [2025-03-17 20:03:07,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 20:03:07,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850084807] [2025-03-17 20:03:07,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 20:03:07,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 20:03:07,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:07,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:07,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:07,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:07,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 20:03:07,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 20:03:07,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 20:03:07,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:07,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 20:03:07,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 20:03:07,122 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:07,122 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:07,122 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:07,122 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:07,122 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-17 20:03:07,122 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:07,122 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:07,122 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:07,122 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration5_Loop [2025-03-17 20:03:07,122 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:07,122 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:07,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:07,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:07,186 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:07,187 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-17 20:03:07,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:07,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:07,189 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-17 20:03:07,190 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-17 20:03:07,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-17 20:03:07,191 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:07,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:07,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:07,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:07,211 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-17 20:03:07,212 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-17 20:03:07,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-17 20:03:07,213 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-17 20:03:07,230 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-17 20:03:07,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:07,235 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 20:03:07,235 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 20:03:07,235 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 20:03:07,235 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 20:03:07,235 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 20:03:07,235 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:07,235 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 20:03:07,235 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 20:03:07,235 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration5_Loop [2025-03-17 20:03:07,235 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 20:03:07,235 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 20:03:07,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:07,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 20:03:07,299 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 20:03:07,299 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 20:03:07,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:07,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:07,302 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-17 20:03:07,303 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-17 20:03:07,304 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-17 20:03:07,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:07,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:07,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:07,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:07,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:07,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:07,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:07,318 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 20:03:07,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:07,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:07,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:07,325 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-17 20:03:07,327 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-17 20:03:07,328 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-17 20:03:07,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 20:03:07,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 20:03:07,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 20:03:07,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 20:03:07,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 20:03:07,338 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 20:03:07,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 20:03:07,340 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 20:03:07,342 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-17 20:03:07,342 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-17 20:03:07,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 20:03:07,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 20:03:07,343 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-17 20:03:07,345 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-17 20:03:07,345 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 20:03:07,346 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-17 20:03:07,346 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 20:03:07,346 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2025-03-17 20:03:07,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-17 20:03:07,352 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-17 20:03:07,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 20:03:07,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 20:03:07,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 20:03:07,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:07,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:07,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 20:03:07,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:07,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 20:03:07,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 20:03:07,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 20:03:07,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 20:03:07,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 20:03:07,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 20:03:07,393 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-17 20:03:07,393 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-17 20:03:07,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 39 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:07,403 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 39 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 28 states and 42 transitions. Complement of second has 4 states. [2025-03-17 20:03:07,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 20:03:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 20:03:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2025-03-17 20:03:07,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-17 20:03:07,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:07,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-17 20:03:07,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:07,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-17 20:03:07,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 20:03:07,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 42 transitions. [2025-03-17 20:03:07,405 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:03:07,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2025-03-17 20:03:07,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 20:03:07,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 20:03:07,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 20:03:07,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 20:03:07,405 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:03:07,405 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:03:07,405 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 20:03:07,405 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 20:03:07,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 20:03:07,405 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 20:03:07,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 20:03:07,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 08:03:07 BoogieIcfgContainer [2025-03-17 20:03:07,412 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 20:03:07,412 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 20:03:07,412 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 20:03:07,413 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 20:03:07,413 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 08:03:04" (3/4) ... [2025-03-17 20:03:07,414 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 20:03:07,415 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 20:03:07,415 INFO L158 Benchmark]: Toolchain (without parser) took 3703.10ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 79.8MB in the end (delta: 31.8MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2025-03-17 20:03:07,415 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:07,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.56ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 98.4MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 20:03:07,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.39ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:07,416 INFO L158 Benchmark]: Boogie Preprocessor took 40.47ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 93.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:07,416 INFO L158 Benchmark]: IcfgBuilder took 620.00ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 59.6MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 20:03:07,416 INFO L158 Benchmark]: BuchiAutomizer took 2765.41ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 79.8MB in the end (delta: -20.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:07,416 INFO L158 Benchmark]: Witness Printer took 2.22ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 79.8MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 20:03:07,417 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.31ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.56ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 98.4MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.39ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.47ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 93.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 620.00ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 59.6MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2765.41ms. Allocated memory is still 142.6MB. Free memory was 59.6MB in the beginning and 79.8MB in the end (delta: -20.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.22ms. Allocated memory is still 142.6MB. Free memory was 79.8MB in the beginning and 79.8MB in the end (delta: 21.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) 2 * e) + 255) and consists of 4 locations. One deterministic module has affine ranking function (((long long) 2 * e) + 255) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * e) + 253) and consists of 3 locations. One deterministic module has affine ranking function (((long long) 2 * e) + 255) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * e) + 253) and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 47 StatesRemovedByMinimization, 3 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 [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 317 mSDsluCounter, 348 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 321 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp60 ukn100 mio100 lsp100 div617 bol100 ite100 ukn100 eq135 hnf96 smp41 dnf100 smp100 tf104 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.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-17 20:03:07,425 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-17 20:03:07,627 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