./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/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.2.5-dev-4a390ef-m [2024-10-25 00:01:18,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:01:18,317 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:01:18,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:01:18,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:01:18,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:01:18,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:01:18,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:01:18,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:01:18,358 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:01:18,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:01:18,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:01:18,359 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:01:18,360 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:01:18,360 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:01:18,360 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:01:18,361 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:01:18,361 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:01:18,362 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:01:18,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:01:18,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:01:18,363 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:01:18,363 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:01:18,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:01:18,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:01:18,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:01:18,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:01:18,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:01:18,366 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:01:18,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:01:18,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:01:18,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:01:18,367 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:01:18,367 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:01:18,367 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:01:18,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:01:18,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:01:18,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:01:18,369 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:01:18,369 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-10-25 00:01:18,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:01:18,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:01:18,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:01:18,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:01:18,657 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:01:18,658 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2024-10-25 00:01:20,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:01:20,414 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:01:20,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2024-10-25 00:01:20,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ecc083a5/5ff7db6306ac4068b04d79394ddbbc3a/FLAGfb49ab2e5 [2024-10-25 00:01:20,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ecc083a5/5ff7db6306ac4068b04d79394ddbbc3a [2024-10-25 00:01:20,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:01:20,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:01:20,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:01:20,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:01:20,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:01:20,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:01:20" (1/1) ... [2024-10-25 00:01:20,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548e393c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:20, skipping insertion in model container [2024-10-25 00:01:20,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:01:20" (1/1) ... [2024-10-25 00:01:20,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:01:21,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:01:21,080 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:01:21,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:01:21,135 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:01:21,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21 WrapperNode [2024-10-25 00:01:21,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:01:21,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:01:21,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:01:21,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:01:21,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (1/1) ... [2024-10-25 00:01:21,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (1/1) ... [2024-10-25 00:01:21,180 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 11, calls inlined = 9, statements flattened = 376 [2024-10-25 00:01:21,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:01:21,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:01:21,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:01:21,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:01:21,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (1/1) ... [2024-10-25 00:01:21,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (1/1) ... [2024-10-25 00:01:21,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (1/1) ... [2024-10-25 00:01:21,228 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]. [2024-10-25 00:01:21,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (1/1) ... [2024-10-25 00:01:21,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (1/1) ... [2024-10-25 00:01:21,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (1/1) ... [2024-10-25 00:01:21,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (1/1) ... [2024-10-25 00:01:21,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (1/1) ... [2024-10-25 00:01:21,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (1/1) ... [2024-10-25 00:01:21,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:01:21,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:01:21,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:01:21,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:01:21,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (1/1) ... [2024-10-25 00:01:21,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:21,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:21,298 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) [2024-10-25 00:01:21,301 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 [2024-10-25 00:01:21,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:01:21,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:01:21,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:01:21,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:01:21,419 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:01:21,421 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:01:21,892 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-10-25 00:01:21,893 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:01:21,910 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:01:21,910 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-25 00:01:21,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:01:21 BoogieIcfgContainer [2024-10-25 00:01:21,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:01:21,911 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:01:21,911 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:01:21,915 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:01:21,915 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:01:21,915 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:01:20" (1/3) ... [2024-10-25 00:01:21,916 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33857f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:01:21, skipping insertion in model container [2024-10-25 00:01:21,916 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:01:21,916 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:01:21" (2/3) ... [2024-10-25 00:01:21,917 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@33857f3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:01:21, skipping insertion in model container [2024-10-25 00:01:21,917 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:01:21,917 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:01:21" (3/3) ... [2024-10-25 00:01:21,918 INFO L332 chiAutomizerObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2024-10-25 00:01:21,978 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:01:21,978 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:01:21,978 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:01:21,978 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:01:21,978 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:01:21,978 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:01:21,978 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:01:21,979 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:01:21,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 states, 116 states have (on average 1.6637931034482758) internal successors, (193), 116 states have internal predecessors, (193), 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) [2024-10-25 00:01:22,004 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2024-10-25 00:01:22,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:01:22,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:01:22,012 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-25 00:01:22,013 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:01:22,013 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:01:22,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 117 states, 116 states have (on average 1.6637931034482758) internal successors, (193), 116 states have internal predecessors, (193), 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) [2024-10-25 00:01:22,020 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2024-10-25 00:01:22,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:01:22,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:01:22,020 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-25 00:01:22,020 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:01:22,027 INFO L745 eck$LassoCheckResult]: Stem: 30#$Ultimate##0true 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); 40#L-1true 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; 77#L29true assume !(0 == base2flt_~m#1 % 4294967296); 98#L35true assume !(base2flt_~m#1 % 4294967296 < 16777216); 56#L57-2true [2024-10-25 00:01:22,027 INFO L747 eck$LassoCheckResult]: Loop: 56#L57-2true assume !false; 39#L58true assume base2flt_~m#1 % 4294967296 >= 33554432; 88#L59true assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2; 56#L57-2true [2024-10-25 00:01:22,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:22,032 INFO L85 PathProgramCache]: Analyzing trace with hash 925696, now seen corresponding path program 1 times [2024-10-25 00:01:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:22,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743588319] [2024-10-25 00:01:22,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:22,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:22,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:01:22,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743588319] [2024-10-25 00:01:22,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743588319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:01:22,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:01:22,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 00:01:22,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117152053] [2024-10-25 00:01:22,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:01:22,344 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:01:22,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:22,346 INFO L85 PathProgramCache]: Analyzing trace with hash 74612, now seen corresponding path program 1 times [2024-10-25 00:01:22,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:22,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740995587] [2024-10-25 00:01:22,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:22,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:22,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:01:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:22,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:01:22,454 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:22,454 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:22,455 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:22,455 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:22,455 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:01:22,455 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:22,455 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:22,455 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:22,455 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration1_Loop [2024-10-25 00:01:22,455 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:22,456 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:22,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:22,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:22,619 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:22,620 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:01:22,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:22,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:22,625 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) [2024-10-25 00:01:22,628 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 [2024-10-25 00:01:22,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:01:22,629 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:22,662 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 [2024-10-25 00:01:22,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:22,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:22,666 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) [2024-10-25 00:01:22,668 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 [2024-10-25 00:01:22,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:01:22,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:22,698 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:01:22,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-25 00:01:22,703 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:22,703 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:22,703 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:22,703 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:22,703 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:01:22,703 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:22,703 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:22,703 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:22,703 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration1_Loop [2024-10-25 00:01:22,704 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:22,704 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:22,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:22,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:22,812 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:22,816 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:01:22,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:22,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:22,820 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) [2024-10-25 00:01:22,822 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 [2024-10-25 00:01:22,824 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 [2024-10-25 00:01:22,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:01:22,838 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:01:22,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:01:22,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:01:22,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:01:22,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:01:22,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:01:22,844 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:01:22,848 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:01:22,849 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:01:22,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:22,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:22,880 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) [2024-10-25 00:01:22,882 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 [2024-10-25 00:01:22,884 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:01:22,884 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:01:22,884 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:01:22,885 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2024-10-25 00:01:22,900 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 [2024-10-25 00:01:22,904 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:01:22,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:22,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:01:22,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:22,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:01:22,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:22,998 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 [2024-10-25 00:01:23,001 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 117 states, 116 states have (on average 1.6637931034482758) internal successors, (193), 116 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:01:23,114 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 117 states, 116 states have (on average 1.6637931034482758) internal successors, (193), 116 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 347 states and 564 transitions. Complement of second has 6 states. [2024-10-25 00:01:23,118 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 [2024-10-25 00:01:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 00:01:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 372 transitions. [2024-10-25 00:01:23,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 372 transitions. Stem has 4 letters. Loop has 3 letters. [2024-10-25 00:01:23,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:23,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 372 transitions. Stem has 7 letters. Loop has 3 letters. [2024-10-25 00:01:23,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:23,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 372 transitions. Stem has 4 letters. Loop has 6 letters. [2024-10-25 00:01:23,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:23,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 347 states and 564 transitions. [2024-10-25 00:01:23,141 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 39 [2024-10-25 00:01:23,149 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 347 states to 121 states and 186 transitions. [2024-10-25 00:01:23,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2024-10-25 00:01:23,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2024-10-25 00:01:23,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 186 transitions. [2024-10-25 00:01:23,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:01:23,152 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 186 transitions. [2024-10-25 00:01:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 186 transitions. [2024-10-25 00:01:23,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2024-10-25 00:01:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.5825242718446602) internal successors, (163), 102 states have internal predecessors, (163), 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) [2024-10-25 00:01:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 163 transitions. [2024-10-25 00:01:23,189 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 163 transitions. [2024-10-25 00:01:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:01:23,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:01:23,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:01:23,193 INFO L87 Difference]: Start difference. First operand 103 states and 163 transitions. Second operand has 3 states, 2 states have (on average 2.0) 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) [2024-10-25 00:01:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:01:23,284 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2024-10-25 00:01:23,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 70 transitions. [2024-10-25 00:01:23,285 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2024-10-25 00:01:23,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 70 transitions. [2024-10-25 00:01:23,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-10-25 00:01:23,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-10-25 00:01:23,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 70 transitions. [2024-10-25 00:01:23,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:01:23,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-10-25 00:01:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 70 transitions. [2024-10-25 00:01:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-25 00:01:23,289 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) [2024-10-25 00:01:23,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-10-25 00:01:23,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-10-25 00:01:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:01:23,291 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-10-25 00:01:23,291 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:01:23,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 70 transitions. [2024-10-25 00:01:23,293 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2024-10-25 00:01:23,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:01:23,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:01:23,293 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:01:23,295 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:01:23,295 INFO L745 eck$LassoCheckResult]: Stem: 696#$Ultimate##0 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); 697#L-1 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; 692#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 693#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 688#base2flt_returnLabel#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; 689#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 702#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 695#L47-3 [2024-10-25 00:01:23,296 INFO L747 eck$LassoCheckResult]: Loop: 695#L47-3 assume !false; 690#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296); 691#L47-2 assume base2flt_~m#1 % 4294967296 < 16777216; 695#L47-3 [2024-10-25 00:01:23,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:23,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1807397383, now seen corresponding path program 1 times [2024-10-25 00:01:23,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:23,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213733276] [2024-10-25 00:01:23,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:23,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:23,312 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:01:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:23,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:01:23,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:23,336 INFO L85 PathProgramCache]: Analyzing trace with hash 136237, now seen corresponding path program 1 times [2024-10-25 00:01:23,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:23,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236234992] [2024-10-25 00:01:23,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:23,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:23,343 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:01:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:23,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:01:23,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:23,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1829446553, now seen corresponding path program 1 times [2024-10-25 00:01:23,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:23,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560685075] [2024-10-25 00:01:23,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:23,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:23,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:01:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:23,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:01:23,419 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:23,419 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:23,419 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:23,419 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:23,420 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:01:23,420 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:23,420 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:23,420 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:23,420 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration2_Loop [2024-10-25 00:01:23,420 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:23,420 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:23,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:23,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:23,536 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:23,537 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:01:23,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:23,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:23,538 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) [2024-10-25 00:01:23,541 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 [2024-10-25 00:01:23,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:01:23,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:23,569 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:01:23,569 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: [] [2024-10-25 00:01:23,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-25 00:01:23,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:23,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:23,578 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) [2024-10-25 00:01:23,580 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 [2024-10-25 00:01:23,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:01:23,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:23,602 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 [2024-10-25 00:01:23,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:23,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:23,604 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) [2024-10-25 00:01:23,604 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 [2024-10-25 00:01:23,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:01:23,606 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:23,639 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:01:23,647 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 [2024-10-25 00:01:23,648 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:23,648 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:23,648 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:23,648 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:23,648 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:01:23,648 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:23,648 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:23,648 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:23,648 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration2_Loop [2024-10-25 00:01:23,648 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:23,648 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:23,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:23,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:23,786 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 [2024-10-25 00:01:23,830 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:23,830 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:01:23,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:23,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:23,835 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) [2024-10-25 00:01:23,837 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 [2024-10-25 00:01:23,838 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 [2024-10-25 00:01:23,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:01:23,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:01:23,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:01:23,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:01:23,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:01:23,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:01:23,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:01:23,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:01:23,874 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 [2024-10-25 00:01:23,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:23,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:23,878 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) [2024-10-25 00:01:23,880 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 [2024-10-25 00:01:23,881 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 [2024-10-25 00:01:23,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:01:23,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:01:23,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:01:23,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:01:23,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:01:23,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:01:23,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:01:23,900 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:01:23,903 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:01:23,903 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:01:23,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:23,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:23,906 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) [2024-10-25 00:01:23,907 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 [2024-10-25 00:01:23,908 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:01:23,908 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:01:23,908 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:01:23,909 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2024-10-25 00:01:23,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-25 00:01:23,926 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:01:23,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:23,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:01:23,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:23,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:01:23,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:24,033 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 [2024-10-25 00:01:24,033 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) [2024-10-25 00:01:24,067 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. [2024-10-25 00:01:24,069 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 [2024-10-25 00:01:24,070 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) [2024-10-25 00:01:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-10-25 00:01:24,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 7 letters. Loop has 3 letters. [2024-10-25 00:01:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:24,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 10 letters. Loop has 3 letters. [2024-10-25 00:01:24,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:24,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 78 transitions. Stem has 7 letters. Loop has 6 letters. [2024-10-25 00:01:24,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:24,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 135 transitions. [2024-10-25 00:01:24,073 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2024-10-25 00:01:24,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 89 states and 126 transitions. [2024-10-25 00:01:24,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 83 [2024-10-25 00:01:24,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2024-10-25 00:01:24,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 126 transitions. [2024-10-25 00:01:24,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:01:24,078 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-10-25 00:01:24,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 126 transitions. [2024-10-25 00:01:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2024-10-25 00:01:24,081 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) [2024-10-25 00:01:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-10-25 00:01:24,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-10-25 00:01:24,082 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-10-25 00:01:24,083 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:01:24,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 74 transitions. [2024-10-25 00:01:24,083 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2024-10-25 00:01:24,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:01:24,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:01:24,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:01:24,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:01:24,085 INFO L745 eck$LassoCheckResult]: Stem: 893#$Ultimate##0 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); 894#L-1 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; 888#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 889#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 883#base2flt_returnLabel#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; 884#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 899#L35-1 assume !(base2flt_~m#1 % 4294967296 < 16777216); 871#L57-5 [2024-10-25 00:01:24,085 INFO L747 eck$LassoCheckResult]: Loop: 871#L57-5 assume !false; 867#L58-1 assume base2flt_~m#1 % 4294967296 >= 33554432; 868#L59-1 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2; 871#L57-5 [2024-10-25 00:01:24,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1807397409, now seen corresponding path program 1 times [2024-10-25 00:01:24,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:24,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181700212] [2024-10-25 00:01:24,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:24,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:24,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:01:24,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181700212] [2024-10-25 00:01:24,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181700212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:01:24,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:01:24,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 00:01:24,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579813723] [2024-10-25 00:01:24,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:01:24,200 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:01:24,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash 161996, now seen corresponding path program 1 times [2024-10-25 00:01:24,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:24,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648464274] [2024-10-25 00:01:24,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:24,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:24,210 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:01:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:24,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:01:24,252 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:24,252 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:24,253 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:24,253 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:24,253 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:01:24,253 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:24,253 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:24,253 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:24,253 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration3_Loop [2024-10-25 00:01:24,253 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:24,253 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:24,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:24,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:24,358 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:24,358 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:01:24,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:24,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:24,364 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) [2024-10-25 00:01:24,366 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 [2024-10-25 00:01:24,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:01:24,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:24,412 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 [2024-10-25 00:01:24,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:24,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:24,415 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) [2024-10-25 00:01:24,417 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 [2024-10-25 00:01:24,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:01:24,419 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:24,451 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:01:24,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-25 00:01:24,457 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:24,457 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:24,457 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:24,457 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:24,457 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:01:24,457 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:24,459 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:24,459 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:24,459 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration3_Loop [2024-10-25 00:01:24,460 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:24,460 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:24,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:24,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:24,563 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:24,563 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:01:24,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:24,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:24,569 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) [2024-10-25 00:01:24,573 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 [2024-10-25 00:01:24,574 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 [2024-10-25 00:01:24,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:01:24,587 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:01:24,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:01:24,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:01:24,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:01:24,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:01:24,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:01:24,594 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:01:24,609 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 [2024-10-25 00:01:24,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:24,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:24,612 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) [2024-10-25 00:01:24,613 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 [2024-10-25 00:01:24,614 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 [2024-10-25 00:01:24,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:01:24,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:01:24,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:01:24,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:01:24,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:01:24,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:01:24,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:01:24,633 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:01:24,636 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:01:24,636 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:01:24,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:24,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:24,638 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) [2024-10-25 00:01:24,642 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 [2024-10-25 00:01:24,642 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:01:24,643 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:01:24,643 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:01:24,643 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2024-10-25 00:01:24,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-25 00:01:24,659 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:01:24,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:24,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:01:24,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:24,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:01:24,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:24,711 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 [2024-10-25 00:01:24,712 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) [2024-10-25 00:01:24,742 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. [2024-10-25 00:01:24,744 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 [2024-10-25 00:01:24,745 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) [2024-10-25 00:01:24,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-10-25 00:01:24,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 77 transitions. Stem has 7 letters. Loop has 3 letters. [2024-10-25 00:01:24,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:24,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 77 transitions. Stem has 10 letters. Loop has 3 letters. [2024-10-25 00:01:24,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:24,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 77 transitions. Stem has 7 letters. Loop has 6 letters. [2024-10-25 00:01:24,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:24,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 138 transitions. [2024-10-25 00:01:24,748 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2024-10-25 00:01:24,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 91 states and 129 transitions. [2024-10-25 00:01:24,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2024-10-25 00:01:24,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2024-10-25 00:01:24,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 129 transitions. [2024-10-25 00:01:24,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:01:24,750 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-10-25 00:01:24,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 129 transitions. [2024-10-25 00:01:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 55. [2024-10-25 00:01:24,753 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) [2024-10-25 00:01:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2024-10-25 00:01:24,757 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 78 transitions. [2024-10-25 00:01:24,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:01:24,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:01:24,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:01:24,758 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) [2024-10-25 00:01:24,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:01:24,827 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2024-10-25 00:01:24,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 71 transitions. [2024-10-25 00:01:24,828 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-10-25 00:01:24,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 53 states and 71 transitions. [2024-10-25 00:01:24,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2024-10-25 00:01:24,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-10-25 00:01:24,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2024-10-25 00:01:24,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:01:24,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 71 transitions. [2024-10-25 00:01:24,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2024-10-25 00:01:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-10-25 00:01:24,835 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) [2024-10-25 00:01:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2024-10-25 00:01:24,836 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-10-25 00:01:24,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:01:24,837 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 67 transitions. [2024-10-25 00:01:24,839 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:01:24,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 67 transitions. [2024-10-25 00:01:24,839 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-10-25 00:01:24,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:01:24,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:01:24,840 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:01:24,840 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:01:24,840 INFO L745 eck$LassoCheckResult]: Stem: 1208#$Ultimate##0 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); 1175#L-1 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; 1176#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1205#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1199#base2flt_returnLabel#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; 1200#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 1180#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 1181#L47-3 assume !false; 1203#L38-1 assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; 1191#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 1173#base2flt_returnLabel#2 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; 1174#L29-2 assume !(0 == base2flt_~m#1 % 4294967296); 1196#L35-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 1197#L57-8 [2024-10-25 00:01:24,840 INFO L747 eck$LassoCheckResult]: Loop: 1197#L57-8 assume !false; 1189#L58-2 assume base2flt_~m#1 % 4294967296 >= 33554432; 1190#L59-2 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2; 1197#L57-8 [2024-10-25 00:01:24,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:24,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2092843178, now seen corresponding path program 1 times [2024-10-25 00:01:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:24,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210693215] [2024-10-25 00:01:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:24,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:24,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:01:24,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210693215] [2024-10-25 00:01:24,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210693215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:01:24,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:01:24,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:01:24,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101624709] [2024-10-25 00:01:24,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:01:24,920 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:01:24,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:24,920 INFO L85 PathProgramCache]: Analyzing trace with hash 249380, now seen corresponding path program 1 times [2024-10-25 00:01:24,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:24,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846014534] [2024-10-25 00:01:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:24,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:24,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:01:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:24,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:01:24,961 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:24,961 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:24,961 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:24,961 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:24,961 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:01:24,961 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:24,961 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:24,961 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:24,962 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration4_Loop [2024-10-25 00:01:24,962 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:24,962 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:24,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:24,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:25,048 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:25,048 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:01:25,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:25,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:25,052 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) [2024-10-25 00:01:25,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:01:25,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:25,056 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 [2024-10-25 00:01:25,089 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 [2024-10-25 00:01:25,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:25,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:25,091 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) [2024-10-25 00:01:25,092 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 [2024-10-25 00:01:25,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:01:25,095 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:25,130 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:01:25,135 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 [2024-10-25 00:01:25,136 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:25,136 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:25,136 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:25,136 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:25,136 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:01:25,136 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:25,136 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:25,136 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:25,137 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration4_Loop [2024-10-25 00:01:25,137 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:25,137 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:25,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:25,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:25,224 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:25,224 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:01:25,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:25,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:25,227 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) [2024-10-25 00:01:25,228 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 [2024-10-25 00:01:25,229 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 [2024-10-25 00:01:25,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:01:25,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:01:25,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:01:25,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:01:25,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:01:25,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:01:25,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:01:25,245 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:01:25,250 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:01:25,250 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:01:25,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:25,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:25,252 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) [2024-10-25 00:01:25,255 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 [2024-10-25 00:01:25,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:01:25,256 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:01:25,256 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:01:25,256 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2024-10-25 00:01:25,271 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 [2024-10-25 00:01:25,272 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:01:25,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:25,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:01:25,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:25,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:01:25,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:25,338 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 [2024-10-25 00:01:25,339 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) [2024-10-25 00:01:25,361 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. [2024-10-25 00:01:25,362 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 [2024-10-25 00:01:25,362 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) [2024-10-25 00:01:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-10-25 00:01:25,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 13 letters. Loop has 3 letters. [2024-10-25 00:01:25,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:25,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 16 letters. Loop has 3 letters. [2024-10-25 00:01:25,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:25,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 13 letters. Loop has 6 letters. [2024-10-25 00:01:25,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:25,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 103 transitions. [2024-10-25 00:01:25,364 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2024-10-25 00:01:25,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 70 states and 94 transitions. [2024-10-25 00:01:25,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2024-10-25 00:01:25,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2024-10-25 00:01:25,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 94 transitions. [2024-10-25 00:01:25,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:01:25,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 94 transitions. [2024-10-25 00:01:25,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 94 transitions. [2024-10-25 00:01:25,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2024-10-25 00:01:25,367 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) [2024-10-25 00:01:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-25 00:01:25,367 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-25 00:01:25,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:01:25,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:01:25,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:01:25,368 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) [2024-10-25 00:01:25,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:01:25,405 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2024-10-25 00:01:25,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 72 transitions. [2024-10-25 00:01:25,405 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-25 00:01:25,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 53 states and 71 transitions. [2024-10-25 00:01:25,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-10-25 00:01:25,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-10-25 00:01:25,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 71 transitions. [2024-10-25 00:01:25,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:01:25,406 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 71 transitions. [2024-10-25 00:01:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 71 transitions. [2024-10-25 00:01:25,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-10-25 00:01:25,408 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) [2024-10-25 00:01:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2024-10-25 00:01:25,409 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 70 transitions. [2024-10-25 00:01:25,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:01:25,411 INFO L425 stractBuchiCegarLoop]: Abstraction has 52 states and 70 transitions. [2024-10-25 00:01:25,411 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:01:25,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 70 transitions. [2024-10-25 00:01:25,412 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-25 00:01:25,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:01:25,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:01:25,413 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:01:25,413 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:01:25,413 INFO L745 eck$LassoCheckResult]: Stem: 1509#$Ultimate##0 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); 1473#L-1 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; 1474#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1505#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1499#base2flt_returnLabel#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; 1500#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 1478#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 1479#L47-3 assume !false; 1504#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296); 1491#L47-2 assume base2flt_~m#1 % 4294967296 < 16777216; 1492#L47-3 assume !false; 1503#L38-1 assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; 1495#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 1471#base2flt_returnLabel#2 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; 1472#L29-2 assume !(0 == base2flt_~m#1 % 4294967296); 1496#L35-2 assume base2flt_~m#1 % 4294967296 < 16777216; 1498#L47-5 [2024-10-25 00:01:25,413 INFO L747 eck$LassoCheckResult]: Loop: 1498#L47-5 assume !false; 1502#L38-2 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296); 1507#L47-4 assume base2flt_~m#1 % 4294967296 < 16777216; 1498#L47-5 [2024-10-25 00:01:25,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:25,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1820795632, now seen corresponding path program 1 times [2024-10-25 00:01:25,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:25,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491152537] [2024-10-25 00:01:25,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:25,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:25,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-25 00:01:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:25,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:01:25,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491152537] [2024-10-25 00:01:25,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491152537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:01:25,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660785278] [2024-10-25 00:01:25,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:25,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:01:25,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:25,520 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 [2024-10-25 00:01:25,521 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) [2024-10-25 00:01:25,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-10-25 00:01:25,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-25 00:01:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:25,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:01:25,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:25,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:01:25,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:25,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660785278] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:01:25,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:01:25,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-25 00:01:25,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653595494] [2024-10-25 00:01:25,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:01:25,658 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:01:25,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash 223621, now seen corresponding path program 1 times [2024-10-25 00:01:25,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:25,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671219090] [2024-10-25 00:01:25,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:25,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:01:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:25,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:01:25,699 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:25,699 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:25,699 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:25,699 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:25,699 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:01:25,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:25,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:25,699 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:25,699 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration5_Loop [2024-10-25 00:01:25,699 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:25,700 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:25,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:25,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:25,797 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:25,797 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:01:25,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:25,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:25,800 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) [2024-10-25 00:01:25,803 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 [2024-10-25 00:01:25,803 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:01:25,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:25,832 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 [2024-10-25 00:01:25,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:25,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:25,834 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) [2024-10-25 00:01:25,834 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 [2024-10-25 00:01:25,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:01:25,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:25,870 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:01:25,875 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 [2024-10-25 00:01:25,876 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:25,876 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:25,876 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:25,876 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:25,876 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:01:25,876 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:25,876 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:25,876 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:25,877 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration5_Loop [2024-10-25 00:01:25,877 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:25,877 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:25,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:25,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:25,985 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:25,985 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:01:25,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:25,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:26,019 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) [2024-10-25 00:01:26,020 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 [2024-10-25 00:01:26,021 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 [2024-10-25 00:01:26,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:01:26,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:01:26,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:01:26,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:01:26,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:01:26,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:01:26,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:01:26,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:01:26,040 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:01:26,040 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:01:26,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:26,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:26,042 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) [2024-10-25 00:01:26,043 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 [2024-10-25 00:01:26,044 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:01:26,044 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:01:26,044 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:01:26,044 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2024-10-25 00:01:26,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-25 00:01:26,060 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:01:26,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:26,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:01:26,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:26,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:01:26,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:26,141 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 [2024-10-25 00:01:26,141 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) [2024-10-25 00:01:26,164 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. [2024-10-25 00:01:26,164 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 [2024-10-25 00:01:26,167 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) [2024-10-25 00:01:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-10-25 00:01:26,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 16 letters. Loop has 3 letters. [2024-10-25 00:01:26,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:26,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 19 letters. Loop has 3 letters. [2024-10-25 00:01:26,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:26,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 16 letters. Loop has 6 letters. [2024-10-25 00:01:26,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:26,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 107 transitions. [2024-10-25 00:01:26,169 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-10-25 00:01:26,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 74 states and 98 transitions. [2024-10-25 00:01:26,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2024-10-25 00:01:26,170 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2024-10-25 00:01:26,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 98 transitions. [2024-10-25 00:01:26,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:01:26,170 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 98 transitions. [2024-10-25 00:01:26,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 98 transitions. [2024-10-25 00:01:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2024-10-25 00:01:26,172 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) [2024-10-25 00:01:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 74 transitions. [2024-10-25 00:01:26,173 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 74 transitions. [2024-10-25 00:01:26,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:01:26,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 00:01:26,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 00:01:26,174 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) [2024-10-25 00:01:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:01:26,243 INFO L93 Difference]: Finished difference Result 92 states and 126 transitions. [2024-10-25 00:01:26,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 126 transitions. [2024-10-25 00:01:26,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-25 00:01:26,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 86 states and 120 transitions. [2024-10-25 00:01:26,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2024-10-25 00:01:26,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2024-10-25 00:01:26,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 120 transitions. [2024-10-25 00:01:26,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:01:26,246 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 120 transitions. [2024-10-25 00:01:26,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 120 transitions. [2024-10-25 00:01:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 63. [2024-10-25 00:01:26,251 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) [2024-10-25 00:01:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2024-10-25 00:01:26,252 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 85 transitions. [2024-10-25 00:01:26,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 00:01:26,253 INFO L425 stractBuchiCegarLoop]: Abstraction has 63 states and 85 transitions. [2024-10-25 00:01:26,253 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:01:26,253 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 85 transitions. [2024-10-25 00:01:26,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-25 00:01:26,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:01:26,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:01:26,256 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] [2024-10-25 00:01:26,256 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:01:26,256 INFO L745 eck$LassoCheckResult]: Stem: 1963#$Ultimate##0 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); 1923#L-1 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; 1924#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1957#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1948#base2flt_returnLabel#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; 1949#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 1928#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 1929#L47-3 assume !false; 1961#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296); 1970#L47-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 1943#$Ultimate##64 assume 0 == base2flt_~m#1 % 4294967296;base2flt_#t~bitwise4#1 := 0; 1911#L76-9 base2flt_~m#1 := base2flt_#t~bitwise4#1;havoc base2flt_#t~bitwise4#1; 1912#L77-6 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); 1909#L77-11 base2flt_~res~0#1 := base2flt_#t~bitwise5#1;havoc base2flt_#t~bitwise5#1;base2flt_~__retres4~0#1 := base2flt_~res~0#1; 1944#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 1921#base2flt_returnLabel#2 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; 1922#L29-2 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1913#L79-2 base2flt_#res#1 := base2flt_~__retres4~0#1; 1914#base2flt_returnLabel#3 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; 1960#L29-3 assume !(0 == base2flt_~m#1 % 4294967296); 1925#L35-3 assume base2flt_~m#1 % 4294967296 < 16777216; 1926#L47-7 [2024-10-25 00:01:26,256 INFO L747 eck$LassoCheckResult]: Loop: 1926#L47-7 assume !false; 1917#L38-3 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296); 1918#L47-6 assume base2flt_~m#1 % 4294967296 < 16777216; 1926#L47-7 [2024-10-25 00:01:26,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1123658843, now seen corresponding path program 1 times [2024-10-25 00:01:26,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:26,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660948435] [2024-10-25 00:01:26,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:26,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:26,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:01:26,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660948435] [2024-10-25 00:01:26,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660948435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:01:26,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:01:26,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 00:01:26,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124454894] [2024-10-25 00:01:26,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:01:26,305 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:01:26,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:26,306 INFO L85 PathProgramCache]: Analyzing trace with hash 311005, now seen corresponding path program 1 times [2024-10-25 00:01:26,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:26,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230137876] [2024-10-25 00:01:26,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:26,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:26,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:26,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:01:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:26,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:01:26,345 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:26,346 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:26,346 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:26,346 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:26,347 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:01:26,347 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:26,347 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:26,347 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:26,347 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration6_Loop [2024-10-25 00:01:26,347 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:26,347 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:26,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:26,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:26,454 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:26,455 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:01:26,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:26,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:26,456 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) [2024-10-25 00:01:26,457 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 [2024-10-25 00:01:26,458 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:01:26,458 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:26,478 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-25 00:01:26,478 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: [] [2024-10-25 00:01:26,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-10-25 00:01:26,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:26,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:26,483 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) [2024-10-25 00:01:26,484 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 [2024-10-25 00:01:26,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:01:26,485 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:26,507 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 [2024-10-25 00:01:26,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:26,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:26,509 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) [2024-10-25 00:01:26,510 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 [2024-10-25 00:01:26,511 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:01:26,511 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:26,537 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:01:26,541 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 [2024-10-25 00:01:26,542 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:26,542 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:26,542 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:26,542 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:26,542 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:01:26,542 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:26,542 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:26,542 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:26,542 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration6_Loop [2024-10-25 00:01:26,542 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:26,542 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:26,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:26,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:26,646 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:26,646 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:01:26,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:26,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:26,647 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) [2024-10-25 00:01:26,648 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 [2024-10-25 00:01:26,649 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 [2024-10-25 00:01:26,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:01:26,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:01:26,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:01:26,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:01:26,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:01:26,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:01:26,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:01:26,664 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:01:26,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-10-25 00:01:26,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:26,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:26,683 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) [2024-10-25 00:01:26,686 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 [2024-10-25 00:01:26,686 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 [2024-10-25 00:01:26,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:01:26,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:01:26,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:01:26,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:01:26,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:01:26,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:01:26,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:01:26,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:01:26,705 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:01:26,705 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:01:26,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:26,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:26,707 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) [2024-10-25 00:01:26,708 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 [2024-10-25 00:01:26,708 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:01:26,708 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:01:26,708 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:01:26,708 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2024-10-25 00:01:26,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-10-25 00:01:26,720 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:01:26,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:26,758 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:01:26,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:26,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:01:26,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:26,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:26,816 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 [2024-10-25 00:01:26,817 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) [2024-10-25 00:01:26,822 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. [2024-10-25 00:01:26,823 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 [2024-10-25 00:01:26,824 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) [2024-10-25 00:01:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2024-10-25 00:01:26,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 21 letters. Loop has 3 letters. [2024-10-25 00:01:26,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:26,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 24 letters. Loop has 3 letters. [2024-10-25 00:01:26,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:26,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 21 letters. Loop has 6 letters. [2024-10-25 00:01:26,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:26,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 89 transitions. [2024-10-25 00:01:26,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-25 00:01:26,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 60 states and 81 transitions. [2024-10-25 00:01:26,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2024-10-25 00:01:26,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2024-10-25 00:01:26,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 81 transitions. [2024-10-25 00:01:26,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:01:26,827 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 81 transitions. [2024-10-25 00:01:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 81 transitions. [2024-10-25 00:01:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-25 00:01:26,829 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) [2024-10-25 00:01:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2024-10-25 00:01:26,829 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 81 transitions. [2024-10-25 00:01:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:01:26,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 00:01:26,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 00:01:26,830 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) [2024-10-25 00:01:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:01:26,894 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2024-10-25 00:01:26,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 91 transitions. [2024-10-25 00:01:26,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-25 00:01:26,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 91 transitions. [2024-10-25 00:01:26,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-10-25 00:01:26,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-10-25 00:01:26,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 91 transitions. [2024-10-25 00:01:26,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:01:26,896 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-10-25 00:01:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 91 transitions. [2024-10-25 00:01:26,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2024-10-25 00:01:26,901 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) [2024-10-25 00:01:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2024-10-25 00:01:26,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 83 transitions. [2024-10-25 00:01:26,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 00:01:26,903 INFO L425 stractBuchiCegarLoop]: Abstraction has 62 states and 83 transitions. [2024-10-25 00:01:26,903 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-25 00:01:26,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 83 transitions. [2024-10-25 00:01:26,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-25 00:01:26,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:01:26,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:01:26,907 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] [2024-10-25 00:01:26,907 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:01:26,908 INFO L745 eck$LassoCheckResult]: Stem: 2308#$Ultimate##0 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); 2270#L-1 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; 2271#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 2303#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 2294#base2flt_returnLabel#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; 2295#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 2274#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 2275#L47-3 assume !false; 2302#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296); 2287#L47-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 2289#$Ultimate##64 assume !(0 == base2flt_~m#1 % 4294967296); 2266#L76-6 assume 4278190079 == base2flt_~m#1 % 4294967296;base2flt_#t~bitwise4#1 := base2flt_~m#1; 2260#L76-9 base2flt_~m#1 := base2flt_#t~bitwise4#1;havoc base2flt_#t~bitwise4#1; 2261#L77-6 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); 2258#L77-11 base2flt_~res~0#1 := base2flt_#t~bitwise5#1;havoc base2flt_#t~bitwise5#1;base2flt_~__retres4~0#1 := base2flt_~res~0#1; 2290#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 2268#base2flt_returnLabel#2 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; 2269#L29-2 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 2262#L79-2 base2flt_#res#1 := base2flt_~__retres4~0#1; 2263#base2flt_returnLabel#3 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; 2306#L29-3 assume !(0 == base2flt_~m#1 % 4294967296); 2272#L35-3 assume !(base2flt_~m#1 % 4294967296 < 16777216); 2273#L57-11 [2024-10-25 00:01:26,908 INFO L747 eck$LassoCheckResult]: Loop: 2273#L57-11 assume !false; 2276#L58-3 assume base2flt_~m#1 % 4294967296 >= 33554432; 2277#L59-3 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2; 2273#L57-11 [2024-10-25 00:01:26,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1482624755, now seen corresponding path program 1 times [2024-10-25 00:01:26,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:26,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988544055] [2024-10-25 00:01:26,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:26,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:27,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:27,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:01:27,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988544055] [2024-10-25 00:01:27,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988544055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:01:27,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:01:27,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-25 00:01:27,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569785921] [2024-10-25 00:01:27,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:01:27,030 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-25 00:01:27,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:27,030 INFO L85 PathProgramCache]: Analyzing trace with hash 336764, now seen corresponding path program 1 times [2024-10-25 00:01:27,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:01:27,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93788966] [2024-10-25 00:01:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:01:27,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:01:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:27,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:01:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:01:27,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:01:27,078 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:27,078 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:27,078 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:27,079 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:27,079 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-25 00:01:27,079 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:27,079 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:27,079 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:27,079 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration7_Loop [2024-10-25 00:01:27,079 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:27,079 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:27,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:27,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:27,162 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:27,162 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-25 00:01:27,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:27,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:27,165 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) [2024-10-25 00:01:27,167 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 [2024-10-25 00:01:27,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-25 00:01:27,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:27,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-10-25 00:01:27,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:27,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:27,200 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) [2024-10-25 00:01:27,202 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 [2024-10-25 00:01:27,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-25 00:01:27,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-25 00:01:27,233 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-25 00:01:27,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-10-25 00:01:27,238 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:01:27,239 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:01:27,239 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:01:27,239 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:01:27,239 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:01:27,239 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:27,273 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:01:27,273 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:01:27,273 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration7_Loop [2024-10-25 00:01:27,273 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:01:27,273 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:01:27,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:27,291 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 [2024-10-25 00:01:27,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:01:27,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-10-25 00:01:27,375 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:01:27,376 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:01:27,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:27,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:27,378 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) [2024-10-25 00:01:27,379 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 [2024-10-25 00:01:27,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:01:27,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:01:27,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:01:27,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:01:27,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:01:27,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:01:27,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:01:27,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:01:27,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:01:27,406 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 [2024-10-25 00:01:27,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:27,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:27,408 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) [2024-10-25 00:01:27,409 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 [2024-10-25 00:01:27,410 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 [2024-10-25 00:01:27,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:01:27,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:01:27,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:01:27,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:01:27,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:01:27,425 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:01:27,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:01:27,426 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:01:27,428 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-25 00:01:27,428 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-25 00:01:27,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:01:27,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:01:27,429 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) [2024-10-25 00:01:27,431 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 [2024-10-25 00:01:27,431 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:01:27,431 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-25 00:01:27,431 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:01:27,431 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2024-10-25 00:01:27,442 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 [2024-10-25 00:01:27,443 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-25 00:01:27,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:01:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:27,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-25 00:01:27,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:01:27,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:01:27,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:01:27,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:01:27,519 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 [2024-10-25 00:01:27,519 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) [2024-10-25 00:01:27,524 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. [2024-10-25 00:01:27,525 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 [2024-10-25 00:01:27,526 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) [2024-10-25 00:01:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2024-10-25 00:01:27,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 22 letters. Loop has 3 letters. [2024-10-25 00:01:27,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:27,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 25 letters. Loop has 3 letters. [2024-10-25 00:01:27,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:27,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 22 letters. Loop has 6 letters. [2024-10-25 00:01:27,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:01:27,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 87 transitions. [2024-10-25 00:01:27,527 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:01:27,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 0 states and 0 transitions. [2024-10-25 00:01:27,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-25 00:01:27,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-25 00:01:27,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-25 00:01:27,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:01:27,528 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:01:27,528 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:01:27,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:01:27,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-25 00:01:27,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-25 00:01:27,529 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) [2024-10-25 00:01:27,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:01:27,529 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2024-10-25 00:01:27,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2024-10-25 00:01:27,529 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:01:27,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2024-10-25 00:01:27,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-25 00:01:27,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-25 00:01:27,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-25 00:01:27,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:01:27,530 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:01:27,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:01:27,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 00:01:27,531 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-25 00:01:27,531 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-25 00:01:27,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-25 00:01:27,531 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-25 00:01:27,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-25 00:01:27,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.10 12:01:27 BoogieIcfgContainer [2024-10-25 00:01:27,539 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-25 00:01:27,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-25 00:01:27,540 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-25 00:01:27,540 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-25 00:01:27,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:01:21" (3/4) ... [2024-10-25 00:01:27,542 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-25 00:01:27,543 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-25 00:01:27,544 INFO L158 Benchmark]: Toolchain (without parser) took 6737.54ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 105.7MB in the beginning and 164.1MB in the end (delta: -58.4MB). Peak memory consumption was 933.2kB. Max. memory is 16.1GB. [2024-10-25 00:01:27,544 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:01:27,544 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.39ms. Allocated memory is still 161.5MB. Free memory was 105.7MB in the beginning and 90.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-25 00:01:27,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.76ms. Allocated memory is still 161.5MB. Free memory was 90.4MB in the beginning and 87.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-25 00:01:27,545 INFO L158 Benchmark]: Boogie Preprocessor took 76.33ms. Allocated memory is still 161.5MB. Free memory was 87.7MB in the beginning and 84.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-25 00:01:27,545 INFO L158 Benchmark]: RCFGBuilder took 651.75ms. Allocated memory is still 161.5MB. Free memory was 84.8MB in the beginning and 54.1MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-25 00:01:27,545 INFO L158 Benchmark]: BuchiAutomizer took 5627.69ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 54.1MB in the beginning and 164.1MB in the end (delta: -110.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:01:27,546 INFO L158 Benchmark]: Witness Printer took 3.84ms. Allocated memory is still 220.2MB. Free memory is still 164.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-25 00:01:27,547 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.39ms. Allocated memory is still 161.5MB. Free memory was 105.7MB in the beginning and 90.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.76ms. Allocated memory is still 161.5MB. Free memory was 90.4MB in the beginning and 87.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.33ms. Allocated memory is still 161.5MB. Free memory was 87.7MB in the beginning and 84.8MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 651.75ms. Allocated memory is still 161.5MB. Free memory was 84.8MB in the beginning and 54.1MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 5627.69ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 54.1MB in the beginning and 164.1MB in the end (delta: -110.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.84ms. Allocated memory is still 220.2MB. Free memory is still 164.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) + 253) 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 5.5s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 163 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, 655 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 648 mSDsluCounter, 1099 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 308 IncrementalHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 873 mSDtfsCounter, 308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital22 mio100 ax100 hnf100 lsp61 ukn100 mio100 lsp100 div612 bol100 ite100 ukn100 eq132 hnf96 smp41 dnf100 smp100 tf104 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 67ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-25 00:01:27,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-25 00:01:27,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-10-25 00:01:27,975 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