./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_1-3a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:25:57,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:25:57,906 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-12 00:25:57,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:25:57,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:25:57,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:25:57,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:25:57,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:25:57,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:25:57,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:25:57,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:25:57,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:25:57,948 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:25:57,950 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:25:57,950 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:25:57,951 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:25:57,951 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:25:57,951 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:25:57,951 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:25:57,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:25:57,952 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:25:57,956 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 00:25:57,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:25:57,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 00:25:57,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:25:57,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:25:57,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:25:57,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:25:57,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:25:57,958 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:25:57,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 00:25:57,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:25:57,959 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:25:57,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:25:57,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:25:57,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:25:57,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:25:57,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:25:57,962 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:25:57,962 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2e6e06de31959e386aafc2fb45c848364ae9fea32df4ba40928c607f134f313f [2024-10-12 00:25:58,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:25:58,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:25:58,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:25:58,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:25:58,240 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:25:58,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-10-12 00:25:59,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:25:59,961 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:25:59,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3a.c.cil.c [2024-10-12 00:25:59,970 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2ed8b998d/a014dd672b694696906e23ae4c63b613/FLAGa19ea3e8d [2024-10-12 00:26:00,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2ed8b998d/a014dd672b694696906e23ae4c63b613 [2024-10-12 00:26:00,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:26:00,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:26:00,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:26:00,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:26:00,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:26:00,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e3452c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00, skipping insertion in model container [2024-10-12 00:26:00,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:26:00,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:26:00,611 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:26:00,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:26:00,671 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:26:00,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00 WrapperNode [2024-10-12 00:26:00,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:26:00,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:26:00,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:26:00,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:26:00,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,724 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 15, calls inlined = 18, statements flattened = 397 [2024-10-12 00:26:00,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:26:00,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:26:00,726 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:26:00,726 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:26:00,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,764 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-12 00:26:00,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,784 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:26:00,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:26:00,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:26:00,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:26:00,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (1/1) ... [2024-10-12 00:26:00,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:00,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:00,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:00,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:26:00,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 00:26:00,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 00:26:00,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:26:00,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:26:01,018 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:26:01,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:26:01,570 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-10-12 00:26:01,570 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:26:01,587 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:26:01,590 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-12 00:26:01,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:01 BoogieIcfgContainer [2024-10-12 00:26:01,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:26:01,592 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:26:01,592 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:26:01,596 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:26:01,597 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:01,597 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:26:00" (1/3) ... [2024-10-12 00:26:01,598 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@652414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:26:01, skipping insertion in model container [2024-10-12 00:26:01,598 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:01,598 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:26:00" (2/3) ... [2024-10-12 00:26:01,599 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@652414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:26:01, skipping insertion in model container [2024-10-12 00:26:01,599 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:26:01,599 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:01" (3/3) ... [2024-10-12 00:26:01,600 INFO L332 chiAutomizerObserver]: Analyzing ICFG soft_float_1-3a.c.cil.c [2024-10-12 00:26:01,649 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:26:01,649 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:26:01,650 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:26:01,650 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:26:01,650 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:26:01,650 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:26:01,650 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:26:01,650 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:26:01,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 138 states, 137 states have (on average 1.583941605839416) internal successors, (217), 137 states have internal predecessors, (217), 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-12 00:26:01,677 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2024-10-12 00:26:01,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:01,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:01,686 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:26:01,686 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:26:01,687 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:26:01,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 138 states, 137 states have (on average 1.583941605839416) internal successors, (217), 137 states have internal predecessors, (217), 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-12 00:26:01,697 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2024-10-12 00:26:01,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:01,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:01,697 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-12 00:26:01,697 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:26:01,705 INFO L745 eck$LassoCheckResult]: Stem: 37#$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(24, 2);call #Ultimate.allocInit(12, 3); 47#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 93#L29true assume !(0 == base2flt_~m#1 % 4294967296); 120#L35true assume !(base2flt_~m#1 % 4294967296 < 16777216); 66#L57-2true [2024-10-12 00:26:01,706 INFO L747 eck$LassoCheckResult]: Loop: 66#L57-2true assume !false; 46#L58true assume base2flt_~m#1 % 4294967296 >= 33554432; 107#L59true assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2; 66#L57-2true [2024-10-12 00:26:01,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:01,711 INFO L85 PathProgramCache]: Analyzing trace with hash 925696, now seen corresponding path program 1 times [2024-10-12 00:26:01,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:01,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319310357] [2024-10-12 00:26:01,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:01,965 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-12 00:26:01,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:26:01,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319310357] [2024-10-12 00:26:01,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319310357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:26:01,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:26:01,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 00:26:01,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183781306] [2024-10-12 00:26:01,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:26:01,975 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-10-12 00:26:01,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash 74612, now seen corresponding path program 1 times [2024-10-12 00:26:01,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:01,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309102218] [2024-10-12 00:26:01,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:01,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:01,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:02,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:02,084 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:02,084 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:02,084 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:02,084 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:02,084 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:26:02,085 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:02,085 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:02,085 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:02,085 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration1_Loop [2024-10-12 00:26:02,085 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:02,086 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:02,097 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:02,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:02,224 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:02,225 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:26:02,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:02,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:02,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:02,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:26:02,234 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:02,234 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:02,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-10-12 00:26:02,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:02,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:02,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:02,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:26:02,287 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:26:02,287 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:02,325 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:26:02,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-10-12 00:26:02,331 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:02,331 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:02,331 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:02,332 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:02,332 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:26:02,332 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:02,332 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:02,332 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:02,332 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration1_Loop [2024-10-12 00:26:02,332 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:02,332 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:02,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:02,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:02,445 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:02,450 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:26:02,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:02,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:02,454 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:02,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:26:02,456 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-12 00:26:02,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:02,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:02,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:02,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:02,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:02,477 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:02,477 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:02,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:26:02,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:26:02,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:02,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:02,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:02,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:26:02,504 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-12 00:26:02,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:02,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:02,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:02,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:02,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:02,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:02,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:02,523 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:26:02,528 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:26:02,528 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:26:02,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:02,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:02,551 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:02,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:26:02,553 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:26:02,553 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:26:02,553 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:26:02,554 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-12 00:26:02,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:02,570 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:26:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:02,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:26:02,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:02,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:26:02,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:02,655 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-12 00:26:02,686 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-12 00:26:02,688 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 138 states, 137 states have (on average 1.583941605839416) internal successors, (217), 137 states have internal predecessors, (217), 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-12 00:26:02,799 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 138 states, 137 states have (on average 1.583941605839416) internal successors, (217), 137 states have internal predecessors, (217), 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 409 states and 634 transitions. Complement of second has 6 states. [2024-10-12 00:26:02,801 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-12 00:26:02,807 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-12 00:26:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2024-10-12 00:26:02,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 415 transitions. Stem has 4 letters. Loop has 3 letters. [2024-10-12 00:26:02,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:02,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 415 transitions. Stem has 7 letters. Loop has 3 letters. [2024-10-12 00:26:02,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:02,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 415 transitions. Stem has 4 letters. Loop has 6 letters. [2024-10-12 00:26:02,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:02,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 634 transitions. [2024-10-12 00:26:02,825 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2024-10-12 00:26:02,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 85 states and 126 transitions. [2024-10-12 00:26:02,831 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2024-10-12 00:26:02,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2024-10-12 00:26:02,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 126 transitions. [2024-10-12 00:26:02,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:02,834 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 126 transitions. [2024-10-12 00:26:02,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 126 transitions. [2024-10-12 00:26:02,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:26:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2024-10-12 00:26:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.537313432835821) internal successors, (103), 66 states have internal predecessors, (103), 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-12 00:26:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-10-12 00:26:02,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-10-12 00:26:02,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:26:02,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 00:26:02,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 00:26:02,901 INFO L87 Difference]: Start difference. First operand 67 states and 103 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-12 00:26:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:26:02,954 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2024-10-12 00:26:02,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2024-10-12 00:26:02,955 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-10-12 00:26:02,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 42 transitions. [2024-10-12 00:26:02,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2024-10-12 00:26:02,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2024-10-12 00:26:02,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2024-10-12 00:26:02,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:02,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-10-12 00:26:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2024-10-12 00:26:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-12 00:26:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:26:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2024-10-12 00:26:02,959 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-10-12 00:26:02,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 00:26:02,960 INFO L425 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-10-12 00:26:02,960 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:26:02,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2024-10-12 00:26:02,961 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-10-12 00:26:02,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:02,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:02,961 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:02,962 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:26:02,962 INFO L745 eck$LassoCheckResult]: Stem: 718#$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(24, 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~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 698#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 716#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 712#base2flt_returnLabel#1 main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 713#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 699#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 700#L47-3 [2024-10-12 00:26:02,962 INFO L747 eck$LassoCheckResult]: Loop: 700#L47-3 assume !false; 715#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296); 711#L47-2 assume base2flt_~m#1 % 4294967296 < 16777216; 700#L47-3 [2024-10-12 00:26:02,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1807397383, now seen corresponding path program 1 times [2024-10-12 00:26:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:02,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821208918] [2024-10-12 00:26:02,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:02,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:02,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:02,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:02,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:02,993 INFO L85 PathProgramCache]: Analyzing trace with hash 136237, now seen corresponding path program 1 times [2024-10-12 00:26:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:02,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005580553] [2024-10-12 00:26:02,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:02,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:03,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:03,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:03,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1829446553, now seen corresponding path program 1 times [2024-10-12 00:26:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:03,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207575668] [2024-10-12 00:26:03,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:03,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:03,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:03,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:03,080 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:03,080 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:03,080 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:03,080 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:03,080 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:26:03,081 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:03,081 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:03,081 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:03,081 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration2_Loop [2024-10-12 00:26:03,081 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:03,081 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:03,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:03,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:03,193 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:03,193 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:26:03,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:03,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:03,195 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:03,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:26:03,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:03,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:03,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:03,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:03,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:03,238 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:03,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:26:03,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:26:03,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:03,282 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:26:03,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:03,289 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:03,289 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:03,289 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:03,289 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:03,289 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:26:03,289 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:03,290 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:03,290 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:03,290 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration2_Loop [2024-10-12 00:26:03,290 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:03,290 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:03,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:03,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:03,410 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:03,410 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:26:03,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:03,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:03,412 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:03,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:26:03,416 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-12 00:26:03,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:03,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:03,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:03,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:03,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:03,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:03,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:03,434 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:26:03,436 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:26:03,436 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:26:03,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:03,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:03,439 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:03,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:26:03,442 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:26:03,442 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:26:03,442 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:26:03,442 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-12 00:26:03,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:03,459 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:26:03,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:03,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:26:03,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:03,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:26:03,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:03,548 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-12 00:26:03,549 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-12 00:26:03,549 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:26:03,583 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 15. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 60 states and 79 transitions. Complement of second has 5 states. [2024-10-12 00:26:03,583 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-12 00:26:03,584 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-12 00:26:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2024-10-12 00:26:03,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 7 letters. Loop has 3 letters. [2024-10-12 00:26:03,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:03,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 10 letters. Loop has 3 letters. [2024-10-12 00:26:03,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:03,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 7 letters. Loop has 6 letters. [2024-10-12 00:26:03,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:03,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2024-10-12 00:26:03,587 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2024-10-12 00:26:03,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 53 states and 70 transitions. [2024-10-12 00:26:03,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-10-12 00:26:03,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2024-10-12 00:26:03,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 70 transitions. [2024-10-12 00:26:03,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:03,591 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 70 transitions. [2024-10-12 00:26:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 70 transitions. [2024-10-12 00:26:03,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2024-10-12 00:26:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:26:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2024-10-12 00:26:03,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 46 transitions. [2024-10-12 00:26:03,594 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2024-10-12 00:26:03,594 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:26:03,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2024-10-12 00:26:03,597 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2024-10-12 00:26:03,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:03,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:03,598 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:03,598 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:26:03,599 INFO L745 eck$LassoCheckResult]: Stem: 862#$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(24, 2);call #Ultimate.allocInit(12, 3); 838#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 839#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 860#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 855#base2flt_returnLabel#1 main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 856#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 840#L35-1 assume !(base2flt_~m#1 % 4294967296 < 16777216); 842#L57-5 [2024-10-12 00:26:03,599 INFO L747 eck$LassoCheckResult]: Loop: 842#L57-5 assume !false; 843#L58-1 assume base2flt_~m#1 % 4294967296 >= 33554432; 844#L59-1 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2; 842#L57-5 [2024-10-12 00:26:03,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:03,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1807397409, now seen corresponding path program 1 times [2024-10-12 00:26:03,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:03,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018011868] [2024-10-12 00:26:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:03,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:03,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:03,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:03,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:03,623 INFO L85 PathProgramCache]: Analyzing trace with hash 161996, now seen corresponding path program 1 times [2024-10-12 00:26:03,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:03,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235470670] [2024-10-12 00:26:03,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:03,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:03,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:03,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:03,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1828646228, now seen corresponding path program 1 times [2024-10-12 00:26:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:03,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926492130] [2024-10-12 00:26:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:03,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:03,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:03,704 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:03,704 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:03,704 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:03,704 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:03,704 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:26:03,705 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:03,705 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:03,705 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:03,705 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration3_Loop [2024-10-12 00:26:03,705 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:03,705 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:03,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:03,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:03,800 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:03,801 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:26:03,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:03,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:03,804 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:03,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:26:03,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:03,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:03,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:03,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:03,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:03,845 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:03,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-10-12 00:26:03,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:26:03,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:03,888 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:26:03,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-12 00:26:03,894 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:03,895 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:03,895 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:03,895 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:03,895 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:26:03,895 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:03,895 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:03,895 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:03,895 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration3_Loop [2024-10-12 00:26:03,896 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:03,896 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:03,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:03,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:03,999 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:03,999 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:26:03,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:03,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:04,004 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:04,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-10-12 00:26:04,007 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-12 00:26:04,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:04,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:04,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:04,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:04,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:04,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:04,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:04,023 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:26:04,025 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:26:04,026 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:26:04,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:04,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:04,028 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:04,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-10-12 00:26:04,030 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:26:04,030 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:26:04,030 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:26:04,030 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-12 00:26:04,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-10-12 00:26:04,047 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:26:04,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:04,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:26:04,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:04,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:26:04,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:04,092 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-12 00:26:04,093 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-12 00:26:04,093 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 46 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:26:04,115 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 46 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 62 states and 82 transitions. Complement of second has 5 states. [2024-10-12 00:26:04,116 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-12 00:26:04,117 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-12 00:26:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-10-12 00:26:04,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 7 letters. Loop has 3 letters. [2024-10-12 00:26:04,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:04,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 10 letters. Loop has 3 letters. [2024-10-12 00:26:04,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:04,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 7 letters. Loop has 6 letters. [2024-10-12 00:26:04,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:04,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 82 transitions. [2024-10-12 00:26:04,119 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2024-10-12 00:26:04,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 55 states and 73 transitions. [2024-10-12 00:26:04,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2024-10-12 00:26:04,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2024-10-12 00:26:04,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 73 transitions. [2024-10-12 00:26:04,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:04,121 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 73 transitions. [2024-10-12 00:26:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 73 transitions. [2024-10-12 00:26:04,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2024-10-12 00:26:04,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:26:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-10-12 00:26:04,123 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-10-12 00:26:04,124 INFO L425 stractBuchiCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-10-12 00:26:04,124 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:26:04,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 50 transitions. [2024-10-12 00:26:04,124 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-10-12 00:26:04,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:04,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:04,125 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:04,125 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:26:04,125 INFO L745 eck$LassoCheckResult]: Stem: 1010#$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(24, 2);call #Ultimate.allocInit(12, 3); 983#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 984#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1008#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1003#base2flt_returnLabel#1 main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1004#L29-1 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 994#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 981#base2flt_returnLabel#2 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; 982#L29-2 assume !(0 == base2flt_~m#1 % 4294967296); 997#L35-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 998#L57-8 [2024-10-12 00:26:04,127 INFO L747 eck$LassoCheckResult]: Loop: 998#L57-8 assume !false; 995#L58-2 assume base2flt_~m#1 % 4294967296 >= 33554432; 996#L59-2 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 % 4294967296 / 2; 998#L57-8 [2024-10-12 00:26:04,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:04,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1828899400, now seen corresponding path program 1 times [2024-10-12 00:26:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:04,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825547843] [2024-10-12 00:26:04,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:04,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:04,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:04,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:04,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:04,168 INFO L85 PathProgramCache]: Analyzing trace with hash 249380, now seen corresponding path program 1 times [2024-10-12 00:26:04,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:04,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481167038] [2024-10-12 00:26:04,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:04,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:04,176 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:04,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:04,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:04,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1213311245, now seen corresponding path program 1 times [2024-10-12 00:26:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:04,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104517602] [2024-10-12 00:26:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:04,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:04,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:04,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:04,240 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:04,240 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:04,241 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:04,241 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:04,241 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:26:04,241 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:04,241 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:04,241 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:04,241 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration4_Loop [2024-10-12 00:26:04,241 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:04,241 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:04,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:04,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:04,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-10-12 00:26:04,376 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:04,376 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:26:04,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:04,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:04,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:04,380 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:04,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-10-12 00:26:04,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:04,383 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:04,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:04,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:04,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:04,408 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:04,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-12 00:26:04,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:26:04,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:04,438 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:26:04,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:04,443 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:04,443 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:04,443 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:04,443 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:04,443 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:26:04,443 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:04,443 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:04,443 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:04,443 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration4_Loop [2024-10-12 00:26:04,443 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:04,443 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:04,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:04,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:04,531 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:04,531 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:26:04,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:04,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:04,534 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:04,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-12 00:26:04,536 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-12 00:26:04,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:04,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:04,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:04,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:04,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:04,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:04,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:04,556 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:26:04,559 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:26:04,559 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:26:04,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:04,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:04,562 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:04,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-12 00:26:04,565 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:26:04,565 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:26:04,565 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:26:04,565 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-12 00:26:04,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:04,580 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:26:04,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:04,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:26:04,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:04,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:26:04,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:04,631 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-12 00:26:04,631 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-12 00:26:04,632 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 50 transitions. cyclomatic complexity: 17 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-12 00:26:04,637 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 50 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 40 states and 54 transitions. Complement of second has 4 states. [2024-10-12 00:26:04,637 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-12 00:26:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:26:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2024-10-12 00:26:04,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 10 letters. Loop has 3 letters. [2024-10-12 00:26:04,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:04,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 13 letters. Loop has 3 letters. [2024-10-12 00:26:04,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:04,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 10 letters. Loop has 6 letters. [2024-10-12 00:26:04,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:04,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2024-10-12 00:26:04,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:26:04,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 34 states and 46 transitions. [2024-10-12 00:26:04,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-12 00:26:04,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-12 00:26:04,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 46 transitions. [2024-10-12 00:26:04,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:26:04,641 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 46 transitions. [2024-10-12 00:26:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 46 transitions. [2024-10-12 00:26:04,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-12 00:26:04,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:26:04,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2024-10-12 00:26:04,644 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 46 transitions. [2024-10-12 00:26:04,644 INFO L425 stractBuchiCegarLoop]: Abstraction has 34 states and 46 transitions. [2024-10-12 00:26:04,644 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:26:04,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 46 transitions. [2024-10-12 00:26:04,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-10-12 00:26:04,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:26:04,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:26:04,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:26:04,645 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:26:04,645 INFO L745 eck$LassoCheckResult]: Stem: 1141#$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(24, 2);call #Ultimate.allocInit(12, 3); 1117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~ret20#1, main_#t~ret21#1, main_#t~ret22#1, main_#t~ret23#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~0#1;havoc main_~a~0#1;havoc main_#t~nondet16#1;main_~ma~2#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_#t~nondet17#1;main_~ea~2#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~b~0#1;havoc main_#t~nondet18#1;main_~mb~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;havoc main_#t~nondet19#1;main_~eb~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~r_add~0#1;havoc main_~zero~0#1;havoc main_~sa~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1118#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1139#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1134#base2flt_returnLabel#1 main_#t~ret20#1 := base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;havoc base2flt_#in~m#1, base2flt_#in~e#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~bitwise4#1, base2flt_#t~bitwise5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1135#L29-1 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1128#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 1115#base2flt_returnLabel#2 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; 1116#L29-2 assume !(0 == base2flt_~m#1 % 4294967296); 1129#L35-2 assume base2flt_~m#1 % 4294967296 < 16777216; 1130#L47-5 [2024-10-12 00:26:04,645 INFO L747 eck$LassoCheckResult]: Loop: 1130#L47-5 assume !false; 1136#L38-2 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * (base2flt_~m#1 % 4294967296); 1140#L47-4 assume base2flt_~m#1 % 4294967296 < 16777216; 1130#L47-5 [2024-10-12 00:26:04,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:04,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1828899426, now seen corresponding path program 1 times [2024-10-12 00:26:04,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:04,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85093083] [2024-10-12 00:26:04,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:04,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:04,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:04,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:04,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash 223621, now seen corresponding path program 1 times [2024-10-12 00:26:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:04,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18494284] [2024-10-12 00:26:04,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:04,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:04,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:04,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:04,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1212510920, now seen corresponding path program 1 times [2024-10-12 00:26:04,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:26:04,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32626504] [2024-10-12 00:26:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:26:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:26:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:04,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:26:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:26:04,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:26:04,732 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:04,732 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:04,732 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:04,733 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:04,733 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:26:04,733 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:04,733 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:04,733 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:04,733 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration5_Loop [2024-10-12 00:26:04,733 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:04,733 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:04,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:04,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:04,833 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:04,833 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:26:04,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:04,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:04,835 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:04,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-12 00:26:04,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:04,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:04,869 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:26:04,869 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-12 00:26:04,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-12 00:26:04,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:04,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:04,875 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:04,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-12 00:26:04,878 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:26:04,878 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:04,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:04,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:04,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:04,908 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:04,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-12 00:26:04,910 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:26:04,910 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:26:04,945 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:26:04,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:04,951 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:26:04,951 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:26:04,951 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:26:04,951 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:26:04,951 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:26:04,951 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:04,951 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:26:04,951 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:26:04,951 INFO L132 ssoRankerPreferences]: Filename of dumped script: soft_float_1-3a.c.cil.c_Iteration5_Loop [2024-10-12 00:26:04,951 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:26:04,952 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:26:04,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:04,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:26:05,056 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:26:05,057 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:26:05,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:05,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:05,059 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:05,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-12 00:26:05,062 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-12 00:26:05,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:05,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:05,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:05,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:05,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:05,077 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:05,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:05,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:26:05,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-12 00:26:05,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:05,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:05,096 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:05,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-12 00:26:05,099 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-12 00:26:05,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:26:05,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:26:05,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:26:05,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:26:05,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:26:05,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:26:05,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:26:05,115 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:26:05,118 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-12 00:26:05,118 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:26:05,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:26:05,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:26:05,120 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:26:05,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-12 00:26:05,122 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:26:05,122 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:26:05,122 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:26:05,122 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-12 00:26:05,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:05,138 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:26:05,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:26:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:05,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:26:05,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:26:05,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 00:26:05,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:26:05,213 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-12 00:26:05,214 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-12 00:26:05,214 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 46 transitions. cyclomatic complexity: 15 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:26:05,221 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 46 transitions. cyclomatic complexity: 15. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 50 transitions. Complement of second has 4 states. [2024-10-12 00:26:05,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-10-12 00:26:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 00:26:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2024-10-12 00:26:05,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 10 letters. Loop has 3 letters. [2024-10-12 00:26:05,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:05,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 13 letters. Loop has 3 letters. [2024-10-12 00:26:05,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:05,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 39 transitions. Stem has 10 letters. Loop has 6 letters. [2024-10-12 00:26:05,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:26:05,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 50 transitions. [2024-10-12 00:26:05,224 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:26:05,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2024-10-12 00:26:05,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-12 00:26:05,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-12 00:26:05,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-12 00:26:05,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:26:05,225 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:26:05,225 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:26:05,225 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 00:26:05,225 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-12 00:26:05,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-12 00:26:05,225 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-12 00:26:05,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-12 00:26:05,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:26:05 BoogieIcfgContainer [2024-10-12 00:26:05,233 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:26:05,234 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:26:05,234 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:26:05,234 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:26:05,235 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:26:01" (3/4) ... [2024-10-12 00:26:05,239 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 00:26:05,241 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:26:05,241 INFO L158 Benchmark]: Toolchain (without parser) took 4903.29ms. Allocated memory is still 172.0MB. Free memory was 103.5MB in the beginning and 78.5MB in the end (delta: 25.0MB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-10-12 00:26:05,242 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:26:05,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.23ms. Allocated memory is still 172.0MB. Free memory was 103.3MB in the beginning and 87.9MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 00:26:05,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.81ms. Allocated memory is still 172.0MB. Free memory was 87.9MB in the beginning and 84.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 00:26:05,243 INFO L158 Benchmark]: Boogie Preprocessor took 65.44ms. Allocated memory is still 172.0MB. Free memory was 84.9MB in the beginning and 81.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:26:05,243 INFO L158 Benchmark]: RCFGBuilder took 798.78ms. Allocated memory is still 172.0MB. Free memory was 81.8MB in the beginning and 114.6MB in the end (delta: -32.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-12 00:26:05,243 INFO L158 Benchmark]: BuchiAutomizer took 3641.39ms. Allocated memory is still 172.0MB. Free memory was 114.6MB in the beginning and 79.5MB in the end (delta: 35.1MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-10-12 00:26:05,243 INFO L158 Benchmark]: Witness Printer took 7.00ms. Allocated memory is still 172.0MB. Free memory was 79.5MB in the beginning and 78.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:26:05,245 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.16ms. Allocated memory is still 113.2MB. Free memory is still 74.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.23ms. Allocated memory is still 172.0MB. Free memory was 103.3MB in the beginning and 87.9MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.81ms. Allocated memory is still 172.0MB. Free memory was 87.9MB in the beginning and 84.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.44ms. Allocated memory is still 172.0MB. Free memory was 84.9MB in the beginning and 81.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 798.78ms. Allocated memory is still 172.0MB. Free memory was 81.8MB in the beginning and 114.6MB in the end (delta: -32.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3641.39ms. Allocated memory is still 172.0MB. Free memory was 114.6MB in the beginning and 79.5MB in the end (delta: 35.1MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Witness Printer took 7.00ms. Allocated memory is still 172.0MB. Free memory was 79.5MB in the beginning and 78.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * e) + 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. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 55 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 448 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 406 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital22 mio100 ax100 hnf100 lsp61 ukn100 mio100 lsp100 div611 bol100 ite100 ukn100 eq131 hnf96 smp40 dnf100 smp100 tf104 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-12 00:26:05,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-12 00:26:05,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-12 00:26:05,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE