./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1032a.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1032a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4dfd0c51c81284345e5d6ac5423c9a25c50963a25059bb5410623e01e53b24e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:45:55,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:45:55,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:45:55,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:45:55,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:45:55,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:45:55,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:45:55,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:45:55,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:45:55,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:45:55,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:45:55,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:45:55,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:45:55,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:45:55,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:45:55,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:45:55,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:45:55,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:45:55,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:45:55,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:45:55,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:45:55,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:45:55,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:45:55,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:45:55,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:45:55,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:45:55,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:45:55,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:45:55,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:45:55,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:45:55,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:45:55,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:45:55,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:45:55,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:45:55,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:45:55,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:45:55,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:45:55,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:45:55,841 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:45:55,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:45:55,842 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:45:55,844 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:45:55,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:45:55,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:45:55,868 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:45:55,868 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:45:55,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:45:55,869 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:45:55,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:45:55,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:45:55,870 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:45:55,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:45:55,870 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:45:55,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:45:55,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:45:55,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:45:55,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:45:55,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:45:55,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:45:55,871 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:45:55,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:45:55,872 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:45:55,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:45:55,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:45:55,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:45:55,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:45:55,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:45:55,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:45:55,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:45:55,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:45:55,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:45:55,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:45:55,874 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:45:55,874 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:45:55,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:45:55,874 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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(G ! call(reach_error())) ) 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 -> d4dfd0c51c81284345e5d6ac5423c9a25c50963a25059bb5410623e01e53b24e [2022-02-20 16:45:56,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:45:56,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:45:56,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:45:56,108 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:45:56,108 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:45:56,110 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1032a.c [2022-02-20 16:45:56,199 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976bb8ea7/3263d4b387554c7ab22b26ed38ab3255/FLAGd7e7f52f2 [2022-02-20 16:45:56,563 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:45:56,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1032a.c [2022-02-20 16:45:56,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976bb8ea7/3263d4b387554c7ab22b26ed38ab3255/FLAGd7e7f52f2 [2022-02-20 16:45:56,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976bb8ea7/3263d4b387554c7ab22b26ed38ab3255 [2022-02-20 16:45:56,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:45:56,975 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:45:56,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:45:56,976 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:45:56,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:45:56,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:45:56" (1/1) ... [2022-02-20 16:45:56,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52cb3ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:56, skipping insertion in model container [2022-02-20 16:45:56,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:45:56" (1/1) ... [2022-02-20 16:45:56,987 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:45:57,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:45:57,140 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1032a.c[1751,1764] [2022-02-20 16:45:57,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:45:57,154 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:45:57,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1032a.c[1751,1764] [2022-02-20 16:45:57,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:45:57,215 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:45:57,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57 WrapperNode [2022-02-20 16:45:57,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:45:57,217 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:45:57,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:45:57,218 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:45:57,224 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,279 INFO L137 Inliner]: procedures = 17, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-02-20 16:45:57,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:45:57,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:45:57,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:45:57,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:45:57,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,321 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:45:57,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:45:57,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:45:57,337 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:45:57,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (1/1) ... [2022-02-20 16:45:57,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:45:57,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:45:57,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:45:57,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:45:57,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:45:57,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:45:57,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:45:57,418 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:45:57,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:45:57,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:45:57,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:45:57,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:45:57,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:45:57,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:45:57,505 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:45:57,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:45:57,814 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:45:57,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:45:57,821 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:45:57,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:45:57 BoogieIcfgContainer [2022-02-20 16:45:57,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:45:57,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:45:57,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:45:57,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:45:57,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:45:56" (1/3) ... [2022-02-20 16:45:57,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d01c996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:45:57, skipping insertion in model container [2022-02-20 16:45:57,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:45:57" (2/3) ... [2022-02-20 16:45:57,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d01c996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:45:57, skipping insertion in model container [2022-02-20 16:45:57,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:45:57" (3/3) ... [2022-02-20 16:45:57,832 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1032a.c [2022-02-20 16:45:57,837 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:45:57,837 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:45:57,877 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:45:57,883 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:45:57,884 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:45:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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) [2022-02-20 16:45:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:45:57,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:45:57,902 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:45:57,903 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:45:57,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:45:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1590452317, now seen corresponding path program 1 times [2022-02-20 16:45:57,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:45:57,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801496125] [2022-02-20 16:45:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:45:57,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:45:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:45:58,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-02-20 16:45:58,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 0.0;assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {28#true} is VALID [2022-02-20 16:45:58,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-02-20 16:45:58,065 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#false} round_float_~exponent_less_127~0#1 := (if (if 0 == round_float_~w~0#1 then 0 else (if 1 == round_float_~w~0#1 then 0 else ~bitwiseAnd(round_float_~w~0#1, 2139095040))) / 8388608 % 4294967296 % 4294967296 <= 2147483647 then (if 0 == round_float_~w~0#1 then 0 else (if 1 == round_float_~w~0#1 then 0 else ~bitwiseAnd(round_float_~w~0#1, 2139095040))) / 8388608 % 4294967296 % 4294967296 else (if 0 == round_float_~w~0#1 then 0 else (if 1 == round_float_~w~0#1 then 0 else ~bitwiseAnd(round_float_~w~0#1, 2139095040))) / 8388608 % 4294967296 % 4294967296 - 4294967296) - 127; {29#false} is VALID [2022-02-20 16:45:58,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#false} assume !(round_float_~exponent_less_127~0#1 < 23); {29#false} is VALID [2022-02-20 16:45:58,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume 128 == round_float_~exponent_less_127~0#1;round_float_#res#1 := ~someBinaryArithmeticFLOAToperation(round_float_~x#1, round_float_~x#1); {29#false} is VALID [2022-02-20 16:45:58,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {29#false} is VALID [2022-02-20 16:45:58,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} assume !main_#t~short9#1; {29#false} is VALID [2022-02-20 16:45:58,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {29#false} is VALID [2022-02-20 16:45:58,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 16:45:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:45:58,068 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:45:58,069 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801496125] [2022-02-20 16:45:58,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801496125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:45:58,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:45:58,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:45:58,074 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813665476] [2022-02-20 16:45:58,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:45:58,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) Word has length 10 [2022-02-20 16:45:58,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:45:58,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:45:58,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:45:58,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:45:58,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:45:58,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:45:58,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:45:58,146 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:45:58,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:58,208 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. [2022-02-20 16:45:58,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:45:58,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) Word has length 10 [2022-02-20 16:45:58,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:45:58,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:45:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 16:45:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:45:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 16:45:58,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 72 transitions. [2022-02-20 16:45:58,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:45:58,322 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:45:58,323 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:45:58,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:45:58,331 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:45:58,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:45:58,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:45:58,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:45:58,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:45:58,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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) [2022-02-20 16:45:58,362 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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) [2022-02-20 16:45:58,362 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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) [2022-02-20 16:45:58,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:58,366 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-20 16:45:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:45:58,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:45:58,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:45:58,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 22 states. [2022-02-20 16:45:58,369 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 22 states. [2022-02-20 16:45:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:45:58,372 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-20 16:45:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:45:58,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:45:58,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:45:58,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:45:58,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:45:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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) [2022-02-20 16:45:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-20 16:45:58,377 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 10 [2022-02-20 16:45:58,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:45:58,378 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-20 16:45:58,378 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:45:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:45:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:45:58,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:45:58,380 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:45:58,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:45:58,383 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:45:58,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:45:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash -744854880, now seen corresponding path program 1 times [2022-02-20 16:45:58,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:45:58,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206490293] [2022-02-20 16:45:58,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:45:58,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:45:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:45:58,436 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:45:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:45:58,479 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:45:58,479 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:45:58,481 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:45:58,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:45:58,485 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:45:58,487 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:45:58,507 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:45:58,508 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:45:58,508 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:45:58,508 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:45:58,508 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:45:58,508 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:45:58,509 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:45:58,509 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:45:58,509 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:45:58,509 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:45:58,509 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:45:58,509 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:45:58,509 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:45:58,509 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:45:58,510 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:45:58,510 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:45:58,510 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:45:58,510 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:45:58,510 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:45:58,510 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:45:58,510 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:45:58,511 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:45:58,511 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:45:58,511 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:45:58,511 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:45:58,511 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2022-02-20 16:45:58,511 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2022-02-20 16:45:58,511 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:45:58,512 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:45:58,512 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:45:58,512 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:45:58,512 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2022-02-20 16:45:58,512 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:45:58,512 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:45:58,512 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-02-20 16:45:58,512 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:45:58,513 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:45:58,513 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:45:58,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:45:58 BoogieIcfgContainer [2022-02-20 16:45:58,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:45:58,514 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:45:58,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:45:58,515 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:45:58,515 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:45:57" (3/4) ... [2022-02-20 16:45:58,518 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:45:58,518 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:45:58,519 INFO L158 Benchmark]: Toolchain (without parser) took 1544.54ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 51.4MB in the beginning and 64.1MB in the end (delta: -12.7MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-02-20 16:45:58,520 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory was 56.9MB in the beginning and 56.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:45:58,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.87ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 51.2MB in the beginning and 90.3MB in the end (delta: -39.1MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-02-20 16:45:58,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.46ms. Allocated memory is still 115.3MB. Free memory was 90.3MB in the beginning and 88.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:45:58,521 INFO L158 Benchmark]: Boogie Preprocessor took 54.18ms. Allocated memory is still 115.3MB. Free memory was 88.3MB in the beginning and 86.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:45:58,522 INFO L158 Benchmark]: RCFGBuilder took 487.41ms. Allocated memory is still 115.3MB. Free memory was 86.6MB in the beginning and 71.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:45:58,522 INFO L158 Benchmark]: TraceAbstraction took 689.10ms. Allocated memory is still 115.3MB. Free memory was 71.5MB in the beginning and 64.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-02-20 16:45:58,522 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 115.3MB. Free memory was 64.6MB in the beginning and 64.1MB in the end (delta: 543.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:45:58,525 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory was 56.9MB in the beginning and 56.9MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.87ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 51.2MB in the beginning and 90.3MB in the end (delta: -39.1MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.46ms. Allocated memory is still 115.3MB. Free memory was 90.3MB in the beginning and 88.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.18ms. Allocated memory is still 115.3MB. Free memory was 88.3MB in the beginning and 86.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 487.41ms. Allocated memory is still 115.3MB. Free memory was 86.6MB in the beginning and 71.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 689.10ms. Allocated memory is still 115.3MB. Free memory was 71.5MB in the beginning and 64.6MB in the end (delta: 6.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 115.3MB. Free memory was 64.6MB in the beginning and 64.1MB in the end (delta: 543.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 82]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of bitwiseAnd at line 25, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L77] float x = 0.0f; [L78] CALL, EXPR round_float(x) [L15] __uint32_t w; [L17] int exponent_less_127; VAL [\old(x)=0, x=0] [L20] ieee_float_shape_type gf_u; [L21] gf_u.value = (x) [L22] EXPR gf_u.word [L22] (w) = gf_u.word [L25] exponent_less_127 = (int)((w & 0x7f800000) >> 23) - 127 VAL [\old(x)=0, exponent_less_127=128, w=2139095041, x=0] [L27] COND FALSE !(exponent_less_127 < 23) VAL [\old(x)=0, exponent_less_127=128, w=2139095041, x=0] [L43] COND TRUE exponent_less_127 == 128 [L45] return x + x; VAL [\old(x)=0, exponent_less_127=128, w=2139095041, x=0] [L78] RET, EXPR round_float(x) [L78] float res = round_float(x); [L81] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=2139095042, res == 0.0f && __signbit_float(res) == 0=0, x=0] [L81] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L82] reach_error() VAL [res=2139095042, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 30 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:45:58,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1032a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4dfd0c51c81284345e5d6ac5423c9a25c50963a25059bb5410623e01e53b24e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:00,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:00,586 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:00,617 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:00,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:00,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:00,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:00,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:00,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:00,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:00,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:00,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:00,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:00,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:00,644 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:00,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:00,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:00,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:00,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:00,655 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:00,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:00,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:00,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:00,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:00,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:00,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:00,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:00,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:00,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:00,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:00,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:00,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:00,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:00,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:00,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:00,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:00,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:00,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:00,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:00,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:00,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:00,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:46:00,708 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:00,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:00,709 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:00,709 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:00,710 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:00,710 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:00,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:00,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:00,712 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:00,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:00,713 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:00,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:00,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:00,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:00,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:00,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:00,714 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:00,714 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:00,714 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:00,714 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:00,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:00,715 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:00,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:00,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:00,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:00,715 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:00,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:00,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:00,725 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:00,725 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:00,725 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:00,725 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:00,725 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:00,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:00,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:00,726 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:00,726 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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(G ! call(reach_error())) ) 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 -> d4dfd0c51c81284345e5d6ac5423c9a25c50963a25059bb5410623e01e53b24e [2022-02-20 16:46:01,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:01,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:01,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:01,066 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:01,066 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:01,067 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1032a.c [2022-02-20 16:46:01,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c66562e8/4a0afc78a447457db90242f906687121/FLAGf04b01ae0 [2022-02-20 16:46:01,574 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:01,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1032a.c [2022-02-20 16:46:01,596 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c66562e8/4a0afc78a447457db90242f906687121/FLAGf04b01ae0 [2022-02-20 16:46:02,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c66562e8/4a0afc78a447457db90242f906687121 [2022-02-20 16:46:02,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:02,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:02,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:02,100 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:02,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:02,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e73319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02, skipping insertion in model container [2022-02-20 16:46:02,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:02,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:02,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1032a.c[1751,1764] [2022-02-20 16:46:02,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:02,310 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:02,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1032a.c[1751,1764] [2022-02-20 16:46:02,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:02,371 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:02,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02 WrapperNode [2022-02-20 16:46:02,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:02,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:02,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:02,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:02,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,412 INFO L137 Inliner]: procedures = 20, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 88 [2022-02-20 16:46:02,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:02,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:02,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:02,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:02,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,442 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,447 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:02,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:02,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:02,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:02,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (1/1) ... [2022-02-20 16:46:02,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:02,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:02,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:46:02,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:46:02,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:02,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:02,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:02,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:02,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:02,575 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:02,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:02,783 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:02,789 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:02,789 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:46:02,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:02 BoogieIcfgContainer [2022-02-20 16:46:02,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:02,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:02,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:02,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:02,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:02" (1/3) ... [2022-02-20 16:46:02,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dd555c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:02, skipping insertion in model container [2022-02-20 16:46:02,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:02" (2/3) ... [2022-02-20 16:46:02,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11dd555c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:02, skipping insertion in model container [2022-02-20 16:46:02,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:02" (3/3) ... [2022-02-20 16:46:02,797 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1032a.c [2022-02-20 16:46:02,813 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:02,813 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:02,895 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:02,912 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:46:02,912 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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) [2022-02-20 16:46:02,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:02,943 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:02,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:02,944 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:02,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:02,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1590452317, now seen corresponding path program 1 times [2022-02-20 16:46:02,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:02,966 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639222030] [2022-02-20 16:46:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:02,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:02,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:02,973 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:02,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:46:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:03,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:03,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:03,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {28#true} is VALID [2022-02-20 16:46:03,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {28#true} is VALID [2022-02-20 16:46:03,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-02-20 16:46:03,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {29#false} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {29#false} is VALID [2022-02-20 16:46:03,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {29#false} assume !~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {29#false} is VALID [2022-02-20 16:46:03,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume 128bv32 == round_float_~exponent_less_127~0#1;round_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, round_float_~x#1, round_float_~x#1); {29#false} is VALID [2022-02-20 16:46:03,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {29#false} is VALID [2022-02-20 16:46:03,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} assume !main_#t~short9#1; {29#false} is VALID [2022-02-20 16:46:03,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {29#false} is VALID [2022-02-20 16:46:03,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 16:46:03,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:03,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:03,177 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:03,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639222030] [2022-02-20 16:46:03,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639222030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:03,179 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:03,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:03,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145241996] [2022-02-20 16:46:03,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) Word has length 10 [2022-02-20 16:46:03,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:03,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:46:03,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:03,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:03,227 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:03,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:03,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:03,252 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.608695652173913) internal successors, (37), 24 states have internal predecessors, (37), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:46:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:03,324 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. [2022-02-20 16:46:03,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:03,325 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) Word has length 10 [2022-02-20 16:46:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:46:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 16:46:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:46:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 72 transitions. [2022-02-20 16:46:03,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 72 transitions. [2022-02-20 16:46:03,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:03,475 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:46:03,475 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:46:03,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:03,485 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:03,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:46:03,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:46:03,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:03,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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) [2022-02-20 16:46:03,513 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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) [2022-02-20 16:46:03,514 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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) [2022-02-20 16:46:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:03,520 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-20 16:46:03,521 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:46:03,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:03,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:03,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 22 states. [2022-02-20 16:46:03,523 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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 22 states. [2022-02-20 16:46:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:03,527 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-02-20 16:46:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:46:03,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:03,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:03,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:03,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:03,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 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) [2022-02-20 16:46:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-20 16:46:03,536 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 10 [2022-02-20 16:46:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:03,537 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-20 16:46:03,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2022-02-20 16:46:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-02-20 16:46:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:03,539 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:03,539 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:03,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:03,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:03,755 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:03,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash -744854880, now seen corresponding path program 1 times [2022-02-20 16:46:03,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:03,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268357182] [2022-02-20 16:46:03,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:03,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:03,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:03,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:03,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:46:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:03,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:03,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:04,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {187#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {187#true} is VALID [2022-02-20 16:46:04,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {187#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {195#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:04,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} call round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(round_float_~x#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);call round_float_#t~mem4#1 := read~intINTTYPE4(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);round_float_~w~0#1 := round_float_#t~mem4#1;havoc round_float_#t~mem4#1;call ULTIMATE.dealloc(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset);havoc round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset; {199#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:04,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {199#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24))} goto; {199#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:04,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {199#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24))} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {206#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24)) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:04,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24)) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume !~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {188#false} is VALID [2022-02-20 16:46:04,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#false} assume 128bv32 == round_float_~exponent_less_127~0#1;round_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, round_float_~x#1, round_float_~x#1); {188#false} is VALID [2022-02-20 16:46:04,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {188#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {188#false} is VALID [2022-02-20 16:46:04,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {188#false} assume !main_#t~short9#1; {188#false} is VALID [2022-02-20 16:46:04,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {188#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {188#false} is VALID [2022-02-20 16:46:04,049 INFO L290 TraceCheckUtils]: 10: Hoare triple {188#false} assume !false; {188#false} is VALID [2022-02-20 16:46:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:04,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:04,050 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:04,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268357182] [2022-02-20 16:46:04,050 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268357182] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:04,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:04,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:04,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227197549] [2022-02-20 16:46:04,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:04,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 11 [2022-02-20 16:46:04,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:04,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-02-20 16:46:04,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:04,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:04,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:04,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:04,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:04,080 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-02-20 16:46:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,214 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-20 16:46:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:04,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) Word has length 11 [2022-02-20 16:46:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-02-20 16:46:04,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 16:46:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-02-20 16:46:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 16:46:04,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 16:46:04,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:04,264 INFO L225 Difference]: With dead ends: 31 [2022-02-20 16:46:04,264 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 16:46:04,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:04,266 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:04,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-02-20 16:46:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 16:46:04,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 16:46:04,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:04,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,269 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,269 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,270 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 16:46:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 16:46:04,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:04,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:04,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2022-02-20 16:46:04,271 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2022-02-20 16:46:04,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,272 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 16:46:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 16:46:04,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:04,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:04,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:04,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:04,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-20 16:46:04,274 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2022-02-20 16:46:04,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:04,274 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-20 16:46:04,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2022-02-20 16:46:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 16:46:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:04,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:04,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:04,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:04,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:04,478 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:04,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:04,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1636973854, now seen corresponding path program 1 times [2022-02-20 16:46:04,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:04,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952344250] [2022-02-20 16:46:04,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:04,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:04,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:04,489 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:04,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:46:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:04,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:04,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:04,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {333#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {333#true} is VALID [2022-02-20 16:46:04,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {333#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {341#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:04,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {341#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} call round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(round_float_~x#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);call round_float_#t~mem4#1 := read~intINTTYPE4(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);round_float_~w~0#1 := round_float_#t~mem4#1;havoc round_float_#t~mem4#1;call ULTIMATE.dealloc(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset);havoc round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset; {345#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:04,666 INFO L290 TraceCheckUtils]: 3: Hoare triple {345#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24))} goto; {345#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:04,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {345#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24))} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {352#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24)) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:04,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {352#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24)) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {352#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24)) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:04,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {352#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24)) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume !~bvslt32(round_float_~exponent_less_127~0#1, 0bv32);round_float_~exponent_mask~0#1 := ~bvashr32(8388607bv32, round_float_~exponent_less_127~0#1); {334#false} is VALID [2022-02-20 16:46:04,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {334#false} assume 0bv32 == ~bvand32(round_float_~w~0#1, round_float_~exponent_mask~0#1);round_float_#res#1 := round_float_~x#1; {334#false} is VALID [2022-02-20 16:46:04,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {334#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {334#false} is VALID [2022-02-20 16:46:04,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {334#false} assume !main_#t~short9#1; {334#false} is VALID [2022-02-20 16:46:04,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {334#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {334#false} is VALID [2022-02-20 16:46:04,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {334#false} assume !false; {334#false} is VALID [2022-02-20 16:46:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:04,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:04,673 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:04,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952344250] [2022-02-20 16:46:04,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952344250] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:04,674 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:04,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:04,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123605429] [2022-02-20 16:46:04,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:04,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:04,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:04,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:04,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:04,691 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:04,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:04,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:04,692 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,811 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 16:46:04,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:04,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:04,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-20 16:46:04,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-02-20 16:46:04,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-02-20 16:46:04,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:04,856 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:46:04,856 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 16:46:04,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:04,858 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 4 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:04,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 57 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-02-20 16:46:04,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 16:46:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 16:46:04,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:04,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,861 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,861 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,862 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 16:46:04,862 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 16:46:04,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:04,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:04,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-20 16:46:04,863 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states. [2022-02-20 16:46:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:04,864 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-02-20 16:46:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 16:46:04,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:04,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:04,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:04,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-02-20 16:46:04,866 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2022-02-20 16:46:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:04,866 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-02-20 16:46:04,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:04,866 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-02-20 16:46:04,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:04,867 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:04,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:04,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:05,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:05,078 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:05,078 INFO L85 PathProgramCache]: Analyzing trace with hash 812441883, now seen corresponding path program 1 times [2022-02-20 16:46:05,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:05,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026979341] [2022-02-20 16:46:05,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:05,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:05,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:05,080 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:05,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:46:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:05,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:05,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:05,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {481#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {481#true} is VALID [2022-02-20 16:46:05,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {481#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {489#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:05,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} call round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(round_float_~x#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);call round_float_#t~mem4#1 := read~intINTTYPE4(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);round_float_~w~0#1 := round_float_#t~mem4#1;havoc round_float_#t~mem4#1;call ULTIMATE.dealloc(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset);havoc round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset; {493#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:05,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {493#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24))} goto; {493#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24))} is VALID [2022-02-20 16:46:05,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {493#(= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24))} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {500#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24)) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:05,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {500#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24)) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {500#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24)) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:05,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {500#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24)) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 0bv32);round_float_~w~0#1 := ~bvand32(2147483648bv32, round_float_~w~0#1); {500#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24)) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} is VALID [2022-02-20 16:46:05,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {500#(exists ((|ULTIMATE.start_round_float_~w~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 30 23) |ULTIMATE.start_round_float_~w~0#1|) ((_ extract 22 0) |ULTIMATE.start_round_float_~w~0#1|)) (_ +zero 8 24)) (= (bvadd (_ bv4294967169 32) (bvlshr (bvand |ULTIMATE.start_round_float_~w~0#1| (_ bv2139095040 32)) (_ bv23 32))) |ULTIMATE.start_round_float_~exponent_less_127~0#1|)))} assume 4294967295bv32 == round_float_~exponent_less_127~0#1;round_float_~w~0#1 := ~bvor32(1065353216bv32, round_float_~w~0#1); {482#false} is VALID [2022-02-20 16:46:05,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {482#false} call round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(round_float_~w~0#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);call round_float_#t~mem5#1 := read~intFLOATTYPE4(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);round_float_~x#1 := round_float_#t~mem5#1;havoc round_float_#t~mem5#1;call ULTIMATE.dealloc(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset);havoc round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset; {482#false} is VALID [2022-02-20 16:46:05,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {482#false} goto; {482#false} is VALID [2022-02-20 16:46:05,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {482#false} round_float_#res#1 := round_float_~x#1; {482#false} is VALID [2022-02-20 16:46:05,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {482#false} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {482#false} is VALID [2022-02-20 16:46:05,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {482#false} assume !main_#t~short9#1; {482#false} is VALID [2022-02-20 16:46:05,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {482#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {482#false} is VALID [2022-02-20 16:46:05,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {482#false} assume !false; {482#false} is VALID [2022-02-20 16:46:05,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:05,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:05,296 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:05,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026979341] [2022-02-20 16:46:05,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026979341] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:05,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:05,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:05,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573982926] [2022-02-20 16:46:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:05,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2022-02-20 16:46:05,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:05,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-02-20 16:46:05,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:05,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:05,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:05,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:05,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:05,322 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-02-20 16:46:05,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:05,451 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-20 16:46:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:05,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 15 [2022-02-20 16:46:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-02-20 16:46:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-02-20 16:46:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-02-20 16:46:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-02-20 16:46:05,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-02-20 16:46:05,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:05,492 INFO L225 Difference]: With dead ends: 32 [2022-02-20 16:46:05,492 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 16:46:05,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:05,493 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:05,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 52 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-02-20 16:46:05,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 16:46:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 16:46:05,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:05,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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) [2022-02-20 16:46:05,495 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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) [2022-02-20 16:46:05,496 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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) [2022-02-20 16:46:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:05,496 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-02-20 16:46:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-02-20 16:46:05,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:05,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:05,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 20 states. [2022-02-20 16:46:05,500 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 20 states. [2022-02-20 16:46:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:05,501 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-02-20 16:46:05,501 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-02-20 16:46:05,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:05,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:05,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:05,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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) [2022-02-20 16:46:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-02-20 16:46:05,504 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2022-02-20 16:46:05,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:05,504 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-02-20 16:46:05,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-02-20 16:46:05,505 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-02-20 16:46:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:05,508 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:05,509 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:05,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:05,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:05,719 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:05,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:05,719 INFO L85 PathProgramCache]: Analyzing trace with hash 3095257, now seen corresponding path program 1 times [2022-02-20 16:46:05,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:05,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114100349] [2022-02-20 16:46:05,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:05,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:05,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:05,721 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:05,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:46:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:05,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 16:46:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:05,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:05,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:46:05,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-02-20 16:46:06,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {637#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {637#true} is VALID [2022-02-20 16:46:06,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {637#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {645#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:06,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} call round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(round_float_~x#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);call round_float_#t~mem4#1 := read~intINTTYPE4(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);round_float_~w~0#1 := round_float_#t~mem4#1;havoc round_float_#t~mem4#1;call ULTIMATE.dealloc(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset);havoc round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset; {649#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:06,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {649#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))))} goto; {649#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:06,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {649#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))))} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {649#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:06,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {649#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:06,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {649#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 0bv32);round_float_~w~0#1 := ~bvand32(2147483648bv32, round_float_~w~0#1); {649#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:06,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))))} assume !(4294967295bv32 == round_float_~exponent_less_127~0#1); {649#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:06,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))) (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_12|) (_ bv0 32)))))} call round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(round_float_~w~0#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);call round_float_#t~mem5#1 := read~intFLOATTYPE4(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);round_float_~x#1 := round_float_#t~mem5#1;havoc round_float_#t~mem5#1;call ULTIMATE.dealloc(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset);havoc round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset; {645#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:06,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {645#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} goto; {645#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:06,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {645#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} round_float_#res#1 := round_float_~x#1; {674#(= |ULTIMATE.start_round_float_#res#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:06,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {674#(= |ULTIMATE.start_round_float_#res#1| (_ +zero 8 24))} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {678#|ULTIMATE.start_main_#t~short9#1|} is VALID [2022-02-20 16:46:06,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {678#|ULTIMATE.start_main_#t~short9#1|} assume !main_#t~short9#1; {638#false} is VALID [2022-02-20 16:46:06,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {638#false} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {638#false} is VALID [2022-02-20 16:46:06,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#false} assume !false; {638#false} is VALID [2022-02-20 16:46:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:06,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:06,056 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:06,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114100349] [2022-02-20 16:46:06,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114100349] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:06,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:06,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:06,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624642276] [2022-02-20 16:46:06,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:06,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) Word has length 15 [2022-02-20 16:46:06,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:06,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-02-20 16:46:06,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:06,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:06,089 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:06,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:06,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:06,089 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-02-20 16:46:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:06,200 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2022-02-20 16:46:06,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:06,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) Word has length 15 [2022-02-20 16:46:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-02-20 16:46:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-02-20 16:46:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-02-20 16:46:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2022-02-20 16:46:06,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2022-02-20 16:46:06,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:06,233 INFO L225 Difference]: With dead ends: 23 [2022-02-20 16:46:06,233 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 16:46:06,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:06,234 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:06,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-02-20 16:46:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 16:46:06,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 16:46:06,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:06,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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) [2022-02-20 16:46:06,237 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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) [2022-02-20 16:46:06,237 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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) [2022-02-20 16:46:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:06,238 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2022-02-20 16:46:06,238 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2022-02-20 16:46:06,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:06,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:06,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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 20 states. [2022-02-20 16:46:06,239 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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 20 states. [2022-02-20 16:46:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:06,240 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2022-02-20 16:46:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2022-02-20 16:46:06,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:06,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:06,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:06,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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) [2022-02-20 16:46:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2022-02-20 16:46:06,241 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 15 [2022-02-20 16:46:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:06,241 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2022-02-20 16:46:06,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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) [2022-02-20 16:46:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2022-02-20 16:46:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:46:06,242 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:06,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:06,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:06,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:06,452 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:06,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:06,452 INFO L85 PathProgramCache]: Analyzing trace with hash -318448082, now seen corresponding path program 1 times [2022-02-20 16:46:06,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:06,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752657971] [2022-02-20 16:46:06,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:06,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:06,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:06,454 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:06,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:46:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:06,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 16:46:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:06,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:06,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:46:06,692 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-02-20 16:46:06,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2022-02-20 16:46:06,894 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:46:06,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 28 [2022-02-20 16:46:07,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {784#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {784#true} is VALID [2022-02-20 16:46:07,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_#t~short9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline_round_float } true;round_float_#in~x#1 := main_~x~0#1;havoc round_float_#res#1;havoc round_float_#t~mem4#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, round_float_~exponent_mask~0#1, round_float_#t~mem5#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, round_float_~x#1, round_float_~w~0#1, round_float_~exponent_less_127~0#1;round_float_~x#1 := round_float_#in~x#1;havoc round_float_~w~0#1;havoc round_float_~exponent_less_127~0#1; {792#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:46:07,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {792#(= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))} call round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(round_float_~x#1, round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);call round_float_#t~mem4#1 := read~intINTTYPE4(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset, 4bv32);round_float_~w~0#1 := round_float_#t~mem4#1;havoc round_float_#t~mem4#1;call ULTIMATE.dealloc(round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset);havoc round_float_~#gf_u~0#1.base, round_float_~#gf_u~0#1.offset; {796#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:07,110 INFO L290 TraceCheckUtils]: 3: Hoare triple {796#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)))) (_ +zero 8 24))))} goto; {796#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:07,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {796#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)))) (_ +zero 8 24))))} round_float_~exponent_less_127~0#1 := ~bvsub32(~bvlshr32(~bvand32(2139095040bv32, round_float_~w~0#1), 23bv32), 127bv32); {796#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:07,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {796#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)))) (_ +zero 8 24))))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 23bv32); {796#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:07,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {796#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)))) (_ +zero 8 24))))} assume ~bvslt32(round_float_~exponent_less_127~0#1, 0bv32);round_float_~w~0#1 := ~bvand32(2147483648bv32, round_float_~w~0#1); {796#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:07,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {796#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)))) (_ +zero 8 24))))} assume !(4294967295bv32 == round_float_~exponent_less_127~0#1); {796#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)))) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:07,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {796#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_round_float_~w~0#1| (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)))) (_ +zero 8 24))))} call round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(round_float_~w~0#1, round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);call round_float_#t~mem5#1 := read~intFLOATTYPE4(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset, 4bv32);round_float_~x#1 := round_float_#t~mem5#1;havoc round_float_#t~mem5#1;call ULTIMATE.dealloc(round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset);havoc round_float_~#sf_u~0#1.base, round_float_~#sf_u~0#1.offset; {815#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_round_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:07,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {815#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_round_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} goto; {815#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_round_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:07,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {815#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_round_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} round_float_#res#1 := round_float_~x#1; {822#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (_ +zero 8 24)) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_round_float_#res#1|)))} is VALID [2022-02-20 16:46:07,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#(exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (_ +zero 8 24)) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start_round_float_#res#1|)))} main_#t~ret7#1 := round_float_#res#1;assume { :end_inline_round_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;main_#t~short9#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {826#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (_ +zero 8 24)) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:07,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {826#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~res~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (_ +zero 8 24)) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} assume main_#t~short9#1;assume { :begin_inline___signbit_float } true;__signbit_float_#in~x#1 := main_~res~0#1;havoc __signbit_float_#res#1;havoc __signbit_float_#t~mem6#1, __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, __signbit_float_~x#1, __signbit_float_~w~1#1;__signbit_float_~x#1 := __signbit_float_#in~x#1;havoc __signbit_float_~w~1#1; {830#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start___signbit_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} is VALID [2022-02-20 16:46:07,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {830#(exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (_ +zero 8 24)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) |ULTIMATE.start___signbit_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)) (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))))} call __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__signbit_float_~x#1, __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, 4bv32);call __signbit_float_#t~mem6#1 := read~intINTTYPE4(__signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset, 4bv32);__signbit_float_~w~1#1 := __signbit_float_#t~mem6#1;havoc __signbit_float_#t~mem6#1;call ULTIMATE.dealloc(__signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset);havoc __signbit_float_~#gf_u~1#1.base, __signbit_float_~#gf_u~1#1.offset; {834#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:07,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {834#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24))))} goto; {834#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:07,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {834#(exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24))))} __signbit_float_#res#1 := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~1#1) then 1bv32 else 0bv32); {841#(exists ((|ULTIMATE.start___signbit_float_~w~1#1| (_ BitVec 32))) (and (or (and (not (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32))) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32)))) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24))))))} is VALID [2022-02-20 16:46:07,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {841#(exists ((|ULTIMATE.start___signbit_float_~w~1#1| (_ BitVec 32))) (and (or (and (not (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32))) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32)))) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (= (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)) (_ +zero 8 24))))))} main_#t~ret8#1 := __signbit_float_#res#1;assume { :end_inline___signbit_float } true;main_#t~short9#1 := 0bv32 == main_#t~ret8#1; {845#|ULTIMATE.start_main_#t~short9#1|} is VALID [2022-02-20 16:46:07,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {845#|ULTIMATE.start_main_#t~short9#1|} assume !main_#t~short9#1;havoc main_#t~ret8#1;havoc main_#t~short9#1; {785#false} is VALID [2022-02-20 16:46:07,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {785#false} assume !false; {785#false} is VALID [2022-02-20 16:46:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:07,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:07,133 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:07,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752657971] [2022-02-20 16:46:07,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752657971] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:07,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:07,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 16:46:07,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805274819] [2022-02-20 16:46:07,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:07,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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) Word has length 19 [2022-02-20 16:46:07,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:07,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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) [2022-02-20 16:46:07,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:07,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:46:07,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:07,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:46:07,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:46:07,165 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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) [2022-02-20 16:46:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:07,292 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2022-02-20 16:46:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 16:46:07,293 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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) Word has length 19 [2022-02-20 16:46:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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) [2022-02-20 16:46:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2022-02-20 16:46:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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) [2022-02-20 16:46:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2022-02-20 16:46:07,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 19 transitions. [2022-02-20 16:46:07,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:07,326 INFO L225 Difference]: With dead ends: 20 [2022-02-20 16:46:07,326 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:07,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-02-20 16:46:07,327 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:07,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 48 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-02-20 16:46:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:07,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:07,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-02-20 16:46:07,328 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-02-20 16:46:07,328 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-02-20 16:46:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:07,329 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:07,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:07,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:07,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:46:07,329 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:46:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:07,329 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:07,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:07,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:07,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:07,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2022-02-20 16:46:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:07,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-02-20 16:46:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:07,331 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:07,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 11 states have internal predecessors, (19), 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) [2022-02-20 16:46:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:07,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:07,333 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:07,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:07,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:07,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:07,597 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 48) no Hoare annotation was computed. [2022-02-20 16:46:07,597 INFO L858 garLoopResultBuilder]: For program point L60-1(lines 60 64) no Hoare annotation was computed. [2022-02-20 16:46:07,597 INFO L854 garLoopResultBuilder]: At program point L60-2(lines 60 64) the Hoare annotation is: (and (= |ULTIMATE.start_round_float_#res#1| (_ +zero 8 24)) (exists ((|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (let ((.cse0 (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (and (= .cse0 (_ +zero 8 24)) (= .cse0 |ULTIMATE.start___signbit_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)) .cse1))))) (= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24)) |ULTIMATE.start_main_#t~short9#1|) [2022-02-20 16:46:07,597 INFO L858 garLoopResultBuilder]: For program point L60-3(lines 60 64) no Hoare annotation was computed. [2022-02-20 16:46:07,597 INFO L858 garLoopResultBuilder]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2022-02-20 16:46:07,597 INFO L854 garLoopResultBuilder]: At program point L19-2(lines 19 23) the Hoare annotation is: (= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24)) [2022-02-20 16:46:07,597 INFO L858 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2022-02-20 16:46:07,597 INFO L858 garLoopResultBuilder]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2022-02-20 16:46:07,597 INFO L858 garLoopResultBuilder]: For program point L81-2(lines 81 84) no Hoare annotation was computed. [2022-02-20 16:46:07,597 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:07,598 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:07,598 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:07,598 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 41) no Hoare annotation was computed. [2022-02-20 16:46:07,598 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 82) no Hoare annotation was computed. [2022-02-20 16:46:07,598 INFO L861 garLoopResultBuilder]: At program point L86(lines 69 87) the Hoare annotation is: true [2022-02-20 16:46:07,598 INFO L858 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-02-20 16:46:07,598 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2022-02-20 16:46:07,598 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 14 55) no Hoare annotation was computed. [2022-02-20 16:46:07,598 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 53) no Hoare annotation was computed. [2022-02-20 16:46:07,598 INFO L854 garLoopResultBuilder]: At program point L66(lines 57 67) the Hoare annotation is: (and (= |ULTIMATE.start_round_float_#res#1| (_ +zero 8 24)) (= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24)) |ULTIMATE.start_main_#t~short9#1| (exists ((|ULTIMATE.start___signbit_float_~w~1#1| (_ BitVec 32))) (and (let ((.cse0 (= (bvand |ULTIMATE.start___signbit_float_~w~1#1| (_ bv2147483648 32)) (_ bv0 32)))) (or (and (not .cse0) (= |ULTIMATE.start___signbit_float_#res#1| (_ bv1 32))) (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) .cse0))) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 30 23) |ULTIMATE.start___signbit_float_~w~1#1|) ((_ extract 22 0) |ULTIMATE.start___signbit_float_~w~1#1|)) .cse1) (= .cse1 (_ +zero 8 24)))))))) [2022-02-20 16:46:07,599 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:07,599 INFO L854 garLoopResultBuilder]: At program point L54(lines 14 55) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14| (_ BitVec 32)) (|v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9| (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9|) (_ bv0 32)))) (let ((.cse0 (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (and (= .cse0 (_ +zero 8 24)) (= (select (select |#memory_int| |v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14|) (_ bv0 32)) .cse1) (= .cse0 |ULTIMATE.start_round_float_#res#1|))))) (= |ULTIMATE.start_round_float_~x#1| (_ +zero 8 24))) [2022-02-20 16:46:07,599 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 32) no Hoare annotation was computed. [2022-02-20 16:46:07,599 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2022-02-20 16:46:07,599 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2022-02-20 16:46:07,602 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 16:46:07,603 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:07,607 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:07,607 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:07,607 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:07,607 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:07,607 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:07,608 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 16:46:07,608 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2022-02-20 16:46:07,608 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:07,608 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:07,608 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:07,608 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:07,608 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:46:07,608 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:46:07,608 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:07,608 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:07,609 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:46:07,609 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:46:07,609 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:46:07,609 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:46:07,609 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:46:07,609 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:46:07,609 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:46:07,609 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:46:07,609 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:46:07,610 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:07,610 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:46:07,610 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2022-02-20 16:46:07,610 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:46:07,610 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:46:07,610 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:46:07,610 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:46:07,611 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2022-02-20 16:46:07,611 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:07,611 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:07,611 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:07,611 WARN L170 areAnnotationChecker]: L81-2 has no Hoare annotation [2022-02-20 16:46:07,611 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:07,611 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:07,617 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14,QUANTIFIED] [2022-02-20 16:46:07,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,618 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,619 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14,QUANTIFIED] [2022-02-20 16:46:07,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,620 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,621 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,622 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,623 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,623 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,631 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,632 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,632 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,632 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,632 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,632 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,632 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,633 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,634 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,635 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,642 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,643 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,644 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,647 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14,QUANTIFIED] [2022-02-20 16:46:07,648 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,649 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,650 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,650 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,650 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14,QUANTIFIED] [2022-02-20 16:46:07,650 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:07 BoogieIcfgContainer [2022-02-20 16:46:07,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:07,654 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:07,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:07,655 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:07,655 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:02" (3/4) ... [2022-02-20 16:46:07,658 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:07,668 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:46:07,668 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:46:07,669 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:07,669 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:07,692 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14 : bv32, v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == ~Pluszero~LONGDOUBLE() && unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32]) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == \result) && x == ~Pluszero~LONGDOUBLE() [2022-02-20 16:46:07,694 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == ~Pluszero~LONGDOUBLE() && (\exists v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9 : bv32, v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == ~Pluszero~LONGDOUBLE() && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == x) && unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32])) && x == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0f && __signbit_float(res) == 0-aux [2022-02-20 16:46:07,694 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == ~Pluszero~LONGDOUBLE() && x == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0f && __signbit_float(res) == 0-aux) && (\exists ULTIMATE.start___signbit_float_~w~1#1 : bv32 :: ((!(~bvand32(ULTIMATE.start___signbit_float_~w~1#1, 2147483648bv32) == 0bv32) && \result == 1bv32) || (\result == 0bv32 && ~bvand32(ULTIMATE.start___signbit_float_~w~1#1, 2147483648bv32) == 0bv32)) && (\exists v_arrayElimCell_4 : bv32 :: ~fp~LONGDOUBLE(ULTIMATE.start___signbit_float_~w~1#1[31:31], ULTIMATE.start___signbit_float_~w~1#1[30:23], ULTIMATE.start___signbit_float_~w~1#1[22:0]) == ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]) && ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]) == ~Pluszero~LONGDOUBLE())) [2022-02-20 16:46:07,709 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:07,710 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:07,710 INFO L158 Benchmark]: Toolchain (without parser) took 5614.77ms. Allocated memory was 54.5MB in the beginning and 81.8MB in the end (delta: 27.3MB). Free memory was 32.4MB in the beginning and 57.9MB in the end (delta: -25.5MB). Peak memory consumption was 1.7MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,711 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 54.5MB. Free memory was 35.7MB in the beginning and 35.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:07,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.68ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 32.1MB in the beginning and 48.8MB in the end (delta: -16.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.70ms. Allocated memory is still 67.1MB. Free memory was 48.6MB in the beginning and 46.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,714 INFO L158 Benchmark]: Boogie Preprocessor took 34.28ms. Allocated memory is still 67.1MB. Free memory was 46.8MB in the beginning and 45.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:07,714 INFO L158 Benchmark]: RCFGBuilder took 342.63ms. Allocated memory is still 67.1MB. Free memory was 44.9MB in the beginning and 47.5MB in the end (delta: -2.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,715 INFO L158 Benchmark]: TraceAbstraction took 4861.42ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 47.0MB in the beginning and 60.7MB in the end (delta: -13.6MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,715 INFO L158 Benchmark]: Witness Printer took 55.41ms. Allocated memory is still 81.8MB. Free memory was 60.7MB in the beginning and 57.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:07,717 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 54.5MB. Free memory was 35.7MB in the beginning and 35.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.68ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 32.1MB in the beginning and 48.8MB in the end (delta: -16.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.70ms. Allocated memory is still 67.1MB. Free memory was 48.6MB in the beginning and 46.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.28ms. Allocated memory is still 67.1MB. Free memory was 46.8MB in the beginning and 45.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 342.63ms. Allocated memory is still 67.1MB. Free memory was 44.9MB in the beginning and 47.5MB in the end (delta: -2.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4861.42ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 47.0MB in the beginning and 60.7MB in the end (delta: -13.6MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * Witness Printer took 55.41ms. Allocated memory is still 81.8MB. Free memory was 60.7MB in the beginning and 57.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 82]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 285 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 51 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 102 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 182 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 76 ConstructedInterpolants, 26 QuantifiedInterpolants, 969 SizeOfPredicates, 39 NumberOfNonLiveVariables, 291 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 14]: Loop Invariant [2022-02-20 16:46:07,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14,QUANTIFIED] [2022-02-20 16:46:07,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,739 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,740 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14,QUANTIFIED] [2022-02-20 16:46:07,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,741 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] Derived loop invariant: (\exists v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14 : bv32, v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == ~Pluszero~LONGDOUBLE() && unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32]) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == \result) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant [2022-02-20 16:46:07,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,742 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,743 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,743 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,743 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,743 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,743 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,743 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___signbit_float_~w~1#1,QUANTIFIED] [2022-02-20 16:46:07,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] [2022-02-20 16:46:07,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_4,QUANTIFIED] Derived loop invariant: ((\result == ~Pluszero~LONGDOUBLE() && x == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0f && __signbit_float(res) == 0-aux) && (\exists ULTIMATE.start___signbit_float_~w~1#1 : bv32 :: ((!(~bvand32(ULTIMATE.start___signbit_float_~w~1#1, 2147483648bv32) == 0bv32) && \result == 1bv32) || (\result == 0bv32 && ~bvand32(ULTIMATE.start___signbit_float_~w~1#1, 2147483648bv32) == 0bv32)) && (\exists v_arrayElimCell_4 : bv32 :: ~fp~LONGDOUBLE(ULTIMATE.start___signbit_float_~w~1#1[31:31], ULTIMATE.start___signbit_float_~w~1#1[30:23], ULTIMATE.start___signbit_float_~w~1#1[22:0]) == ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]) && ~fp~LONGDOUBLE(v_arrayElimCell_4[31:31], v_arrayElimCell_4[30:23], v_arrayElimCell_4[22:0]) == ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 60]: Loop Invariant [2022-02-20 16:46:07,744 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14,QUANTIFIED] [2022-02-20 16:46:07,745 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,746 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] [2022-02-20 16:46:07,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14,QUANTIFIED] [2022-02-20 16:46:07,747 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9,QUANTIFIED] Derived loop invariant: ((\result == ~Pluszero~LONGDOUBLE() && (\exists v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9 : bv32, v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == ~Pluszero~LONGDOUBLE() && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32][22:0]) == x) && unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#gf_u~0#1.base_14][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_round_float_~#sf_u~0#1.base_9][0bv32])) && x == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0f && __signbit_float(res) == 0-aux RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:07,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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