./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:00:16,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:00:16,095 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:00:16,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:00:16,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:00:16,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:00:16,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:00:16,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:00:16,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:00:16,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:00:16,121 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:00:16,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:00:16,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:00:16,122 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:00:16,122 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:00:16,122 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:00:16,123 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:00:16,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:00:16,124 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:00:16,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:00:16,124 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:00:16,124 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:00:16,124 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:00:16,124 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:00:16,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:00:16,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:00:16,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:00:16,125 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:00:16,125 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2025-03-09 07:00:16,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:00:16,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:00:16,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:00:16,350 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:00:16,350 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:00:16,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-03-09 07:00:17,470 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97facfe28/0a2b70aa1e044486804550e31d257e59/FLAG2ee05de8e [2025-03-09 07:00:17,760 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:00:17,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2025-03-09 07:00:17,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97facfe28/0a2b70aa1e044486804550e31d257e59/FLAG2ee05de8e [2025-03-09 07:00:17,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97facfe28/0a2b70aa1e044486804550e31d257e59 [2025-03-09 07:00:17,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:00:17,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:00:17,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:00:17,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:00:17,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:00:17,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:00:17" (1/1) ... [2025-03-09 07:00:17,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63604a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:17, skipping insertion in model container [2025-03-09 07:00:17,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:00:17" (1/1) ... [2025-03-09 07:00:17,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:00:17,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:00:17,954 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:00:17,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:00:18,011 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:00:18,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18 WrapperNode [2025-03-09 07:00:18,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:00:18,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:00:18,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:00:18,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:00:18,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (1/1) ... [2025-03-09 07:00:18,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (1/1) ... [2025-03-09 07:00:18,055 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 407 [2025-03-09 07:00:18,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:00:18,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:00:18,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:00:18,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:00:18,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (1/1) ... [2025-03-09 07:00:18,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (1/1) ... [2025-03-09 07:00:18,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (1/1) ... [2025-03-09 07:00:18,081 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-09 07:00:18,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (1/1) ... [2025-03-09 07:00:18,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (1/1) ... [2025-03-09 07:00:18,089 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (1/1) ... [2025-03-09 07:00:18,094 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (1/1) ... [2025-03-09 07:00:18,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (1/1) ... [2025-03-09 07:00:18,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (1/1) ... [2025-03-09 07:00:18,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:00:18,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:00:18,103 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:00:18,103 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:00:18,104 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (1/1) ... [2025-03-09 07:00:18,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:18,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:18,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:18,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 07:00:18,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:00:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:00:18,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:00:18,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:00:18,213 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:00:18,214 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:00:18,586 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2025-03-09 07:00:18,587 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:00:18,611 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:00:18,612 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-09 07:00:18,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:00:18 BoogieIcfgContainer [2025-03-09 07:00:18,612 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:00:18,613 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:00:18,613 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:00:18,617 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:00:18,617 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:00:18,617 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:00:17" (1/3) ... [2025-03-09 07:00:18,618 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7841ce3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:00:18, skipping insertion in model container [2025-03-09 07:00:18,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:00:18,619 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:00:18" (2/3) ... [2025-03-09 07:00:18,619 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7841ce3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:00:18, skipping insertion in model container [2025-03-09 07:00:18,619 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:00:18,620 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:00:18" (3/3) ... [2025-03-09 07:00:18,621 INFO L363 chiAutomizerObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2025-03-09 07:00:18,659 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:00:18,660 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:00:18,660 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:00:18,660 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:00:18,660 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:00:18,660 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:00:18,661 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:00:18,661 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:00:18,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.5615384615384615) internal successors, (203), 130 states have internal predecessors, (203), 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-09 07:00:18,680 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-03-09 07:00:18,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:00:18,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:00:18,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:00:18,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:00:18,685 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:00:18,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.5615384615384615) internal successors, (203), 130 states have internal predecessors, (203), 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-09 07:00:18,693 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2025-03-09 07:00:18,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:00:18,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:00:18,694 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:00:18,694 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:00:18,698 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-09 07:00:18,698 INFO L754 eck$LassoCheckResult]: Loop: "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-09 07:00:18,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:18,701 INFO L85 PathProgramCache]: Analyzing trace with hash 9326524, now seen corresponding path program 1 times [2025-03-09 07:00:18,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:18,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852750520] [2025-03-09 07:00:18,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:18,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:18,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:00:18,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:00:18,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:18,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:00:18,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:00:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852750520] [2025-03-09 07:00:18,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852750520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:00:18,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:00:18,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:00:18,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528526668] [2025-03-09 07:00:18,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:00:18,877 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:00:18,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash 9147, now seen corresponding path program 1 times [2025-03-09 07:00:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:18,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206821767] [2025-03-09 07:00:18,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:18,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:18,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:18,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:18,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:18,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:18,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:18,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:18,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:18,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:18,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:18,961 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:18,962 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:18,962 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:18,962 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:18,962 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:00:18,963 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:18,963 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:18,963 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:18,963 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration1_Loop [2025-03-09 07:00:18,963 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:18,964 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:18,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:18,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:19,086 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:19,087 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:00:19,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:19,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:19,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 07:00:19,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:19,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:19,112 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:19,112 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-09 07:00:19,116 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-09 07:00:19,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:19,119 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:19,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 07:00:19,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:19,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:19,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:19,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:19,141 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:19,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 07:00:19,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:00:19,146 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:19,172 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:00:19,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:19,177 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:19,177 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:19,177 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:19,177 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:19,177 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:00:19,177 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,177 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:19,177 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:19,177 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration1_Loop [2025-03-09 07:00:19,177 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:19,177 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:19,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:19,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:19,275 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:19,277 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:00:19,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:19,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:19,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 07:00:19,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:19,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:19,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:19,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:19,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:19,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:19,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:19,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:19,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:19,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:19,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:19,313 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:19,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 07:00:19,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:19,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:19,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:19,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:19,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:19,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:19,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:19,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:19,329 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:00:19,332 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:00:19,337 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:00:19,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:19,340 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:19,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 07:00:19,342 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:00:19,342 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:00:19,342 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:00:19,343 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-09 07:00:19,348 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-09 07:00:19,351 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:00:19,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:19,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:00:19,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:00:19,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:19,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:19,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:00:19,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:19,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:19,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:19,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:19,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:19,400 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:00:19,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:00:19,442 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-09 07:00:19,444 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 131 states, 130 states have (on average 1.5615384615384615) internal successors, (203), 130 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 07:00:19,543 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 131 states, 130 states have (on average 1.5615384615384615) internal successors, (203), 130 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 396 states and 605 transitions. Complement of second has 6 states. [2025-03-09 07:00:19,544 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-09 07:00:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-09 07:00:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 394 transitions. [2025-03-09 07:00:19,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 394 transitions. Stem has 4 letters. Loop has 2 letters. [2025-03-09 07:00:19,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:19,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 394 transitions. Stem has 6 letters. Loop has 2 letters. [2025-03-09 07:00:19,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:19,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 394 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-09 07:00:19,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:19,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 396 states and 605 transitions. [2025-03-09 07:00:19,559 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 18 [2025-03-09 07:00:19,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 396 states to 75 states and 114 transitions. [2025-03-09 07:00:19,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2025-03-09 07:00:19,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-03-09 07:00:19,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 114 transitions. [2025-03-09 07:00:19,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:00:19,563 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 114 transitions. [2025-03-09 07:00:19,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 114 transitions. [2025-03-09 07:00:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. [2025-03-09 07:00:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 57 states have internal predecessors, (92), 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-09 07:00:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 92 transitions. [2025-03-09 07:00:19,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 92 transitions. [2025-03-09 07:00:19,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:00:19,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:00:19,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:00:19,588 INFO L87 Difference]: Start difference. First operand 58 states and 92 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-09 07:00:19,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:00:19,633 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2025-03-09 07:00:19,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 38 transitions. [2025-03-09 07:00:19,634 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-03-09 07:00:19,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 38 transitions. [2025-03-09 07:00:19,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-09 07:00:19,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-03-09 07:00:19,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2025-03-09 07:00:19,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:00:19,636 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2025-03-09 07:00:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2025-03-09 07:00:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-09 07:00:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:00:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2025-03-09 07:00:19,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 38 transitions. [2025-03-09 07:00:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:00:19,640 INFO L432 stractBuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2025-03-09 07:00:19,640 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:00:19,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 38 transitions. [2025-03-09 07:00:19,640 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-03-09 07:00:19,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:00:19,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:00:19,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:00:19,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:00:19,641 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;" "main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-09 07:00:19,641 INFO L754 eck$LassoCheckResult]: Loop: "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-09 07:00:19,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:19,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1328074040, now seen corresponding path program 1 times [2025-03-09 07:00:19,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:19,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880506046] [2025-03-09 07:00:19,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:19,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:19,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:00:19,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:00:19,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:19,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:19,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:19,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:00:19,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:00:19,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:19,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:19,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:19,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash 7867, now seen corresponding path program 1 times [2025-03-09 07:00:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:19,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432592712] [2025-03-09 07:00:19,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:19,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:19,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:19,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:19,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:19,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:19,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:19,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:19,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:19,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:19,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:19,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:19,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:19,671 INFO L85 PathProgramCache]: Analyzing trace with hash -673858622, now seen corresponding path program 1 times [2025-03-09 07:00:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:19,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335670058] [2025-03-09 07:00:19,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:19,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:19,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:00:19,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:00:19,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:19,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:19,683 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:19,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:00:19,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:00:19,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:19,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:19,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:19,716 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:19,717 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:19,717 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:19,717 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:19,717 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:00:19,717 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,717 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:19,717 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:19,717 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration2_Loop [2025-03-09 07:00:19,717 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:19,717 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:19,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:19,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:19,808 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:19,808 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:00:19,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:19,811 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:19,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 07:00:19,813 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:19,813 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:19,831 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-09 07:00:19,831 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-09 07:00:19,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:19,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:19,837 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:19,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 07:00:19,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:19,840 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:19,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:19,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:19,859 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:19,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 07:00:19,861 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:00:19,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:19,883 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:00:19,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:19,887 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:19,887 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:19,887 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:19,887 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:19,887 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:00:19,887 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,887 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:19,888 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:19,888 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration2_Loop [2025-03-09 07:00:19,888 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:19,888 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:19,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:19,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:19,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-09 07:00:19,985 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:19,985 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:00:19,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:19,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:19,988 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:19,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 07:00:19,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:20,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:20,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:20,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:20,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:20,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:20,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:20,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:20,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:20,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 07:00:20,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:20,022 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:20,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 07:00:20,025 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:20,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:20,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:20,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:20,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:20,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:20,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:20,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:20,039 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:00:20,040 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:00:20,041 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:00:20,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:20,043 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:20,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 07:00:20,044 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:00:20,044 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:00:20,044 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:00:20,044 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-09 07:00:20,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:20,050 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:00:20,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:20,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:00:20,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:00:20,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:20,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:00:20,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:20,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:20,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:20,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:20,088 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:00:20,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:00:20,101 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-09 07:00:20,102 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 38 transitions. cyclomatic complexity: 15 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:00:20,129 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 38 transitions. cyclomatic complexity: 15. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 53 states and 72 transitions. Complement of second has 5 states. [2025-03-09 07:00:20,129 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-09 07:00:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:00:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-03-09 07:00:20,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-09 07:00:20,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:20,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-09 07:00:20,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:20,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-09 07:00:20,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:20,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 72 transitions. [2025-03-09 07:00:20,134 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-03-09 07:00:20,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 63 transitions. [2025-03-09 07:00:20,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-03-09 07:00:20,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2025-03-09 07:00:20,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 63 transitions. [2025-03-09 07:00:20,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:00:20,136 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 63 transitions. [2025-03-09 07:00:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 63 transitions. [2025-03-09 07:00:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2025-03-09 07:00:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 28 states have internal predecessors, (41), 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-09 07:00:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2025-03-09 07:00:20,137 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 41 transitions. [2025-03-09 07:00:20,137 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 41 transitions. [2025-03-09 07:00:20,137 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:00:20,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 41 transitions. [2025-03-09 07:00:20,139 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-09 07:00:20,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:00:20,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:00:20,140 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:00:20,140 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:00:20,140 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;" "main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" [2025-03-09 07:00:20,140 INFO L754 eck$LassoCheckResult]: Loop: "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2;" [2025-03-09 07:00:20,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1328074039, now seen corresponding path program 1 times [2025-03-09 07:00:20,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:20,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508775657] [2025-03-09 07:00:20,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:20,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:20,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:00:20,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:00:20,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:20,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:00:20,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:00:20,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:20,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:20,160 INFO L85 PathProgramCache]: Analyzing trace with hash 8127, now seen corresponding path program 1 times [2025-03-09 07:00:20,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:20,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803937821] [2025-03-09 07:00:20,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:20,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:20,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:20,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:20,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:20,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:20,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:20,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:20,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash -673857401, now seen corresponding path program 1 times [2025-03-09 07:00:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161705667] [2025-03-09 07:00:20,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:20,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:20,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:00:20,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:00:20,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:20,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 07:00:20,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 07:00:20,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,196 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:20,216 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:20,216 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:20,216 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:20,216 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:20,216 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:00:20,216 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,216 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:20,216 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:20,216 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration3_Loop [2025-03-09 07:00:20,216 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:20,216 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:20,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:20,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:20,288 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:20,288 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:00:20,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:20,292 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:20,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 07:00:20,293 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:20,293 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:20,308 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-09 07:00:20,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:20,311 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:20,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 07:00:20,313 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:00:20,313 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:20,334 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:00:20,338 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-09 07:00:20,338 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:20,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:20,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:20,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:20,338 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:00:20,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:20,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:20,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration3_Loop [2025-03-09 07:00:20,339 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:20,339 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:20,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:20,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:20,402 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:20,402 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:00:20,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:20,404 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:20,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-09 07:00:20,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:20,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:20,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:20,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:20,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:20,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:20,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:20,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:20,419 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:00:20,420 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:00:20,420 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:00:20,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:20,422 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:20,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 07:00:20,424 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:00:20,424 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:00:20,424 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:00:20,424 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-09 07:00:20,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:20,431 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:00:20,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:20,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 07:00:20,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 07:00:20,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:20,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:00:20,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:20,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:20,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:20,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:20,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:00:20,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:00:20,470 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-09 07:00:20,470 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 41 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:00:20,496 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 41 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 54 states and 76 transitions. Complement of second has 5 states. [2025-03-09 07:00:20,496 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-09 07:00:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:00:20,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-03-09 07:00:20,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 7 letters. Loop has 2 letters. [2025-03-09 07:00:20,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:20,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 9 letters. Loop has 2 letters. [2025-03-09 07:00:20,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:20,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 45 transitions. Stem has 7 letters. Loop has 4 letters. [2025-03-09 07:00:20,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:20,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 76 transitions. [2025-03-09 07:00:20,498 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-03-09 07:00:20,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 47 states and 66 transitions. [2025-03-09 07:00:20,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-03-09 07:00:20,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2025-03-09 07:00:20,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 66 transitions. [2025-03-09 07:00:20,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:00:20,499 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 66 transitions. [2025-03-09 07:00:20,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 66 transitions. [2025-03-09 07:00:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2025-03-09 07:00:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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-09 07:00:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2025-03-09 07:00:20,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2025-03-09 07:00:20,500 INFO L432 stractBuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2025-03-09 07:00:20,500 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:00:20,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2025-03-09 07:00:20,500 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 07:00:20,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:00:20,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:00:20,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:00:20,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:00:20,501 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;" "main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;" "main_#t~ret21#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-09 07:00:20,501 INFO L754 eck$LassoCheckResult]: Loop: "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-09 07:00:20,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:20,501 INFO L85 PathProgramCache]: Analyzing trace with hash 583289108, now seen corresponding path program 1 times [2025-03-09 07:00:20,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:20,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371051219] [2025-03-09 07:00:20,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:20,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:20,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:00:20,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:00:20,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,509 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:20,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:00:20,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:00:20,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:20,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash 6587, now seen corresponding path program 1 times [2025-03-09 07:00:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:20,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970626035] [2025-03-09 07:00:20,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:20,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:20,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:20,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:20,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,526 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:20,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:20,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:20,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:20,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:20,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2099877362, now seen corresponding path program 1 times [2025-03-09 07:00:20,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:20,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106757692] [2025-03-09 07:00:20,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:20,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:20,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 07:00:20,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 07:00:20,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:20,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 07:00:20,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 07:00:20,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:20,577 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:20,578 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:20,578 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:20,578 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:20,578 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:00:20,578 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,578 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:20,578 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:20,578 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration4_Loop [2025-03-09 07:00:20,578 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:20,578 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:20,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:20,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:20,652 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:20,652 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:00:20,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:20,655 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:20,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 07:00:20,656 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:20,656 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:20,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:20,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:20,674 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-09 07:00:20,675 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-09 07:00:20,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:00:20,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:20,697 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:00:20,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 07:00:20,701 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:20,701 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:20,702 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:20,702 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:20,702 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:00:20,702 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,702 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:20,702 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:20,702 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration4_Loop [2025-03-09 07:00:20,702 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:20,702 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:20,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:20,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:20,789 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:20,790 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:00:20,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:20,793 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:20,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 07:00:20,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:20,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:20,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:20,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:20,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:20,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:20,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:20,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:20,808 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:00:20,809 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:00:20,809 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:00:20,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:20,811 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:20,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 07:00:20,814 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:00:20,814 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:00:20,814 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:00:20,814 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-09 07:00:20,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:20,821 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:00:20,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:20,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:00:20,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:00:20,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:20,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:00:20,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:20,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:20,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:20,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:20,859 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:00:20,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:20,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-09 07:00:20,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-03-09 07:00:20,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 07:00:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:00:20,899 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-09 07:00:20,899 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 45 transitions. cyclomatic complexity: 18 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09 07:00:20,908 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 45 transitions. cyclomatic complexity: 18. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 33 states and 47 transitions. Complement of second has 4 states. [2025-03-09 07:00:20,912 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-09 07:00:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09 07:00:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-03-09 07:00:20,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 10 letters. Loop has 2 letters. [2025-03-09 07:00:20,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:20,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-09 07:00:20,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:20,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 10 letters. Loop has 4 letters. [2025-03-09 07:00:20,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:20,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 47 transitions. [2025-03-09 07:00:20,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:00:20,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 29 states and 42 transitions. [2025-03-09 07:00:20,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-09 07:00:20,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-03-09 07:00:20,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 42 transitions. [2025-03-09 07:00:20,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:00:20,914 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 42 transitions. [2025-03-09 07:00:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 42 transitions. [2025-03-09 07:00:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-09 07:00:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 28 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-09 07:00:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2025-03-09 07:00:20,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 42 transitions. [2025-03-09 07:00:20,915 INFO L432 stractBuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2025-03-09 07:00:20,915 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:00:20,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2025-03-09 07:00:20,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:00:20,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:00:20,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:00:20,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:00:20,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:00:20,918 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(24, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add1~0#1, main_~r_add2~0#1, main_~zero~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~__retres14~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add1~0#1;havoc main_~r_add2~0#1;havoc main_~zero~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~__retres14~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;" "main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;" "main_#t~ret21#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" [2025-03-09 07:00:20,918 INFO L754 eck$LassoCheckResult]: Loop: "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2;" [2025-03-09 07:00:20,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:20,919 INFO L85 PathProgramCache]: Analyzing trace with hash 583289109, now seen corresponding path program 1 times [2025-03-09 07:00:20,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:20,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609562762] [2025-03-09 07:00:20,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:20,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:20,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:00:20,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:00:20,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:20,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:00:20,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:00:20,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:20,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash 6847, now seen corresponding path program 1 times [2025-03-09 07:00:20,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:20,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733572860] [2025-03-09 07:00:20,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:20,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:20,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:20,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:20,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,947 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:20,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:20,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:20,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:20,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2099876141, now seen corresponding path program 1 times [2025-03-09 07:00:20,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:00:20,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984270987] [2025-03-09 07:00:20,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:00:20,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:00:20,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 07:00:20,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 07:00:20,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:00:20,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 07:00:20,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 07:00:20,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:20,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:00:20,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:00:20,996 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:20,996 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:20,996 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:20,996 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:20,996 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-09 07:00:20,996 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:20,996 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:20,996 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:20,996 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration5_Loop [2025-03-09 07:00:20,997 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:20,997 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:20,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:21,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:21,060 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:21,060 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-09 07:00:21,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:21,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:21,063 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:21,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 07:00:21,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-09 07:00:21,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:21,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-09 07:00:21,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:21,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:21,084 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:21,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-09 07:00:21,086 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-09 07:00:21,086 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-09 07:00:21,103 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-09 07:00:21,107 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-09 07:00:21,107 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:00:21,107 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:00:21,107 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:00:21,107 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:00:21,108 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:00:21,108 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:21,108 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:00:21,108 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:00:21,108 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_4-2a.c.cil.c_Iteration5_Loop [2025-03-09 07:00:21,108 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:00:21,108 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:00:21,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:21,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:00:21,170 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:00:21,170 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:00:21,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:21,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:21,172 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:21,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 07:00:21,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:21,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:21,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:21,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:21,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:21,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:21,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:21,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:21,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:00:21,192 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-09 07:00:21,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:21,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:21,194 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:21,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 07:00:21,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:00:21,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:00:21,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:00:21,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:00:21,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:00:21,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:00:21,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:00:21,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:00:21,208 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:00:21,210 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-09 07:00:21,210 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-09 07:00:21,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:00:21,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:00:21,211 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:00:21,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 07:00:21,213 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:00:21,213 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-09 07:00:21,213 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:00:21,213 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-09 07:00:21,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-09 07:00:21,219 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-09 07:00:21,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:00:21,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 07:00:21,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 07:00:21,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:21,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:21,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:00:21,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:21,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:00:21,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:00:21,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:00:21,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:00:21,264 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:00:21,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:00:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:00:21,265 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-09 07:00:21,266 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 42 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09 07:00:21,279 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 42 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 31 states and 45 transitions. Complement of second has 4 states. [2025-03-09 07:00:21,279 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-09 07:00:21,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-09 07:00:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-03-09 07:00:21,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 10 letters. Loop has 2 letters. [2025-03-09 07:00:21,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:21,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 12 letters. Loop has 2 letters. [2025-03-09 07:00:21,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:21,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 10 letters. Loop has 4 letters. [2025-03-09 07:00:21,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:00:21,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 45 transitions. [2025-03-09 07:00:21,280 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:00:21,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2025-03-09 07:00:21,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 07:00:21,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 07:00:21,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 07:00:21,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:00:21,281 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:00:21,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:00:21,281 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:00:21,281 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 07:00:21,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 07:00:21,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:00:21,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 07:00:21,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:00:21 BoogieIcfgContainer [2025-03-09 07:00:21,286 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:00:21,287 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:00:21,287 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:00:21,287 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:00:21,287 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:00:18" (3/4) ... [2025-03-09 07:00:21,289 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 07:00:21,289 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:00:21,289 INFO L158 Benchmark]: Toolchain (without parser) took 3497.53ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 74.5MB in the end (delta: 32.6MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2025-03-09 07:00:21,290 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory was 125.2MB in the beginning and 124.9MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:00:21,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.02ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 93.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-09 07:00:21,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.87ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:00:21,291 INFO L158 Benchmark]: Boogie Preprocessor took 43.22ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:00:21,291 INFO L158 Benchmark]: IcfgBuilder took 509.28ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 53.4MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-09 07:00:21,291 INFO L158 Benchmark]: BuchiAutomizer took 2673.39ms. Allocated memory is still 142.6MB. Free memory was 53.4MB in the beginning and 75.4MB in the end (delta: -22.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:00:21,291 INFO L158 Benchmark]: Witness Printer took 2.42ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 74.5MB in the end (delta: 858.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:00:21,292 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.18ms. Allocated memory is still 201.3MB. Free memory was 125.2MB in the beginning and 124.9MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.02ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 93.7MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.87ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 91.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.22ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 89.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 509.28ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 53.4MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 2673.39ms. Allocated memory is still 142.6MB. Free memory was 53.4MB in the beginning and 75.4MB in the end (delta: -22.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.42ms. Allocated memory is still 142.6MB. Free memory was 75.4MB in the beginning and 74.5MB in the end (delta: 858.6kB). 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 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 50 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, 346 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 341 mSDsluCounter, 378 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 348 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp60 ukn100 mio100 lsp100 div617 bol100 ite100 ukn100 eq135 hnf96 smp41 dnf100 smp100 tf104 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms 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-09 07:00:21,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 07:00:21,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE