./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 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_1-3a.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 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:46:20,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:46:20,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:46:20,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:46:20,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:46:20,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:46:20,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:46:20,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:46:20,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:46:20,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:46:20,250 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:46:20,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:46:20,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:46:20,251 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:46:20,251 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:46:20,251 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:46:20,251 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:46:20,251 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:46:20,251 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:46:20,251 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:46:20,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:46:20,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:46:20,252 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:46:20,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:46:20,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:46:20,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:46:20,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:46:20,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:46:20,252 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:46:20,252 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:46:20,252 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:46:20,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:46:20,252 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:46:20,253 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:46:20,253 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:46:20,253 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:46:20,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:46:20,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:46:20,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:46:20,254 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:46:20,254 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 -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2025-03-04 15:46:20,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:46:20,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:46:20,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:46:20,481 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:46:20,481 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:46:20,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2025-03-04 15:46:21,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74ca82fe3/0d8552bb9e8f46c98940effdbc838e49/FLAG8e8e12292 [2025-03-04 15:46:21,849 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:46:21,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2025-03-04 15:46:21,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74ca82fe3/0d8552bb9e8f46c98940effdbc838e49/FLAG8e8e12292 [2025-03-04 15:46:21,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74ca82fe3/0d8552bb9e8f46c98940effdbc838e49 [2025-03-04 15:46:21,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:46:21,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:46:21,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:46:21,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:46:21,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:46:21,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322b4289 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21, skipping insertion in model container [2025-03-04 15:46:21,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:46:22,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:46:22,073 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:46:22,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:46:22,130 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:46:22,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22 WrapperNode [2025-03-04 15:46:22,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:46:22,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:46:22,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:46:22,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:46:22,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (1/1) ... [2025-03-04 15:46:22,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (1/1) ... [2025-03-04 15:46:22,169 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 15, calls inlined = 18, statements flattened = 379 [2025-03-04 15:46:22,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:46:22,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:46:22,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:46:22,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:46:22,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (1/1) ... [2025-03-04 15:46:22,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (1/1) ... [2025-03-04 15:46:22,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (1/1) ... [2025-03-04 15:46:22,207 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-04 15:46:22,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (1/1) ... [2025-03-04 15:46:22,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (1/1) ... [2025-03-04 15:46:22,216 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (1/1) ... [2025-03-04 15:46:22,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (1/1) ... [2025-03-04 15:46:22,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (1/1) ... [2025-03-04 15:46:22,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (1/1) ... [2025-03-04 15:46:22,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:46:22,220 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:46:22,220 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:46:22,220 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:46:22,221 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (1/1) ... [2025-03-04 15:46:22,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:22,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:22,286 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-04 15:46:22,288 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-04 15:46:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:46:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:46:22,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:46:22,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:46:22,368 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:46:22,370 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:46:22,795 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-03-04 15:46:22,795 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:46:22,821 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:46:22,821 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 15:46:22,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:46:22 BoogieIcfgContainer [2025-03-04 15:46:22,822 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:46:22,822 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:46:22,822 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:46:22,826 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:46:22,827 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:46:22,827 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:46:21" (1/3) ... [2025-03-04 15:46:22,828 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48fce350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:46:22, skipping insertion in model container [2025-03-04 15:46:22,828 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:46:22,828 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:22" (2/3) ... [2025-03-04 15:46:22,828 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48fce350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:46:22, skipping insertion in model container [2025-03-04 15:46:22,828 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:46:22,828 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:46:22" (3/3) ... [2025-03-04 15:46:22,829 INFO L363 chiAutomizerObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2025-03-04 15:46:22,861 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:46:22,862 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:46:22,862 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:46:22,862 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:46:22,862 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:46:22,862 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:46:22,862 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:46:22,862 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:46:22,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 138 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 137 states have internal predecessors, (211), 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-04 15:46:22,883 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-03-04 15:46:22,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:22,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:22,889 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:46:22,889 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:22,889 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:46:22,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 138 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 137 states have internal predecessors, (211), 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-04 15:46:22,896 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-03-04 15:46:22,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:22,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:22,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:46:22,899 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:22,905 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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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-04 15:46:22,905 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-04 15:46:22,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:22,909 INFO L85 PathProgramCache]: Analyzing trace with hash 9172604, now seen corresponding path program 1 times [2025-03-04 15:46:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:22,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782226344] [2025-03-04 15:46:22,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:22,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:46:22,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:46:22,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:22,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:23,095 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-04 15:46:23,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:23,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782226344] [2025-03-04 15:46:23,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782226344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:46:23,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:46:23,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:46:23,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165159651] [2025-03-04 15:46:23,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:46:23,101 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:23,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:23,102 INFO L85 PathProgramCache]: Analyzing trace with hash 278003, now seen corresponding path program 1 times [2025-03-04 15:46:23,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:23,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917707776] [2025-03-04 15:46:23,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:23,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:23,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:23,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:23,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,110 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:23,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:23,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:23,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:23,168 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:23,168 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:23,169 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:23,169 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:23,169 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:23,169 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,169 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:23,169 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:23,169 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration1_Loop [2025-03-04 15:46:23,169 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:23,169 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:23,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:23,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:23,327 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:23,327 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:23,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,331 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-04 15:46:23,332 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-04 15:46:23,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:23,334 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:23,351 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:46:23,352 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-04 15:46:23,356 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-04 15:46:23,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,359 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-04 15:46:23,360 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-04 15:46:23,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:23,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:23,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 15:46:23,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,380 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-04 15:46:23,381 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-04 15:46:23,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:23,382 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:23,405 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:23,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 15:46:23,409 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:23,409 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:23,409 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:23,409 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:23,409 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:23,409 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,409 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:23,409 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:23,409 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration1_Loop [2025-03-04 15:46:23,409 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:23,409 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:23,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:23,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:23,502 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:23,504 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:23,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,507 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-04 15:46:23,509 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-04 15:46:23,510 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-04 15:46:23,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:23,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:23,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:23,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:23,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:23,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:23,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:23,528 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:23,533 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-04 15:46:23,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,535 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-04 15:46:23,537 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-04 15:46:23,538 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-04 15:46:23,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:23,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:23,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:23,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:23,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:23,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:23,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:23,552 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:23,554 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:23,556 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:23,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,559 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-04 15:46:23,560 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-04 15:46:23,561 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:23,562 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:23,562 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:23,562 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-04 15:46:23,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-04 15:46:23,571 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:23,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:23,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:46:23,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:46:23,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:23,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:23,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:23,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:23,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:23,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:23,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:23,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:23,648 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-04 15:46:23,668 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-04 15:46:23,670 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 138 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 137 states have internal predecessors, (211), 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 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-04 15:46:23,769 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 138 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 137 states have internal predecessors, (211), 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 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 410 states and 620 transitions. Complement of second has 6 states. [2025-03-04 15:46:23,771 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-04 15:46:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-04 15:46:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 407 transitions. [2025-03-04 15:46:23,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 407 transitions. Stem has 4 letters. Loop has 3 letters. [2025-03-04 15:46:23,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:23,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 407 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 15:46:23,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:23,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 407 transitions. Stem has 4 letters. Loop has 6 letters. [2025-03-04 15:46:23,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:23,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 410 states and 620 transitions. [2025-03-04 15:46:23,787 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2025-03-04 15:46:23,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 410 states to 86 states and 125 transitions. [2025-03-04 15:46:23,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2025-03-04 15:46:23,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2025-03-04 15:46:23,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 125 transitions. [2025-03-04 15:46:23,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:23,794 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 125 transitions. [2025-03-04 15:46:23,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 125 transitions. [2025-03-04 15:46:23,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2025-03-04 15:46:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.507462686567164) internal successors, (101), 66 states have internal predecessors, (101), 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-04 15:46:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2025-03-04 15:46:23,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 101 transitions. [2025-03-04 15:46:23,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:23,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:46:23,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:46:23,820 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-04 15:46:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:23,863 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2025-03-04 15:46:23,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2025-03-04 15:46:23,863 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-03-04 15:46:23,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 42 transitions. [2025-03-04 15:46:23,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-03-04 15:46:23,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-03-04 15:46:23,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2025-03-04 15:46:23,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:46:23,865 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-04 15:46:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2025-03-04 15:46:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 15:46:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 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-04 15:46:23,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2025-03-04 15:46:23,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-04 15:46:23,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:46:23,869 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-04 15:46:23,869 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:46:23,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2025-03-04 15:46:23,870 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-03-04 15:46:23,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:23,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:23,870 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:23,871 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:23,871 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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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-04 15:46:23,871 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-04 15:46:23,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:23,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1618603997, now seen corresponding path program 1 times [2025-03-04 15:46:23,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:23,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672056610] [2025-03-04 15:46:23,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:23,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:23,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:23,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:23,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:23,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:23,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:23,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:23,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:23,894 INFO L85 PathProgramCache]: Analyzing trace with hash 236297, now seen corresponding path program 1 times [2025-03-04 15:46:23,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:23,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688502289] [2025-03-04 15:46:23,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:23,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:23,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:23,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:23,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,901 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:23,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:23,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:23,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:23,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:23,904 INFO L85 PathProgramCache]: Analyzing trace with hash -233635929, now seen corresponding path program 1 times [2025-03-04 15:46:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:23,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056640750] [2025-03-04 15:46:23,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:23,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:23,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:23,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:23,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:23,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:23,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:23,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:23,960 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:23,961 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:23,961 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:23,961 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:23,961 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:23,961 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,961 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:23,961 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:23,961 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration2_Loop [2025-03-04 15:46:23,961 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:23,961 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:23,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:23,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,049 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:24,050 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:24,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,052 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-04 15:46:24,054 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-04 15:46:24,055 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:24,055 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:24,071 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:46:24,072 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-04 15:46:24,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-04 15:46:24,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,078 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-04 15:46:24,080 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-04 15:46:24,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:24,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:24,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:24,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,099 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-04 15:46:24,100 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-04 15:46:24,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:24,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:24,124 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:24,127 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-04 15:46:24,127 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:24,127 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:24,127 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:24,128 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:24,128 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:24,128 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,128 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:24,128 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:24,128 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration2_Loop [2025-03-04 15:46:24,128 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:24,128 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:24,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,219 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:24,219 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:24,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,221 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-04 15:46:24,223 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-04 15:46:24,224 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-04 15:46:24,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:24,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:24,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:24,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:24,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:24,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:24,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:24,239 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:24,245 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-04 15:46:24,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,247 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-04 15:46:24,263 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-04 15:46:24,264 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-04 15:46:24,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:24,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:24,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:24,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:24,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:24,278 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:24,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:24,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:24,280 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:24,281 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:24,281 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:24,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,283 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-04 15:46:24,285 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-04 15:46:24,286 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:24,286 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:24,286 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:24,286 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-04 15:46:24,291 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-04 15:46:24,292 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:24,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:24,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:24,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:24,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:24,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:24,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:24,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:24,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:24,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:24,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:24,337 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-04 15:46:24,337 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-04 15:46:24,337 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-04 15:46:24,367 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 15. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 60 states and 79 transitions. Complement of second has 5 states. [2025-03-04 15:46:24,367 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-04 15:46:24,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-04 15:46:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-04 15:46:24,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 15:46:24,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-04 15:46:24,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:46:24,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2025-03-04 15:46:24,369 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2025-03-04 15:46:24,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 53 states and 70 transitions. [2025-03-04 15:46:24,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2025-03-04 15:46:24,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-03-04 15:46:24,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 70 transitions. [2025-03-04 15:46:24,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:24,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 70 transitions. [2025-03-04 15:46:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 70 transitions. [2025-03-04 15:46:24,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2025-03-04 15:46:24,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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-04 15:46:24,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-03-04 15:46:24,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-03-04 15:46:24,371 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-03-04 15:46:24,371 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:46:24,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2025-03-04 15:46:24,372 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-03-04 15:46:24,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:24,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:24,372 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:24,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:24,372 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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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-04 15:46:24,372 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-04 15:46:24,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1618603996, now seen corresponding path program 1 times [2025-03-04 15:46:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:24,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700445529] [2025-03-04 15:46:24,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:24,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:24,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:24,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:24,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:24,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:24,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:24,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:24,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,392 INFO L85 PathProgramCache]: Analyzing trace with hash 246199, now seen corresponding path program 1 times [2025-03-04 15:46:24,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:24,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122822815] [2025-03-04 15:46:24,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:24,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:24,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:24,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:24,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:24,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:24,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:24,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,409 INFO L85 PathProgramCache]: Analyzing trace with hash -233596236, now seen corresponding path program 1 times [2025-03-04 15:46:24,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:24,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205541638] [2025-03-04 15:46:24,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:24,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:24,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:24,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:24,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,415 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:24,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:24,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:24,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:24,445 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:24,445 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:24,445 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:24,446 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:24,446 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:24,446 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,446 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:24,446 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:24,446 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration3_Loop [2025-03-04 15:46:24,446 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:24,446 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:24,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,513 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:24,514 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:24,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,516 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-04 15:46:24,518 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-04 15:46:24,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:24,518 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:24,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:24,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,536 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-04 15:46:24,538 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-04 15:46:24,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:24,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:24,561 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:24,565 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-04 15:46:24,565 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:24,565 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:24,565 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:24,565 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:24,565 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:24,565 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,565 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:24,565 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:24,565 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration3_Loop [2025-03-04 15:46:24,565 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:24,565 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:24,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,631 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:24,631 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:24,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,633 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-04 15:46:24,634 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-04 15:46:24,635 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-04 15:46:24,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:24,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:24,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:24,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:24,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:24,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:24,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:24,649 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:24,650 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:24,650 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:24,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,653 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-04 15:46:24,654 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-04 15:46:24,655 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:24,655 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:24,655 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:24,655 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-04 15:46:24,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 15:46:24,662 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:24,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:24,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:24,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:24,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:24,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:24,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:24,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:24,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:24,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:24,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:24,700 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-04 15:46:24,700 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-04 15:46:24,701 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 46 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-04 15:46:24,731 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 46 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 62 states and 82 transitions. Complement of second has 5 states. [2025-03-04 15:46:24,732 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-04 15:46:24,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-04 15:46:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-04 15:46:24,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 15:46:24,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-04 15:46:24,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:46:24,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 82 transitions. [2025-03-04 15:46:24,734 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-03-04 15:46:24,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 55 states and 73 transitions. [2025-03-04 15:46:24,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2025-03-04 15:46:24,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-03-04 15:46:24,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 73 transitions. [2025-03-04 15:46:24,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:24,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 73 transitions. [2025-03-04 15:46:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 73 transitions. [2025-03-04 15:46:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2025-03-04 15:46:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 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-04 15:46:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2025-03-04 15:46:24,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-03-04 15:46:24,737 INFO L432 stractBuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2025-03-04 15:46:24,737 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:46:24,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 50 transitions. [2025-03-04 15:46:24,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:46:24,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:24,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:24,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:24,738 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:24,738 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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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-04 15:46:24,738 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-04 15:46:24,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,738 INFO L85 PathProgramCache]: Analyzing trace with hash -235626958, now seen corresponding path program 1 times [2025-03-04 15:46:24,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:24,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881911690] [2025-03-04 15:46:24,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:24,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:24,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:24,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:24,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,747 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:24,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:24,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:24,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:24,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,754 INFO L85 PathProgramCache]: Analyzing trace with hash 194591, now seen corresponding path program 1 times [2025-03-04 15:46:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:24,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139130057] [2025-03-04 15:46:24,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:24,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:24,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:24,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:24,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,757 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:24,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:24,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:24,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:24,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1585979314, now seen corresponding path program 1 times [2025-03-04 15:46:24,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:24,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836553759] [2025-03-04 15:46:24,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:24,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:24,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:46:24,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:46:24,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:24,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:46:24,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:46:24,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:24,817 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:24,817 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:24,817 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:24,817 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:24,817 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:24,817 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,817 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:24,817 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:24,817 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration4_Loop [2025-03-04 15:46:24,817 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:24,817 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:24,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,894 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:24,895 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:24,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,899 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-04 15:46:24,901 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-04 15:46:24,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:24,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:24,920 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-04 15:46:24,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,922 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-04 15:46:24,923 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-04 15:46:24,925 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:24,925 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:24,947 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:24,951 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-04 15:46:24,951 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:24,951 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:24,951 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:24,951 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:24,951 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:24,951 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,951 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:24,951 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:24,951 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration4_Loop [2025-03-04 15:46:24,951 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:24,951 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:24,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,035 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:25,035 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:25,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,037 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-04 15:46:25,039 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-04 15:46:25,040 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-04 15:46:25,050 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:25,050 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:25,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:25,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:25,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:25,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:25,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:25,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:25,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:25,055 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:25,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,058 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-04 15:46:25,059 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-04 15:46:25,060 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:25,060 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:25,060 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:25,060 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-04 15:46:25,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:25,067 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:25,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:25,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:25,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:25,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:25,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:25,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:25,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:25,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:25,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:25,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:25,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:25,124 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-04 15:46:25,124 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-04 15:46:25,124 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 50 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-04 15:46:25,131 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 50 transitions. cyclomatic complexity: 17. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 41 states and 54 transitions. Complement of second has 4 states. [2025-03-04 15:46:25,131 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-04 15:46:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-04 15:46:25,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-04 15:46:25,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-04 15:46:25,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:25,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-04 15:46:25,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:25,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 10 letters. Loop has 6 letters. [2025-03-04 15:46:25,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:25,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 54 transitions. [2025-03-04 15:46:25,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:46:25,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 34 states and 46 transitions. [2025-03-04 15:46:25,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-04 15:46:25,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-04 15:46:25,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 46 transitions. [2025-03-04 15:46:25,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:25,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-03-04 15:46:25,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 46 transitions. [2025-03-04 15:46:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-04 15:46:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 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-04 15:46:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2025-03-04 15:46:25,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-03-04 15:46:25,135 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2025-03-04 15:46:25,135 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:46:25,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2025-03-04 15:46:25,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:46:25,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:25,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:25,135 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:25,135 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:25,135 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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~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-04 15:46:25,135 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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-04 15:46:25,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:25,136 INFO L85 PathProgramCache]: Analyzing trace with hash -235626957, now seen corresponding path program 1 times [2025-03-04 15:46:25,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:25,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117634663] [2025-03-04 15:46:25,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:25,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:25,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:25,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:25,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:25,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:25,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:25,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:25,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:25,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:25,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:25,155 INFO L85 PathProgramCache]: Analyzing trace with hash 204493, now seen corresponding path program 1 times [2025-03-04 15:46:25,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:25,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941160051] [2025-03-04 15:46:25,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:25,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:25,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:25,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:25,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:25,161 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:25,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:25,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:25,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:25,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:25,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1585939621, now seen corresponding path program 1 times [2025-03-04 15:46:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:25,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885001245] [2025-03-04 15:46:25,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:25,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:25,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:46:25,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:46:25,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:25,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:25,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:46:25,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:46:25,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:25,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:25,215 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:25,215 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:25,215 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:25,215 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:25,215 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:25,215 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,215 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:25,215 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:25,215 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration5_Loop [2025-03-04 15:46:25,216 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:25,216 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:25,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,289 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:25,289 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:25,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,293 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-04 15:46:25,294 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-04 15:46:25,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:25,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:25,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-04 15:46:25,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,315 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-04 15:46:25,316 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-04 15:46:25,317 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:25,317 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:25,335 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:25,343 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-04 15:46:25,343 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:25,343 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:25,343 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:25,343 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:25,343 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:25,343 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,343 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:25,343 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:25,343 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration5_Loop [2025-03-04 15:46:25,343 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:25,343 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:25,344 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,411 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:25,411 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:25,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,413 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-04 15:46:25,415 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-04 15:46:25,415 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-04 15:46:25,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:25,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:25,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:25,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:25,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:25,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:25,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:25,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:25,437 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-04 15:46:25,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,439 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-04 15:46:25,441 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-04 15:46:25,442 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-04 15:46:25,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:25,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:25,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:25,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:25,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:25,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:25,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:25,455 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:25,457 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:25,457 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:25,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,459 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-04 15:46:25,460 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-04 15:46:25,460 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:25,460 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:25,460 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:25,460 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-04 15:46:25,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:46:25,467 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:25,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:25,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:25,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:25,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:25,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:25,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:25,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:25,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:25,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:25,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:25,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:25,520 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-04 15:46:25,521 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-04 15:46:25,521 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 46 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-04 15:46:25,530 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 46 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 37 states and 50 transitions. Complement of second has 4 states. [2025-03-04 15:46:25,531 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-04 15:46:25,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-04 15:46:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-03-04 15:46:25,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-04 15:46:25,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:25,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-04 15:46:25,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:25,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 6 letters. [2025-03-04 15:46:25,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:25,532 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 50 transitions. [2025-03-04 15:46:25,532 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:46:25,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2025-03-04 15:46:25,535 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:46:25,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:46:25,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:46:25,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:46:25,535 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:25,535 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:25,535 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:25,535 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:46:25,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:46:25,535 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:46:25,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:46:25,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:46:25 BoogieIcfgContainer [2025-03-04 15:46:25,541 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:46:25,542 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:46:25,542 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:46:25,542 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:46:25,543 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:46:22" (3/4) ... [2025-03-04 15:46:25,544 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:46:25,544 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:46:25,545 INFO L158 Benchmark]: Toolchain (without parser) took 3664.37ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 111.5MB in the beginning and 277.0MB in the end (delta: -165.5MB). Peak memory consumption was 112.5MB. Max. memory is 16.1GB. [2025-03-04 15:46:25,545 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:46:25,545 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.63ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 97.9MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:46:25,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.01ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:46:25,546 INFO L158 Benchmark]: Boogie Preprocessor took 44.17ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 93.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:46:25,546 INFO L158 Benchmark]: IcfgBuilder took 601.54ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 60.9MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 15:46:25,546 INFO L158 Benchmark]: BuchiAutomizer took 2719.02ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 60.9MB in the beginning and 277.0MB in the end (delta: -216.1MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2025-03-04 15:46:25,546 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 419.4MB. Free memory was 277.0MB in the beginning and 277.0MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:46:25,547 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.26ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.63ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 97.9MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.01ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 95.4MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.17ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 93.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 601.54ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 60.9MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2719.02ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 60.9MB in the beginning and 277.0MB in the end (delta: -216.1MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 419.4MB. Free memory was 277.0MB in the beginning and 277.0MB in the end (delta: 24.1kB). 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.6s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. 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, 56 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, 371 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 421 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 382 mSDtfsCounter, 111 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: 23ms 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-04 15:46:25,555 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-04 15:46:25,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:25,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:26,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:26,358 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