./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/soft_float_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 f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:46:20,001 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:46:20,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:46:20,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:46:20,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:46:20,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:46:20,080 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:46:20,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:46:20,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:46:20,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:46:20,081 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:46:20,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:46:20,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:46:20,081 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:46:20,081 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:46:20,082 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:46:20,082 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:46:20,082 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:46:20,082 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:46:20,082 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:46:20,082 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:46:20,082 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:46:20,082 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:46:20,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:46:20,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:46:20,083 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:46:20,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:46:20,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:46:20,083 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:46:20,083 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:46:20,083 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:46:20,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:46:20,083 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:46:20,083 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:46:20,083 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:46:20,083 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:46:20,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:46:20,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:46:20,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:46:20,083 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:46:20,083 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 -> f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c [2025-03-04 15:46:20,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:46:20,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:46:20,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:46:20,316 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:46:20,316 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:46:20,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2025-03-04 15:46:21,458 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee078989/ddfbd6f9f58f41188e7125c72b8dd2fa/FLAG61f6f5b83 [2025-03-04 15:46:21,708 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:46:21,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2025-03-04 15:46:21,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee078989/ddfbd6f9f58f41188e7125c72b8dd2fa/FLAG61f6f5b83 [2025-03-04 15:46:21,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ee078989/ddfbd6f9f58f41188e7125c72b8dd2fa [2025-03-04 15:46:21,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:46:21,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:46:21,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:46:21,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:46:21,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:46:21,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59d5c0cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21, skipping insertion in model container [2025-03-04 15:46:21,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:46:21,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:46:21,886 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:46:21,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:46:21,930 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:46:21,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21 WrapperNode [2025-03-04 15:46:21,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:46:21,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:46:21,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:46:21,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:46:21,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,954 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 11, calls inlined = 9, statements flattened = 352 [2025-03-04 15:46:21,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:46:21,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:46:21,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:46:21,955 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:46:21,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,966 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,977 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:46:21,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,981 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:46:21,990 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:46:21,990 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:46:21,990 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:46:21,991 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (1/1) ... [2025-03-04 15:46:21,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:22,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:22,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:22,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-04 15:46:22,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:46:22,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:46:22,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:46:22,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:46:22,097 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:46:22,098 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:46:22,442 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-04 15:46:22,442 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:46:22,473 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:46:22,473 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:46:22,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:46:22 BoogieIcfgContainer [2025-03-04 15:46:22,473 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:46:22,474 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:46:22,474 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:46:22,479 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:46:22,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:46:22,479 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:46:21" (1/3) ... [2025-03-04 15:46:22,480 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@363df064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:46:22, skipping insertion in model container [2025-03-04 15:46:22,480 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:46:22,480 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:46:21" (2/3) ... [2025-03-04 15:46:22,480 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@363df064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:46:22, skipping insertion in model container [2025-03-04 15:46:22,480 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:46:22,480 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:46:22" (3/3) ... [2025-03-04 15:46:22,481 INFO L363 chiAutomizerObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2025-03-04 15:46:22,519 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:46:22,520 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:46:22,520 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:46:22,520 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:46:22,520 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:46:22,520 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:46:22,521 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:46:22,521 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:46:22,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 states, 116 states have (on average 1.5948275862068966) internal successors, (185), 116 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:22,541 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-03-04 15:46:22,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:22,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:22,547 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:46:22,547 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:22,547 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:46:22,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 states, 116 states have (on average 1.5948275862068966) internal successors, (185), 116 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:22,552 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-03-04 15:46:22,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:22,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:22,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-04 15:46:22,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:22,559 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(22, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-04 15:46:22,559 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-04 15:46:22,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:22,562 INFO L85 PathProgramCache]: Analyzing trace with hash 8587708, now seen corresponding path program 1 times [2025-03-04 15:46:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:22,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179524338] [2025-03-04 15:46:22,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:22,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:46:22,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:46:22,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:22,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:22,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:22,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179524338] [2025-03-04 15:46:22,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179524338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:46:22,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:46:22,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:46:22,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264841686] [2025-03-04 15:46:22,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:46:22,740 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:22,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:22,742 INFO L85 PathProgramCache]: Analyzing trace with hash 259136, now seen corresponding path program 1 times [2025-03-04 15:46:22,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:22,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464039651] [2025-03-04 15:46:22,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:22,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:22,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:22,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:22,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:22,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:22,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:22,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:22,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:22,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:22,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:22,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:22,798 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:22,799 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:22,799 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:22,799 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:22,799 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:22,801 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:22,801 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:22,801 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:22,801 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration1_Loop [2025-03-04 15:46:22,802 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:22,802 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:22,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:22,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:22,946 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:22,946 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:22,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:22,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:22,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:22,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-04 15:46:22,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:22,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:22,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-03-04 15:46:22,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:22,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:22,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:22,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-04 15:46:22,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:22,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:22,996 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:23,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-04 15:46:23,000 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:23,000 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:23,000 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:23,000 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:23,000 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:23,000 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,000 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:23,000 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:23,000 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration1_Loop [2025-03-04 15:46:23,000 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:23,000 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:23,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:23,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:23,100 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:23,103 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:23,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:23,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-04 15:46:23,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:23,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:23,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:23,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:23,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:23,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:23,126 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:23,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:23,129 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:23,136 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:23,137 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:23,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,143 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:23,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-04 15:46:23,145 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:23,146 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:23,147 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:23,147 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2025-03-04 15:46:23,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-04 15:46:23,156 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:23,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:23,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:46:23,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:46:23,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:23,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:23,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:23,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:23,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:23,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:23,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:23,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:23,255 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:46:23,257 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 117 states, 116 states have (on average 1.5948275862068966) internal successors, (185), 116 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:23,357 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 117 states, 116 states have (on average 1.5948275862068966) internal successors, (185), 116 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 348 states and 544 transitions. Complement of second has 6 states. [2025-03-04 15:46:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:46:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2025-03-04 15:46:23,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 360 transitions. Stem has 4 letters. Loop has 3 letters. [2025-03-04 15:46:23,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:23,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 360 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 15:46:23,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:23,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 360 transitions. Stem has 4 letters. Loop has 6 letters. [2025-03-04 15:46:23,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:23,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 348 states and 544 transitions. [2025-03-04 15:46:23,382 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 39 [2025-03-04 15:46:23,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 348 states to 122 states and 183 transitions. [2025-03-04 15:46:23,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2025-03-04 15:46:23,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2025-03-04 15:46:23,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 183 transitions. [2025-03-04 15:46:23,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:23,392 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 183 transitions. [2025-03-04 15:46:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 183 transitions. [2025-03-04 15:46:23,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 103. [2025-03-04 15:46:23,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.5436893203883495) internal successors, (159), 102 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:23,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 159 transitions. [2025-03-04 15:46:23,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 159 transitions. [2025-03-04 15:46:23,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:23,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:46:23,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:46:23,422 INFO L87 Difference]: Start difference. First operand 103 states and 159 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:23,495 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2025-03-04 15:46:23,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 70 transitions. [2025-03-04 15:46:23,496 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-03-04 15:46:23,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 70 transitions. [2025-03-04 15:46:23,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-03-04 15:46:23,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-03-04 15:46:23,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 70 transitions. [2025-03-04 15:46:23,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:46:23,499 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-03-04 15:46:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 70 transitions. [2025-03-04 15:46:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-04 15:46:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 48 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2025-03-04 15:46:23,500 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-03-04 15:46:23,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:46:23,503 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 70 transitions. [2025-03-04 15:46:23,503 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:46:23,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 70 transitions. [2025-03-04 15:46:23,504 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-03-04 15:46:23,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:23,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:23,506 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:23,506 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:23,506 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(22, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~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~ret19#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~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-04 15:46:23,506 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-04 15:46:23,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:23,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1863390416, now seen corresponding path program 1 times [2025-03-04 15:46:23,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:23,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152272855] [2025-03-04 15:46:23,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:23,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:23,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:23,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:23,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:23,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:23,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:23,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:23,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash 217430, now seen corresponding path program 1 times [2025-03-04 15:46:23,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:23,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758670500] [2025-03-04 15:46:23,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:23,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:23,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:23,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:23,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:23,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:23,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:23,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:23,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash 188605383, now seen corresponding path program 1 times [2025-03-04 15:46:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:23,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475368966] [2025-03-04 15:46:23,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:23,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:23,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:23,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:23,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:46:23,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:46:23,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:23,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:23,588 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:23,588 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:23,588 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:23,589 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:23,589 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:23,589 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,589 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:23,589 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:23,589 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration2_Loop [2025-03-04 15:46:23,589 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:23,589 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:23,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:23,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:23,683 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:23,683 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:23,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,686 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:23,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-04 15:46:23,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:23,689 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:23,704 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:46:23,704 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m#1=0} Honda state: {ULTIMATE.start_base2flt_~m#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:46:23,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:23,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:23,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-04 15:46:23,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:23,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:23,730 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-04 15:46:23,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,733 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:23,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-04 15:46:23,735 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:23,735 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:23,757 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:23,761 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-04 15:46:23,762 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:23,762 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:23,762 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:23,762 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:23,762 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:23,762 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,762 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:23,762 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:23,762 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration2_Loop [2025-03-04 15:46:23,762 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:23,762 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:23,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:23,769 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:23,855 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:23,855 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:23,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,857 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:23,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-04 15:46:23,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:23,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:23,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:23,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:23,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:23,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:23,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:23,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:23,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:23,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-04 15:46:23,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,883 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:23,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-04 15:46:23,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:23,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:23,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:23,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:23,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:23,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:23,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:23,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:23,898 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:23,901 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:23,901 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:23,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:23,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:23,903 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:23,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-04 15:46:23,906 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:23,906 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:23,906 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:23,906 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2025-03-04 15:46:23,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:23,913 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:23,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:23,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-04 15:46:23,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:23,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:23,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:23,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:23,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:23,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:23,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:23,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:23,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:23,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:23,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:23,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:23,985 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:46:23,986 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 70 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,017 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 70 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 96 states and 135 transitions. Complement of second has 5 states. [2025-03-04 15:46:24,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:46:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-04 15:46:24,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 15:46:24,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-04 15:46:24,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:46:24,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 135 transitions. [2025-03-04 15:46:24,023 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2025-03-04 15:46:24,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 89 states and 126 transitions. [2025-03-04 15:46:24,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2025-03-04 15:46:24,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2025-03-04 15:46:24,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 126 transitions. [2025-03-04 15:46:24,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:24,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 126 transitions. [2025-03-04 15:46:24,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 126 transitions. [2025-03-04 15:46:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2025-03-04 15:46:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 51 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-03-04 15:46:24,027 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-03-04 15:46:24,027 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-03-04 15:46:24,027 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-04 15:46:24,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 74 transitions. [2025-03-04 15:46:24,028 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2025-03-04 15:46:24,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:24,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:24,028 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:24,028 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:24,028 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(22, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~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~ret19#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~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" [2025-03-04 15:46:24,028 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2;" [2025-03-04 15:46:24,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1863390415, now seen corresponding path program 1 times [2025-03-04 15:46:24,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:24,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842490256] [2025-03-04 15:46:24,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:24,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:24,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:24,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:24,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:24,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:24,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842490256] [2025-03-04 15:46:24,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842490256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:46:24,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:46:24,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:46:24,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73838717] [2025-03-04 15:46:24,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:46:24,075 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:24,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash 227332, now seen corresponding path program 1 times [2025-03-04 15:46:24,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:24,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479623067] [2025-03-04 15:46:24,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:24,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:24,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:24,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:24,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:24,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:24,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:24,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:24,115 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:24,115 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:24,115 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:24,115 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:24,115 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:24,116 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,116 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:24,116 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:24,116 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration3_Loop [2025-03-04 15:46:24,116 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:24,116 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:24,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,191 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:24,191 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:24,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,193 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:24,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-04 15:46:24,195 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:24,195 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:24,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-04 15:46:24,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,217 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:24,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-04 15:46:24,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:24,219 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:24,240 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:24,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:24,244 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:24,244 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:24,244 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:24,244 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:24,244 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:24,244 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,244 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:24,244 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:24,244 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration3_Loop [2025-03-04 15:46:24,244 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:24,244 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:24,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,313 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:24,313 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:24,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,315 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:24,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-04 15:46:24,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:24,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:24,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:24,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:24,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:24,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:24,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:24,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:24,333 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:24,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-04 15:46:24,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,341 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:24,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-04 15:46:24,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:24,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:24,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:24,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:24,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:24,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:24,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:24,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:24,356 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:24,358 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:24,358 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:24,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,361 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:24,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-04 15:46:24,363 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:24,363 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:24,363 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:24,363 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2025-03-04 15:46:24,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:24,370 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:24,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:46:24,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:46:24,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:24,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:24,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:24,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:24,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:24,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:24,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:24,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:24,416 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 15:46:24,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 74 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,441 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 74 transitions. cyclomatic complexity: 28. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 98 states and 138 transitions. Complement of second has 5 states. [2025-03-04 15:46:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:46:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-04 15:46:24,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 77 transitions. Stem has 7 letters. Loop has 3 letters. [2025-03-04 15:46:24,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 77 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-04 15:46:24,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 77 transitions. Stem has 7 letters. Loop has 6 letters. [2025-03-04 15:46:24,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 138 transitions. [2025-03-04 15:46:24,446 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2025-03-04 15:46:24,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 91 states and 129 transitions. [2025-03-04 15:46:24,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2025-03-04 15:46:24,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2025-03-04 15:46:24,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 129 transitions. [2025-03-04 15:46:24,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:24,448 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-03-04 15:46:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 129 transitions. [2025-03-04 15:46:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 55. [2025-03-04 15:46:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 54 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2025-03-04 15:46:24,450 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 78 transitions. [2025-03-04 15:46:24,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:24,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:46:24,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:46:24,451 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:24,498 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2025-03-04 15:46:24,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 71 transitions. [2025-03-04 15:46:24,499 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-03-04 15:46:24,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 71 transitions. [2025-03-04 15:46:24,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-03-04 15:46:24,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-03-04 15:46:24,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2025-03-04 15:46:24,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:24,500 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-03-04 15:46:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2025-03-04 15:46:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2025-03-04 15:46:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 48 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2025-03-04 15:46:24,502 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 67 transitions. [2025-03-04 15:46:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:46:24,503 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 67 transitions. [2025-03-04 15:46:24,503 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-04 15:46:24,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 67 transitions. [2025-03-04 15:46:24,504 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-03-04 15:46:24,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:24,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:24,504 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:24,504 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:24,504 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(22, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~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~ret19#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~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 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;" "assume true;" "assume base2flt_~e#1 <= -128;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_~one~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" [2025-03-04 15:46:24,504 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2;" [2025-03-04 15:46:24,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,504 INFO L85 PathProgramCache]: Analyzing trace with hash 923580904, now seen corresponding path program 1 times [2025-03-04 15:46:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:24,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115403385] [2025-03-04 15:46:24,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:24,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:46:24,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:46:24,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:24,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:24,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115403385] [2025-03-04 15:46:24,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115403385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:46:24,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:46:24,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:46:24,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284375232] [2025-03-04 15:46:24,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:46:24,560 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:24,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,560 INFO L85 PathProgramCache]: Analyzing trace with hash 185626, now seen corresponding path program 1 times [2025-03-04 15:46:24,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:24,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051852802] [2025-03-04 15:46:24,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:24,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:24,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:24,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:24,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,565 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:24,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:24,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:24,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:24,571 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:24,596 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:24,596 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:24,596 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:24,596 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:24,596 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:24,596 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,596 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:24,597 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:24,597 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration4_Loop [2025-03-04 15:46:24,597 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:24,597 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:24,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,664 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:24,664 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:24,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,666 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:24,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-04 15:46:24,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:24,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:24,684 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-04 15:46:24,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,685 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:24,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-04 15:46:24,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:24,687 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:24,708 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:24,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-04 15:46:24,712 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:24,712 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:24,712 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:24,712 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:24,712 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:24,712 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,712 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:24,712 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:24,712 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration4_Loop [2025-03-04 15:46:24,712 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:24,712 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:24,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:24,775 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:24,776 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:24,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,778 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:24,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-04 15:46:24,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:24,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:24,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:24,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:24,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:24,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:24,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:24,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:24,793 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:24,795 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:24,795 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:24,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:24,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:24,797 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:24,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-04 15:46:24,799 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:24,800 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:24,800 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:24,800 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2025-03-04 15:46:24,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:24,806 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:24,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:46:24,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:46:24,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:24,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:24,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:24,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:24,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:24,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:24,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:24,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:24,859 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 15:46:24,859 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 67 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,904 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 67 transitions. cyclomatic complexity: 23. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 77 states and 103 transitions. Complement of second has 5 states. [2025-03-04 15:46:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:46:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-03-04 15:46:24,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-04 15:46:24,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 16 letters. Loop has 3 letters. [2025-03-04 15:46:24,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-04 15:46:24,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:24,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 103 transitions. [2025-03-04 15:46:24,906 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2025-03-04 15:46:24,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 70 states and 94 transitions. [2025-03-04 15:46:24,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-03-04 15:46:24,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-03-04 15:46:24,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 94 transitions. [2025-03-04 15:46:24,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:24,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 94 transitions. [2025-03-04 15:46:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 94 transitions. [2025-03-04 15:46:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2025-03-04 15:46:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 51 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2025-03-04 15:46:24,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 71 transitions. [2025-03-04 15:46:24,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:24,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:46:24,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:46:24,909 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:24,938 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2025-03-04 15:46:24,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 72 transitions. [2025-03-04 15:46:24,938 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-03-04 15:46:24,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 53 states and 71 transitions. [2025-03-04 15:46:24,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2025-03-04 15:46:24,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-03-04 15:46:24,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2025-03-04 15:46:24,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:24,939 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-03-04 15:46:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2025-03-04 15:46:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-03-04 15:46:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 51 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2025-03-04 15:46:24,940 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 70 transitions. [2025-03-04 15:46:24,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:46:24,941 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 70 transitions. [2025-03-04 15:46:24,941 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-04 15:46:24,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 70 transitions. [2025-03-04 15:46:24,942 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-03-04 15:46:24,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:24,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:24,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:24,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:24,942 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(22, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~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~ret19#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~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 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;" "assume true;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" "assume true;" "assume base2flt_~e#1 <= -128;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_~one~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-04 15:46:24,942 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-04 15:46:24,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:24,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2081334590, now seen corresponding path program 1 times [2025-03-04 15:46:24,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:24,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361087258] [2025-03-04 15:46:24,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:24,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:24,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:46:24,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:46:24,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-04 15:46:24,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:24,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:24,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-04 15:46:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:25,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:25,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361087258] [2025-03-04 15:46:25,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361087258] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:46:25,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775650990] [2025-03-04 15:46:25,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:25,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:46:25,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,011 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 15:46:25,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:46:25,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:46:25,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:25,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:25,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:25,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:46:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:25,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775650990] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:46:25,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:46:25,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 15:46:25,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653236199] [2025-03-04 15:46:25,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:46:25,094 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:25,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:25,095 INFO L85 PathProgramCache]: Analyzing trace with hash 175724, now seen corresponding path program 1 times [2025-03-04 15:46:25,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:25,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729349965] [2025-03-04 15:46:25,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:25,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:25,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:25,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:25,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:25,101 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:25,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:25,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:25,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:25,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:25,132 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:25,132 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:25,132 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:25,132 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:25,132 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:25,133 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,133 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:25,133 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:25,133 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration5_Loop [2025-03-04 15:46:25,133 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:25,133 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:25,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,222 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:25,223 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:25,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,225 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-04 15:46:25,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:25,232 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:25,247 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:46:25,247 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m#1=0} Honda state: {ULTIMATE.start_base2flt_~m#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:46:25,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:25,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,254 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-04 15:46:25,256 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:25,256 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:25,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-04 15:46:25,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,275 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-04 15:46:25,278 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:25,278 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:25,300 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:25,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-04 15:46:25,305 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:25,305 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:25,305 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:25,305 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:25,305 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:25,305 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,305 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:25,305 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:25,305 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration5_Loop [2025-03-04 15:46:25,305 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:25,305 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:25,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,383 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:25,383 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:25,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,385 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-04 15:46:25,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:25,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:25,397 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:25,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:25,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:25,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:25,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:25,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:25,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:25,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-04 15:46:25,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,409 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-04 15:46:25,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:25,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:25,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:25,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:25,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:25,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:25,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:25,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:25,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:25,425 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:25,425 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:25,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,427 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-04 15:46:25,429 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:25,429 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:25,429 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:25,429 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2025-03-04 15:46:25,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-04 15:46:25,435 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:25,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:25,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:46:25,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:46:25,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:25,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:25,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:25,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:25,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:25,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:25,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:25,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:25,501 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:46:25,501 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 70 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:25,524 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 70 transitions. cyclomatic complexity: 23. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 81 states and 107 transitions. Complement of second has 5 states. [2025-03-04 15:46:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:46:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 15:46:25,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 16 letters. Loop has 3 letters. [2025-03-04 15:46:25,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:25,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 19 letters. Loop has 3 letters. [2025-03-04 15:46:25,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:25,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 16 letters. Loop has 6 letters. [2025-03-04 15:46:25,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:25,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2025-03-04 15:46:25,526 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-03-04 15:46:25,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 74 states and 98 transitions. [2025-03-04 15:46:25,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-03-04 15:46:25,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2025-03-04 15:46:25,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 98 transitions. [2025-03-04 15:46:25,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:25,526 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 98 transitions. [2025-03-04 15:46:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 98 transitions. [2025-03-04 15:46:25,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2025-03-04 15:46:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 54 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:25,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2025-03-04 15:46:25,528 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 74 transitions. [2025-03-04 15:46:25,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:25,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:46:25,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:46:25,529 INFO L87 Difference]: Start difference. First operand 55 states and 74 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:25,583 INFO L93 Difference]: Finished difference Result 92 states and 126 transitions. [2025-03-04 15:46:25,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 126 transitions. [2025-03-04 15:46:25,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:46:25,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 86 states and 120 transitions. [2025-03-04 15:46:25,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-03-04 15:46:25,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2025-03-04 15:46:25,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 120 transitions. [2025-03-04 15:46:25,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:25,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 120 transitions. [2025-03-04 15:46:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 120 transitions. [2025-03-04 15:46:25,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 63. [2025-03-04 15:46:25,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 62 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2025-03-04 15:46:25,591 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 85 transitions. [2025-03-04 15:46:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:46:25,595 INFO L432 stractBuchiCegarLoop]: Abstraction has 63 states and 85 transitions. [2025-03-04 15:46:25,595 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-04 15:46:25,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 85 transitions. [2025-03-04 15:46:25,595 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-04 15:46:25,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:25,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:25,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:25,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:25,600 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(22, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~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~ret19#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~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 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;" "assume true;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_#t~bitwise4#1 := 0;" "base2flt_~m#1 := base2flt_#t~bitwise4#1;havoc base2flt_#t~bitwise4#1;" "assume 0 == base2flt_~m#1 % 4294967296 || base2flt_~m#1 % 4294967296 == 16777216 * ((128 + base2flt_~e#1) % 4294967296) % 4294967296;base2flt_#t~bitwise5#1 := 16777216 * ((128 + base2flt_~e#1) % 4294967296);" "base2flt_~res~0#1 := base2flt_#t~bitwise5#1;havoc base2flt_#t~bitwise5#1;base2flt_~__retres4~0#1 := base2flt_~res~0#1;" "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_~one~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;" "main_#t~ret21#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-04 15:46:25,600 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2025-03-04 15:46:25,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:25,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1449650968, now seen corresponding path program 1 times [2025-03-04 15:46:25,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:25,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977554319] [2025-03-04 15:46:25,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:25,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:25,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:46:25,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:46:25,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:25,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:25,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:25,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977554319] [2025-03-04 15:46:25,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977554319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:46:25,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:46:25,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:46:25,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624105348] [2025-03-04 15:46:25,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:46:25,645 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:25,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:25,645 INFO L85 PathProgramCache]: Analyzing trace with hash 134018, now seen corresponding path program 1 times [2025-03-04 15:46:25,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:25,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927692913] [2025-03-04 15:46:25,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:25,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:25,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:25,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:25,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:25,649 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:25,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:25,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:25,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:25,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:25,672 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:25,672 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:25,672 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:25,672 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:25,672 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:25,672 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,672 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:25,672 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:25,672 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration6_Loop [2025-03-04 15:46:25,672 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:25,672 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:25,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,753 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:25,753 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:25,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,755 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-04 15:46:25,757 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:25,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:25,772 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-03-04 15:46:25,772 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m#1=0} Honda state: {ULTIMATE.start_base2flt_~m#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-03-04 15:46:25,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-04 15:46:25,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,778 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-04 15:46:25,780 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:25,780 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:25,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:25,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,798 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-04 15:46:25,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:25,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:25,821 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:25,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-04 15:46:25,825 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:25,825 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:25,825 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:25,825 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:25,825 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:25,825 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,825 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:25,825 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:25,825 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration6_Loop [2025-03-04 15:46:25,825 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:25,825 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:25,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:25,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:25,904 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:25,905 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:25,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,906 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-04 15:46:25,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:25,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:25,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:25,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:25,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:25,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:25,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:25,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:25,921 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:25,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-04 15:46:25,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,928 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-04 15:46:25,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:25,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:25,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:25,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:25,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:25,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:25,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:25,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:25,942 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:25,943 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:25,943 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:25,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:25,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:25,945 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:25,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-04 15:46:25,946 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:25,946 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:25,946 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:25,946 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2025-03-04 15:46:25,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-04 15:46:25,952 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:25,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:25,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:46:25,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:46:25,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:25,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:25,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:25,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:26,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:26,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:26,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:26,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:26,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:26,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:26,017 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-04 15:46:26,017 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 85 transitions. cyclomatic complexity: 27 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:26,031 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 85 transitions. cyclomatic complexity: 27. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 67 states and 89 transitions. Complement of second has 4 states. [2025-03-04 15:46:26,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:46:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-03-04 15:46:26,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 21 letters. Loop has 3 letters. [2025-03-04 15:46:26,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:26,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 24 letters. Loop has 3 letters. [2025-03-04 15:46:26,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:26,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 21 letters. Loop has 6 letters. [2025-03-04 15:46:26,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:26,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2025-03-04 15:46:26,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:46:26,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 60 states and 81 transitions. [2025-03-04 15:46:26,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2025-03-04 15:46:26,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2025-03-04 15:46:26,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2025-03-04 15:46:26,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:26,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 81 transitions. [2025-03-04 15:46:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2025-03-04 15:46:26,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-04 15:46:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.35) internal successors, (81), 59 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2025-03-04 15:46:26,034 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 81 transitions. [2025-03-04 15:46:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:26,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:46:26,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:46:26,034 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:26,089 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2025-03-04 15:46:26,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2025-03-04 15:46:26,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:46:26,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2025-03-04 15:46:26,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2025-03-04 15:46:26,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2025-03-04 15:46:26,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2025-03-04 15:46:26,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-04 15:46:26,090 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-03-04 15:46:26,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2025-03-04 15:46:26,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2025-03-04 15:46:26,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 61 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2025-03-04 15:46:26,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 83 transitions. [2025-03-04 15:46:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:46:26,094 INFO L432 stractBuchiCegarLoop]: Abstraction has 62 states and 83 transitions. [2025-03-04 15:46:26,094 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-04 15:46:26,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 83 transitions. [2025-03-04 15:46:26,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-04 15:46:26,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:46:26,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:46:26,095 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:46:26,095 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:46:26,095 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(22, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~ret19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;havoc main_#t~nondet15#1;main_~ma~2#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_#t~nondet16#1;main_~ea~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~b~0#1;havoc main_#t~nondet17#1;main_~mb~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_#t~nondet18#1;main_~eb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~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~ret19#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~ret19#1;havoc main_#t~ret19#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 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;" "assume true;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume 4278190079 == base2flt_~m#1 % 4294967296;base2flt_#t~bitwise4#1 := base2flt_~m#1;" "base2flt_~m#1 := base2flt_#t~bitwise4#1;havoc base2flt_#t~bitwise4#1;" "assume 0 == base2flt_~m#1 % 4294967296 || base2flt_~m#1 % 4294967296 == 16777216 * ((128 + base2flt_~e#1) % 4294967296) % 4294967296;base2flt_#t~bitwise5#1 := 16777216 * ((128 + base2flt_~e#1) % 4294967296);" "base2flt_~res~0#1 := base2flt_#t~bitwise5#1;havoc base2flt_#t~bitwise5#1;base2flt_~__retres4~0#1 := base2flt_~res~0#1;" "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_~one~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0;" "base2flt_#res#1 := base2flt_~__retres4~0#1;" "main_#t~ret21#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret21#1;havoc main_#t~ret21#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1;" "assume !(0 == base2flt_~m#1 % 4294967296);" "assume !(base2flt_~m#1 % 4294967296 < 16777216);" [2025-03-04 15:46:26,095 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2;" [2025-03-04 15:46:26,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:26,095 INFO L85 PathProgramCache]: Analyzing trace with hash -335286986, now seen corresponding path program 1 times [2025-03-04 15:46:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:26,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125955328] [2025-03-04 15:46:26,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:26,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:26,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:46:26,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:46:26,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:26,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:26,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:46:26,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125955328] [2025-03-04 15:46:26,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125955328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:46:26,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:46:26,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:46:26,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466951137] [2025-03-04 15:46:26,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:46:26,167 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-04 15:46:26,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:26,168 INFO L85 PathProgramCache]: Analyzing trace with hash 143920, now seen corresponding path program 1 times [2025-03-04 15:46:26,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:46:26,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736687736] [2025-03-04 15:46:26,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:46:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:46:26,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:26,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:26,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:26,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:26,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:46:26,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:26,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:26,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:26,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:46:26,175 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:46:26,195 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:26,196 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:26,196 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:26,196 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:26,196 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-03-04 15:46:26,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:26,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:26,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:26,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration7_Loop [2025-03-04 15:46:26,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:26,196 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:26,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:26,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:26,262 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:26,262 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-03-04 15:46:26,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:26,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:26,264 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:26,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-04 15:46:26,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-03-04 15:46:26,266 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:26,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:26,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:26,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:26,296 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:26,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-04 15:46:26,298 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-03-04 15:46:26,298 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-03-04 15:46:26,316 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-03-04 15:46:26,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-04 15:46:26,320 INFO L204 LassoAnalysis]: Preferences: [2025-03-04 15:46:26,320 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-04 15:46:26,320 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-04 15:46:26,320 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-04 15:46:26,320 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-04 15:46:26,320 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:26,320 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-04 15:46:26,320 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-04 15:46:26,320 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration7_Loop [2025-03-04 15:46:26,320 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-04 15:46:26,320 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-04 15:46:26,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:26,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-04 15:46:26,388 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-04 15:46:26,388 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-04 15:46:26,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:26,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:26,390 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:26,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-04 15:46:26,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:26,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:26,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:26,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:26,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:26,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:26,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:26,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:26,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-04 15:46:26,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:26,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:26,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:26,415 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:26,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-04 15:46:26,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-04 15:46:26,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-04 15:46:26,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-04 15:46:26,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-04 15:46:26,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-04 15:46:26,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-04 15:46:26,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-04 15:46:26,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-04 15:46:26,430 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-04 15:46:26,432 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-03-04 15:46:26,432 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-03-04 15:46:26,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:46:26,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:46:26,434 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-04 15:46:26,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-04 15:46:26,437 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-04 15:46:26,437 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-03-04 15:46:26,437 INFO L474 LassoAnalysis]: Proved termination. [2025-03-04 15:46:26,437 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2025-03-04 15:46:26,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-04 15:46:26,444 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-03-04 15:46:26,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:46:26,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:46:26,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:46:26,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:26,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:26,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:46:26,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:26,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:46:26,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:46:26,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:46:26,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:46:26,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:46:26,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:46:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:46:26,495 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-04 15:46:26,495 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 83 transitions. cyclomatic complexity: 25 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:26,503 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 83 transitions. cyclomatic complexity: 25. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 65 states and 87 transitions. Complement of second has 4 states. [2025-03-04 15:46:26,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-04 15:46:26,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:26,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-03-04 15:46:26,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 22 letters. Loop has 3 letters. [2025-03-04 15:46:26,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:26,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 25 letters. Loop has 3 letters. [2025-03-04 15:46:26,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:26,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 22 letters. Loop has 6 letters. [2025-03-04 15:46:26,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-04 15:46:26,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 87 transitions. [2025-03-04 15:46:26,505 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:46:26,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2025-03-04 15:46:26,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:46:26,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:46:26,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:46:26,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:46:26,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:26,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:26,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:46:26,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:46:26,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:46:26,506 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:46:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:46:26,506 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-03-04 15:46:26,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-03-04 15:46:26,506 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:46:26,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 15:46:26,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-04 15:46:26,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-04 15:46:26,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-04 15:46:26,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:46:26,506 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:26,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:26,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:46:26,506 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 15:46:26,506 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-04 15:46:26,506 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-04 15:46:26,506 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-04 15:46:26,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-04 15:46:26,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:46:26 BoogieIcfgContainer [2025-03-04 15:46:26,513 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:46:26,513 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:46:26,513 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:46:26,513 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:46:26,514 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:46:22" (3/4) ... [2025-03-04 15:46:26,515 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 15:46:26,516 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:46:26,516 INFO L158 Benchmark]: Toolchain (without parser) took 4770.87ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 51.0MB in the end (delta: 55.0MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2025-03-04 15:46:26,517 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:46:26,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.09ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 93.1MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:46:26,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.20ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 90.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:46:26,517 INFO L158 Benchmark]: Boogie Preprocessor took 34.49ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:46:26,517 INFO L158 Benchmark]: IcfgBuilder took 483.81ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 56.6MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 15:46:26,517 INFO L158 Benchmark]: BuchiAutomizer took 4038.78ms. Allocated memory is still 142.6MB. Free memory was 56.6MB in the beginning and 52.1MB in the end (delta: 4.6MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2025-03-04 15:46:26,517 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 142.6MB. Free memory was 52.1MB in the beginning and 51.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:46:26,519 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.22ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.09ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 93.1MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.20ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 90.1MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.49ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 483.81ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 56.6MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 4038.78ms. Allocated memory is still 142.6MB. Free memory was 56.6MB in the beginning and 52.1MB in the end (delta: 4.6MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 142.6MB. Free memory was 52.1MB in the beginning and 51.0MB in the end (delta: 1.1MB). 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 13 terminating modules (6 trivial, 7 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) + 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) + 255) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * e) + 253) and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 164 StatesRemovedByMinimization, 9 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 [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 649 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 642 mSDsluCounter, 1036 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 221 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 383 IncrementalHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 815 mSDtfsCounter, 383 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital23 mio100 ax100 hnf100 lsp60 ukn100 mio100 lsp100 div616 bol100 ite100 ukn100 eq134 hnf96 smp41 dnf100 smp100 tf104 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 42ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-04 15:46:26,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:26,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-04 15:46:26,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 15:46:27,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE