./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1270c.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_1270c.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 575af8feb7a46b015d4374541233953a0103acadad1e9c8ea0c454cb1ee3d7f4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:47:00,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:47:00,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:47:00,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:47:00,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:47:00,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:47:00,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:47:00,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:47:00,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:47:00,646 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:47:00,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:47:00,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:47:00,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:47:00,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:47:00,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:47:00,649 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:47:00,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:47:00,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:47:00,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:47:00,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:47:00,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:47:00,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:47:00,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:47:00,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:47:00,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:47:00,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:47:00,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:47:00,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:47:00,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:47:00,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:47:00,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:47:00,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:47:00,675 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:47:00,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:47:00,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:47:00,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:47:00,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:47:00,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:47:00,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:47:00,680 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:47:00,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:47:00,682 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:47:00,703 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:47:00,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:47:00,704 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:47:00,704 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:47:00,705 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:47:00,705 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:47:00,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:47:00,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:47:00,706 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:47:00,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:47:00,707 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:47:00,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:47:00,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:47:00,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:47:00,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:47:00,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:47:00,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:47:00,708 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:47:00,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:47:00,708 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:47:00,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:47:00,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:47:00,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:47:00,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:47:00,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:47:00,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:47:00,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:47:00,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:47:00,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:47:00,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:47:00,711 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:47:00,711 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:47:00,711 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:47:00,711 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 -> 575af8feb7a46b015d4374541233953a0103acadad1e9c8ea0c454cb1ee3d7f4 [2022-02-20 16:47:00,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:47:00,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:47:00,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:47:00,911 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:47:00,911 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:47:00,912 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1270c.c [2022-02-20 16:47:00,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34a8567e/9d019432b2d846628ea813dd73cd35e8/FLAGb327e56e5 [2022-02-20 16:47:01,304 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:47:01,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270c.c [2022-02-20 16:47:01,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34a8567e/9d019432b2d846628ea813dd73cd35e8/FLAGb327e56e5 [2022-02-20 16:47:01,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f34a8567e/9d019432b2d846628ea813dd73cd35e8 [2022-02-20 16:47:01,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:47:01,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:47:01,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:47:01,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:47:01,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:47:01,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:47:01" (1/1) ... [2022-02-20 16:47:01,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f72421b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:01, skipping insertion in model container [2022-02-20 16:47:01,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:47:01" (1/1) ... [2022-02-20 16:47:01,331 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:47:01,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:47:01,522 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_1270c.c[4703,4716] [2022-02-20 16:47:01,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:47:01,531 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:47:01,599 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_1270c.c[4703,4716] [2022-02-20 16:47:01,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:47:01,609 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:47:01,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:01 WrapperNode [2022-02-20 16:47:01,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:47:01,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:47:01,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:47:01,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:47:01,615 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:47:01" (1/1) ... [2022-02-20 16:47:01,623 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:47:01" (1/1) ... [2022-02-20 16:47:01,651 INFO L137 Inliner]: procedures = 18, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 254 [2022-02-20 16:47:01,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:47:01,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:47:01,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:47:01,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:47:01,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:01" (1/1) ... [2022-02-20 16:47:01,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:01" (1/1) ... [2022-02-20 16:47:01,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:01" (1/1) ... [2022-02-20 16:47:01,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:01" (1/1) ... [2022-02-20 16:47:01,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:01" (1/1) ... [2022-02-20 16:47:01,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:01" (1/1) ... [2022-02-20 16:47:01,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:01" (1/1) ... [2022-02-20 16:47:01,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:47:01,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:47:01,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:47:01,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:47:01,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:01" (1/1) ... [2022-02-20 16:47:01,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:47:01,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:47:01,741 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:47:01,746 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:47:01,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:47:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:47:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:47:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:47:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:47:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:47:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:47:01,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:47:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:47:01,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:47:01,782 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2022-02-20 16:47:01,782 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2022-02-20 16:47:01,850 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:47:01,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:47:02,375 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:47:02,382 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:47:02,383 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2022-02-20 16:47:02,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:47:02 BoogieIcfgContainer [2022-02-20 16:47:02,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:47:02,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:47:02,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:47:02,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:47:02,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:47:01" (1/3) ... [2022-02-20 16:47:02,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f2985b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:47:02, skipping insertion in model container [2022-02-20 16:47:02,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:01" (2/3) ... [2022-02-20 16:47:02,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f2985b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:47:02, skipping insertion in model container [2022-02-20 16:47:02,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:47:02" (3/3) ... [2022-02-20 16:47:02,390 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270c.c [2022-02-20 16:47:02,396 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:47:02,396 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:47:02,443 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:47:02,448 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:47:02,448 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:47:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 91 states have (on average 1.7252747252747254) internal successors, (157), 92 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:02,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:47:02,468 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:02,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:02,470 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:02,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1724151004, now seen corresponding path program 1 times [2022-02-20 16:47:02,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:47:02,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210604397] [2022-02-20 16:47:02,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:02,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:47:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:02,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#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);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30; {99#true} is VALID [2022-02-20 16:47:02,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := main_#t~nondet25#1;havoc main_#t~nondet25#1;main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);assume { :begin_inline___ieee754_hypotf } true;__ieee754_hypotf_#in~x#1, __ieee754_hypotf_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc __ieee754_hypotf_#res#1;havoc __ieee754_hypotf_#t~mem9#1, __ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset, __ieee754_hypotf_#t~mem10#1, __ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset, __ieee754_hypotf_#t~mem11#1, __ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset, __ieee754_hypotf_#t~mem12#1, __ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset, __ieee754_hypotf_#t~mem13#1, __ieee754_hypotf_~#sf_u~3#1.base, __ieee754_hypotf_~#sf_u~3#1.offset, __ieee754_hypotf_#t~mem14#1, __ieee754_hypotf_~#sf_u~4#1.base, __ieee754_hypotf_~#sf_u~4#1.offset, __ieee754_hypotf_#t~mem15#1, __ieee754_hypotf_~#sf_u~5#1.base, __ieee754_hypotf_~#sf_u~5#1.offset, __ieee754_hypotf_#t~mem16#1, __ieee754_hypotf_~#sf_u~6#1.base, __ieee754_hypotf_~#sf_u~6#1.offset, __ieee754_hypotf_#t~mem17#1, __ieee754_hypotf_~#sf_u~7#1.base, __ieee754_hypotf_~#sf_u~7#1.offset, __ieee754_hypotf_#t~mem18#1, __ieee754_hypotf_~#sf_u~8#1.base, __ieee754_hypotf_~#sf_u~8#1.offset, __ieee754_hypotf_#t~ret19#1, __ieee754_hypotf_#t~mem20#1, __ieee754_hypotf_~#sf_u~9#1.base, __ieee754_hypotf_~#sf_u~9#1.offset, __ieee754_hypotf_#t~mem21#1, __ieee754_hypotf_~#sf_u~10#1.base, __ieee754_hypotf_~#sf_u~10#1.offset, __ieee754_hypotf_#t~ret22#1, __ieee754_hypotf_#t~mem23#1, __ieee754_hypotf_~#sf_u~11#1.base, __ieee754_hypotf_~#sf_u~11#1.offset, __ieee754_hypotf_~x#1, __ieee754_hypotf_~y#1, __ieee754_hypotf_~a~0#1, __ieee754_hypotf_~b~0#1, __ieee754_hypotf_~t1~0#1, __ieee754_hypotf_~t2~0#1, __ieee754_hypotf_~y1~0#1, __ieee754_hypotf_~y2~0#1, __ieee754_hypotf_~w~0#1, __ieee754_hypotf_~j~0#1, __ieee754_hypotf_~k~0#1, __ieee754_hypotf_~ha~0#1, __ieee754_hypotf_~hb~0#1;__ieee754_hypotf_~x#1 := __ieee754_hypotf_#in~x#1;__ieee754_hypotf_~y#1 := __ieee754_hypotf_#in~y#1;__ieee754_hypotf_~a~0#1 := __ieee754_hypotf_~x#1;__ieee754_hypotf_~b~0#1 := __ieee754_hypotf_~y#1;havoc __ieee754_hypotf_~t1~0#1;havoc __ieee754_hypotf_~t2~0#1;havoc __ieee754_hypotf_~y1~0#1;havoc __ieee754_hypotf_~y2~0#1;havoc __ieee754_hypotf_~w~0#1;havoc __ieee754_hypotf_~j~0#1;havoc __ieee754_hypotf_~k~0#1;havoc __ieee754_hypotf_~ha~0#1;havoc __ieee754_hypotf_~hb~0#1; {99#true} is VALID [2022-02-20 16:47:02,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume !true; {100#false} is VALID [2022-02-20 16:47:02,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {100#false} __ieee754_hypotf_~ha~0#1 := (if 0 == __ieee754_hypotf_~ha~0#1 then 0 else (if 1 == __ieee754_hypotf_~ha~0#1 then 1 else ~bitwiseAnd(__ieee754_hypotf_~ha~0#1, 2147483647))); {100#false} is VALID [2022-02-20 16:47:02,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {100#false} assume !true; {100#false} is VALID [2022-02-20 16:47:02,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#false} __ieee754_hypotf_~hb~0#1 := (if 0 == __ieee754_hypotf_~hb~0#1 then 0 else (if 1 == __ieee754_hypotf_~hb~0#1 then 1 else ~bitwiseAnd(__ieee754_hypotf_~hb~0#1, 2147483647))); {100#false} is VALID [2022-02-20 16:47:02,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#false} assume !(__ieee754_hypotf_~hb~0#1 > __ieee754_hypotf_~ha~0#1);__ieee754_hypotf_~a~0#1 := __ieee754_hypotf_~x#1;__ieee754_hypotf_~b~0#1 := __ieee754_hypotf_~y#1; {100#false} is VALID [2022-02-20 16:47:02,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {100#false} assume !true; {100#false} is VALID [2022-02-20 16:47:02,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {100#false} assume !true; {100#false} is VALID [2022-02-20 16:47:02,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {100#false} assume __ieee754_hypotf_~ha~0#1 - __ieee754_hypotf_~hb~0#1 > 251658240;__ieee754_hypotf_#res#1 := ~someBinaryArithmeticFLOAToperation(__ieee754_hypotf_~a~0#1, __ieee754_hypotf_~b~0#1); {100#false} is VALID [2022-02-20 16:47:02,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {100#false} main_#t~ret26#1 := __ieee754_hypotf_#res#1;assume { :end_inline___ieee754_hypotf } true;main_~res~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem24#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {100#false} is VALID [2022-02-20 16:47:02,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {100#false} assume !true; {100#false} is VALID [2022-02-20 16:47:02,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {100#false} isinf_float_~ix~1#1 := (if 0 == isinf_float_~ix~1#1 then 0 else (if 1 == isinf_float_~ix~1#1 then 1 else ~bitwiseAnd(isinf_float_~ix~1#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~1#1 then 1 else 0); {100#false} is VALID [2022-02-20 16:47:02,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {100#false} main_#t~ret27#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret27#1 && main_#t~ret27#1 <= 2147483647; {100#false} is VALID [2022-02-20 16:47:02,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {100#false} assume 0 == main_#t~ret27#1;havoc main_#t~ret27#1; {100#false} is VALID [2022-02-20 16:47:02,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {100#false} assume !false; {100#false} is VALID [2022-02-20 16:47:02,605 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:47:02,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:47:02,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210604397] [2022-02-20 16:47:02,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210604397] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:02,607 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:02,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:47:02,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161936570] [2022-02-20 16:47:02,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:02,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 16:47:02,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:02,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:02,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:02,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:47:02,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:47:02,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:47:02,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:47:02,663 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.7252747252747254) internal successors, (157), 92 states have internal predecessors, (157), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:02,786 INFO L93 Difference]: Finished difference Result 190 states and 322 transitions. [2022-02-20 16:47:02,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:47:02,786 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 16:47:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 322 transitions. [2022-02-20 16:47:02,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 322 transitions. [2022-02-20 16:47:02,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 322 transitions. [2022-02-20 16:47:03,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 322 edges. 322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:03,041 INFO L225 Difference]: With dead ends: 190 [2022-02-20 16:47:03,041 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 16:47:03,044 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:47:03,047 INFO L933 BasicCegarLoop]: 121 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, 121 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:47:03,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:47:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 16:47:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-02-20 16:47:03,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:03,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:03,076 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:03,076 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:03,081 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2022-02-20 16:47:03,081 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-02-20 16:47:03,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:03,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:03,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-02-20 16:47:03,082 INFO L87 Difference]: Start difference. First operand has 93 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-02-20 16:47:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:03,086 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2022-02-20 16:47:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-02-20 16:47:03,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:03,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:03,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:03,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:03,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2022-02-20 16:47:03,091 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 16 [2022-02-20 16:47:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:03,091 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2022-02-20 16:47:03,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-02-20 16:47:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:47:03,092 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:03,092 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:03,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:47:03,093 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:03,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:03,093 INFO L85 PathProgramCache]: Analyzing trace with hash -927967701, now seen corresponding path program 1 times [2022-02-20 16:47:03,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:47:03,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522538512] [2022-02-20 16:47:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:03,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:47:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:47:03,161 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:47:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:47:03,234 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:47:03,235 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:47:03,236 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:47:03,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:47:03,241 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:47:03,243 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:47:03,274 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:47:03,276 WARN L170 areAnnotationChecker]: __ieee754_sqrtfENTRY has no Hoare annotation [2022-02-20 16:47:03,276 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:47:03,276 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:47:03,276 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:47:03,276 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:47:03,276 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:47:03,276 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:47:03,276 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:47:03,277 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:47:03,277 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:47:03,277 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-02-20 16:47:03,277 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-02-20 16:47:03,277 WARN L170 areAnnotationChecker]: L87-3 has no Hoare annotation [2022-02-20 16:47:03,277 WARN L170 areAnnotationChecker]: L26-7 has no Hoare annotation [2022-02-20 16:47:03,277 WARN L170 areAnnotationChecker]: L26-7 has no Hoare annotation [2022-02-20 16:47:03,277 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:47:03,277 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:47:03,277 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-02-20 16:47:03,278 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-02-20 16:47:03,278 WARN L170 areAnnotationChecker]: __ieee754_sqrtfFINAL has no Hoare annotation [2022-02-20 16:47:03,278 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:47:03,278 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:47:03,278 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:47:03,278 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:47:03,278 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-02-20 16:47:03,278 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-02-20 16:47:03,278 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-02-20 16:47:03,279 WARN L170 areAnnotationChecker]: __ieee754_sqrtfEXIT has no Hoare annotation [2022-02-20 16:47:03,279 WARN L170 areAnnotationChecker]: __ieee754_sqrtfEXIT has no Hoare annotation [2022-02-20 16:47:03,279 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:47:03,279 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:47:03,279 WARN L170 areAnnotationChecker]: L26-5 has no Hoare annotation [2022-02-20 16:47:03,279 WARN L170 areAnnotationChecker]: L26-5 has no Hoare annotation [2022-02-20 16:47:03,279 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:47:03,279 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:47:03,279 WARN L170 areAnnotationChecker]: L184-1 has no Hoare annotation [2022-02-20 16:47:03,280 WARN L170 areAnnotationChecker]: L199-1 has no Hoare annotation [2022-02-20 16:47:03,280 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:47:03,280 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:47:03,280 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2022-02-20 16:47:03,280 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2022-02-20 16:47:03,280 WARN L170 areAnnotationChecker]: L177-2 has no Hoare annotation [2022-02-20 16:47:03,280 WARN L170 areAnnotationChecker]: L177-2 has no Hoare annotation [2022-02-20 16:47:03,281 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:47:03,281 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:47:03,281 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:47:03,281 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:47:03,281 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:47:03,282 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:47:03,282 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2022-02-20 16:47:03,282 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2022-02-20 16:47:03,282 WARN L170 areAnnotationChecker]: L202-2 has no Hoare annotation [2022-02-20 16:47:03,283 WARN L170 areAnnotationChecker]: L202-2 has no Hoare annotation [2022-02-20 16:47:03,283 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2022-02-20 16:47:03,283 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2022-02-20 16:47:03,283 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:47:03,283 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:47:03,283 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:47:03,283 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-02-20 16:47:03,283 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-02-20 16:47:03,283 WARN L170 areAnnotationChecker]: L114-2 has no Hoare annotation [2022-02-20 16:47:03,283 WARN L170 areAnnotationChecker]: L114-2 has no Hoare annotation [2022-02-20 16:47:03,284 WARN L170 areAnnotationChecker]: L202-1 has no Hoare annotation [2022-02-20 16:47:03,284 WARN L170 areAnnotationChecker]: L202-1 has no Hoare annotation [2022-02-20 16:47:03,284 WARN L170 areAnnotationChecker]: L202-3 has no Hoare annotation [2022-02-20 16:47:03,284 WARN L170 areAnnotationChecker]: L215-2 has no Hoare annotation [2022-02-20 16:47:03,284 WARN L170 areAnnotationChecker]: L215-2 has no Hoare annotation [2022-02-20 16:47:03,284 WARN L170 areAnnotationChecker]: L43-8 has no Hoare annotation [2022-02-20 16:47:03,284 WARN L170 areAnnotationChecker]: L43-8 has no Hoare annotation [2022-02-20 16:47:03,284 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:47:03,284 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:47:03,285 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:47:03,285 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:47:03,285 WARN L170 areAnnotationChecker]: L215-1 has no Hoare annotation [2022-02-20 16:47:03,285 WARN L170 areAnnotationChecker]: L215-1 has no Hoare annotation [2022-02-20 16:47:03,285 WARN L170 areAnnotationChecker]: L215-3 has no Hoare annotation [2022-02-20 16:47:03,285 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2022-02-20 16:47:03,285 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2022-02-20 16:47:03,285 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2022-02-20 16:47:03,285 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:47:03,286 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:47:03,286 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2022-02-20 16:47:03,286 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2022-02-20 16:47:03,286 WARN L170 areAnnotationChecker]: L221 has no Hoare annotation [2022-02-20 16:47:03,286 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:47:03,286 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:47:03,286 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:47:03,286 WARN L170 areAnnotationChecker]: L43-6 has no Hoare annotation [2022-02-20 16:47:03,287 WARN L170 areAnnotationChecker]: L43-6 has no Hoare annotation [2022-02-20 16:47:03,287 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-02-20 16:47:03,287 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-02-20 16:47:03,287 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:47:03,287 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:47:03,287 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2022-02-20 16:47:03,287 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2022-02-20 16:47:03,287 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:47:03,287 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2022-02-20 16:47:03,288 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2022-02-20 16:47:03,288 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:47:03,288 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:47:03,288 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:47:03,288 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:47:03,288 WARN L170 areAnnotationChecker]: L126-2 has no Hoare annotation [2022-02-20 16:47:03,290 WARN L170 areAnnotationChecker]: L126-2 has no Hoare annotation [2022-02-20 16:47:03,290 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-20 16:47:03,290 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-20 16:47:03,291 WARN L170 areAnnotationChecker]: L141-1 has no Hoare annotation [2022-02-20 16:47:03,291 WARN L170 areAnnotationChecker]: L141-1 has no Hoare annotation [2022-02-20 16:47:03,291 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2022-02-20 16:47:03,291 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2022-02-20 16:47:03,291 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:47:03,291 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:47:03,295 WARN L170 areAnnotationChecker]: L237 has no Hoare annotation [2022-02-20 16:47:03,295 WARN L170 areAnnotationChecker]: L237 has no Hoare annotation [2022-02-20 16:47:03,295 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2022-02-20 16:47:03,295 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:47:03,295 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:47:03,295 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:47:03,296 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:47:03,296 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2022-02-20 16:47:03,296 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-02-20 16:47:03,296 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-02-20 16:47:03,296 WARN L170 areAnnotationChecker]: L151-2 has no Hoare annotation [2022-02-20 16:47:03,296 WARN L170 areAnnotationChecker]: L151-2 has no Hoare annotation [2022-02-20 16:47:03,296 WARN L170 areAnnotationChecker]: L163-2 has no Hoare annotation [2022-02-20 16:47:03,296 WARN L170 areAnnotationChecker]: L163-2 has no Hoare annotation [2022-02-20 16:47:03,296 WARN L170 areAnnotationChecker]: L178-2 has no Hoare annotation [2022-02-20 16:47:03,296 WARN L170 areAnnotationChecker]: L178-2 has no Hoare annotation [2022-02-20 16:47:03,296 WARN L170 areAnnotationChecker]: L187-2 has no Hoare annotation [2022-02-20 16:47:03,297 WARN L170 areAnnotationChecker]: L187-2 has no Hoare annotation [2022-02-20 16:47:03,297 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:47:03,297 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:47:03,297 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:47:03,297 WARN L170 areAnnotationChecker]: L75-2 has no Hoare annotation [2022-02-20 16:47:03,297 WARN L170 areAnnotationChecker]: L75-2 has no Hoare annotation [2022-02-20 16:47:03,297 WARN L170 areAnnotationChecker]: L151-1 has no Hoare annotation [2022-02-20 16:47:03,297 WARN L170 areAnnotationChecker]: L151-1 has no Hoare annotation [2022-02-20 16:47:03,297 WARN L170 areAnnotationChecker]: L151-3 has no Hoare annotation [2022-02-20 16:47:03,297 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-02-20 16:47:03,298 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-02-20 16:47:03,298 WARN L170 areAnnotationChecker]: L168-1 has no Hoare annotation [2022-02-20 16:47:03,298 WARN L170 areAnnotationChecker]: L168-1 has no Hoare annotation [2022-02-20 16:47:03,298 WARN L170 areAnnotationChecker]: L178-1 has no Hoare annotation [2022-02-20 16:47:03,298 WARN L170 areAnnotationChecker]: L178-1 has no Hoare annotation [2022-02-20 16:47:03,298 WARN L170 areAnnotationChecker]: L178-3 has no Hoare annotation [2022-02-20 16:47:03,298 WARN L170 areAnnotationChecker]: L187-1 has no Hoare annotation [2022-02-20 16:47:03,298 WARN L170 areAnnotationChecker]: L187-1 has no Hoare annotation [2022-02-20 16:47:03,298 WARN L170 areAnnotationChecker]: L187-3 has no Hoare annotation [2022-02-20 16:47:03,298 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:47:03,299 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:47:03,299 WARN L170 areAnnotationChecker]: L75-3 has no Hoare annotation [2022-02-20 16:47:03,299 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2022-02-20 16:47:03,299 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2022-02-20 16:47:03,299 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:47:03,299 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:47:03,299 WARN L170 areAnnotationChecker]: L193-2 has no Hoare annotation [2022-02-20 16:47:03,299 WARN L170 areAnnotationChecker]: L193-2 has no Hoare annotation [2022-02-20 16:47:03,299 WARN L170 areAnnotationChecker]: L193-1 has no Hoare annotation [2022-02-20 16:47:03,299 WARN L170 areAnnotationChecker]: L193-1 has no Hoare annotation [2022-02-20 16:47:03,300 WARN L170 areAnnotationChecker]: L193-3 has no Hoare annotation [2022-02-20 16:47:03,300 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-02-20 16:47:03,300 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-02-20 16:47:03,300 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:47:03,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:47:03 BoogieIcfgContainer [2022-02-20 16:47:03,303 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:47:03,303 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:47:03,303 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:47:03,303 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:47:03,304 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:47:02" (3/4) ... [2022-02-20 16:47:03,306 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:47:03,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:47:03,307 INFO L158 Benchmark]: Toolchain (without parser) took 1988.63ms. Allocated memory was 94.4MB in the beginning and 134.2MB in the end (delta: 39.8MB). Free memory was 64.3MB in the beginning and 74.2MB in the end (delta: -9.9MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2022-02-20 16:47:03,307 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 94.4MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:47:03,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.00ms. Allocated memory was 94.4MB in the beginning and 134.2MB in the end (delta: 39.8MB). Free memory was 64.1MB in the beginning and 105.2MB in the end (delta: -41.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:47:03,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.29ms. Allocated memory is still 134.2MB. Free memory was 105.2MB in the beginning and 102.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:47:03,312 INFO L158 Benchmark]: Boogie Preprocessor took 53.83ms. Allocated memory is still 134.2MB. Free memory was 102.3MB in the beginning and 99.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:47:03,312 INFO L158 Benchmark]: RCFGBuilder took 677.63ms. Allocated memory is still 134.2MB. Free memory was 99.4MB in the beginning and 103.0MB in the end (delta: -3.6MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2022-02-20 16:47:03,312 INFO L158 Benchmark]: TraceAbstraction took 917.71ms. Allocated memory is still 134.2MB. Free memory was 102.2MB in the beginning and 74.5MB in the end (delta: 27.7MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2022-02-20 16:47:03,313 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 134.2MB. Free memory was 74.5MB in the beginning and 74.2MB in the end (delta: 325.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:47:03,320 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.10ms. Allocated memory is still 94.4MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.00ms. Allocated memory was 94.4MB in the beginning and 134.2MB in the end (delta: 39.8MB). Free memory was 64.1MB in the beginning and 105.2MB in the end (delta: -41.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.29ms. Allocated memory is still 134.2MB. Free memory was 105.2MB in the beginning and 102.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.83ms. Allocated memory is still 134.2MB. Free memory was 102.3MB in the beginning and 99.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 677.63ms. Allocated memory is still 134.2MB. Free memory was 99.4MB in the beginning and 103.0MB in the end (delta: -3.6MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * TraceAbstraction took 917.71ms. Allocated memory is still 134.2MB. Free memory was 102.2MB in the beginning and 74.5MB in the end (delta: 27.7MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 134.2MB. Free memory was 74.5MB in the beginning and 74.2MB in the end (delta: 325.9kB). 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: 237]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 120, overapproximation of bitwiseAnd at line 220. Possible FailurePath: [L14] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L231] float x = __VERIFIER_nondet_float(); [L232] float y = 1.0f / 0.0f; [L234] CALL, EXPR __ieee754_hypotf(x, y) [L84] float a = x, b = y, t1, t2, y1, y2, w; [L85] __int32_t j, k, ha, hb; VAL [\old(x)=8589934591, \old(y)=8589934592, a=8589934591, b=8589934592, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934591, y=8589934592] [L88] ieee_float_shape_type gf_u; [L89] gf_u.value = (x) [L90] EXPR gf_u.word [L90] (ha) = gf_u.word [L92] ha &= 0x7fffffffL VAL [\old(x)=8589934591, \old(y)=8589934592, a=8589934591, b=8589934592, ha=251658241, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934591, y=8589934592] [L94] ieee_float_shape_type gf_u; [L95] gf_u.value = (y) [L96] EXPR gf_u.word [L96] (hb) = gf_u.word [L98] hb &= 0x7fffffffL VAL [\old(x)=8589934591, \old(y)=8589934592, a=8589934591, b=8589934592, ha=251658241, hb=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934591, y=8589934592] [L99] COND FALSE !(hb > ha) [L106] a = x [L107] b = y VAL [\old(x)=8589934591, \old(y)=8589934592, a=8589934591, b=8589934592, ha=251658241, hb=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934591, y=8589934592] [L110] ieee_float_shape_type sf_u; [L111] sf_u.word = (ha) [L112] EXPR sf_u.value [L112] (a) = sf_u.value [L115] ieee_float_shape_type sf_u; [L116] sf_u.word = (hb) [L117] EXPR sf_u.value [L117] (b) = sf_u.value [L119] COND TRUE (ha - hb) > 0xf000000L [L120] return a + b; VAL [\old(x)=8589934591, \old(y)=8589934592, a=8589934593, b=8589934594, ha=251658241, hb=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934591, y=8589934592] [L234] RET, EXPR __ieee754_hypotf(x, y) [L234] float res = __ieee754_hypotf(x, y); [L236] CALL, EXPR isinf_float(res) [L214] __int32_t ix; VAL [\old(x)=8589934595, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934595] [L216] ieee_float_shape_type gf_u; [L217] gf_u.value = (x) [L218] EXPR gf_u.word [L218] (ix) = gf_u.word [L220] ix &= 0x7fffffff [L221] return ((ix) == 0x7f800000L); VAL [\old(x)=8589934595, \result=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=8589934595] [L236] RET, EXPR isinf_float(res) [L236] COND TRUE !isinf_float(res) [L237] reach_error() VAL [one_sqrt=1, res=8589934595, tiny_sqrt=1/1000000000000000000000000000000, x=8589934591, y=8589934592] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, 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, 121 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, 121 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=96occurred 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.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 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:47:03,353 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_1270c.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 575af8feb7a46b015d4374541233953a0103acadad1e9c8ea0c454cb1ee3d7f4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:47:04,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:47:04,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:47:04,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:47:04,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:47:04,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:47:04,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:47:04,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:47:04,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:47:05,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:47:05,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:47:05,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:47:05,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:47:05,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:47:05,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:47:05,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:47:05,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:47:05,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:47:05,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:47:05,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:47:05,018 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:47:05,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:47:05,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:47:05,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:47:05,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:47:05,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:47:05,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:47:05,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:47:05,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:47:05,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:47:05,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:47:05,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:47:05,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:47:05,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:47:05,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:47:05,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:47:05,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:47:05,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:47:05,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:47:05,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:47:05,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:47:05,035 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:47:05,061 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:47:05,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:47:05,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:47:05,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:47:05,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:47:05,063 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:47:05,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:47:05,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:47:05,065 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:47:05,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:47:05,066 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:47:05,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:47:05,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:47:05,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:47:05,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:47:05,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:47:05,066 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:47:05,067 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:47:05,067 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:47:05,067 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:47:05,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:47:05,067 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:47:05,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:47:05,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:47:05,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:47:05,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:47:05,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:47:05,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:47:05,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:47:05,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:47:05,068 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:47:05,069 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:47:05,069 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:47:05,069 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:47:05,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:47:05,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:47:05,069 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 -> 575af8feb7a46b015d4374541233953a0103acadad1e9c8ea0c454cb1ee3d7f4 [2022-02-20 16:47:05,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:47:05,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:47:05,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:47:05,339 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:47:05,339 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:47:05,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1270c.c [2022-02-20 16:47:05,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09c0be005/75fae8ed0c804d5aa5ca250a7fc361a0/FLAG403384bca [2022-02-20 16:47:05,767 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:47:05,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270c.c [2022-02-20 16:47:05,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09c0be005/75fae8ed0c804d5aa5ca250a7fc361a0/FLAG403384bca [2022-02-20 16:47:06,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09c0be005/75fae8ed0c804d5aa5ca250a7fc361a0 [2022-02-20 16:47:06,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:47:06,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:47:06,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:47:06,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:47:06,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:47:06,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:47:06" (1/1) ... [2022-02-20 16:47:06,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1567ba22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:06, skipping insertion in model container [2022-02-20 16:47:06,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:47:06" (1/1) ... [2022-02-20 16:47:06,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:47:06,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:47:06,352 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_1270c.c[4703,4716] [2022-02-20 16:47:06,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:47:06,361 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:47:06,392 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_1270c.c[4703,4716] [2022-02-20 16:47:06,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:47:06,404 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:47:06,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:06 WrapperNode [2022-02-20 16:47:06,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:47:06,405 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:47:06,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:47:06,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:47:06,410 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:47:06" (1/1) ... [2022-02-20 16:47:06,418 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:47:06" (1/1) ... [2022-02-20 16:47:06,441 INFO L137 Inliner]: procedures = 21, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 254 [2022-02-20 16:47:06,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:47:06,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:47:06,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:47:06,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:47:06,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:06" (1/1) ... [2022-02-20 16:47:06,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:06" (1/1) ... [2022-02-20 16:47:06,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:06" (1/1) ... [2022-02-20 16:47:06,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:06" (1/1) ... [2022-02-20 16:47:06,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:06" (1/1) ... [2022-02-20 16:47:06,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:06" (1/1) ... [2022-02-20 16:47:06,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:06" (1/1) ... [2022-02-20 16:47:06,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:47:06,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:47:06,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:47:06,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:47:06,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:06" (1/1) ... [2022-02-20 16:47:06,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:47:06,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:47:06,499 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:47:06,502 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:47:06,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:47:06,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:47:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:47:06,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:47:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:47:06,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:47:06,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:47:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:47:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:47:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:47:06,527 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2022-02-20 16:47:06,527 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2022-02-20 16:47:06,640 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:47:06,641 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:47:07,673 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:47:07,679 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:47:07,679 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2022-02-20 16:47:07,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:47:07 BoogieIcfgContainer [2022-02-20 16:47:07,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:47:07,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:47:07,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:47:07,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:47:07,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:47:06" (1/3) ... [2022-02-20 16:47:07,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2a1541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:47:07, skipping insertion in model container [2022-02-20 16:47:07,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:06" (2/3) ... [2022-02-20 16:47:07,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2a1541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:47:07, skipping insertion in model container [2022-02-20 16:47:07,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:47:07" (3/3) ... [2022-02-20 16:47:07,687 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270c.c [2022-02-20 16:47:07,691 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:47:07,692 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:47:07,745 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:47:07,750 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:47:07,750 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:47:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 84 states have (on average 1.6904761904761905) internal successors, (142), 85 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:47:07,769 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:07,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:07,770 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:07,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:07,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1724151004, now seen corresponding path program 1 times [2022-02-20 16:47:07,786 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:07,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1362637461] [2022-02-20 16:47:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:07,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:07,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:07,790 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:47:07,796 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:47:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:07,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:47:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:07,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:08,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {92#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);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {92#true} is VALID [2022-02-20 16:47:08,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet23#1, main_#t~ret24#1, main_#t~ret25#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_hypotf } true;__ieee754_hypotf_#in~x#1, __ieee754_hypotf_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc __ieee754_hypotf_#res#1;havoc __ieee754_hypotf_#t~mem7#1, __ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset, __ieee754_hypotf_#t~mem8#1, __ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset, __ieee754_hypotf_#t~mem9#1, __ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset, __ieee754_hypotf_#t~mem10#1, __ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset, __ieee754_hypotf_#t~mem11#1, __ieee754_hypotf_~#sf_u~3#1.base, __ieee754_hypotf_~#sf_u~3#1.offset, __ieee754_hypotf_#t~mem12#1, __ieee754_hypotf_~#sf_u~4#1.base, __ieee754_hypotf_~#sf_u~4#1.offset, __ieee754_hypotf_#t~mem13#1, __ieee754_hypotf_~#sf_u~5#1.base, __ieee754_hypotf_~#sf_u~5#1.offset, __ieee754_hypotf_#t~mem14#1, __ieee754_hypotf_~#sf_u~6#1.base, __ieee754_hypotf_~#sf_u~6#1.offset, __ieee754_hypotf_#t~mem15#1, __ieee754_hypotf_~#sf_u~7#1.base, __ieee754_hypotf_~#sf_u~7#1.offset, __ieee754_hypotf_#t~mem16#1, __ieee754_hypotf_~#sf_u~8#1.base, __ieee754_hypotf_~#sf_u~8#1.offset, __ieee754_hypotf_#t~ret17#1, __ieee754_hypotf_#t~mem18#1, __ieee754_hypotf_~#sf_u~9#1.base, __ieee754_hypotf_~#sf_u~9#1.offset, __ieee754_hypotf_#t~mem19#1, __ieee754_hypotf_~#sf_u~10#1.base, __ieee754_hypotf_~#sf_u~10#1.offset, __ieee754_hypotf_#t~ret20#1, __ieee754_hypotf_#t~mem21#1, __ieee754_hypotf_~#sf_u~11#1.base, __ieee754_hypotf_~#sf_u~11#1.offset, __ieee754_hypotf_~x#1, __ieee754_hypotf_~y#1, __ieee754_hypotf_~a~0#1, __ieee754_hypotf_~b~0#1, __ieee754_hypotf_~t1~0#1, __ieee754_hypotf_~t2~0#1, __ieee754_hypotf_~y1~0#1, __ieee754_hypotf_~y2~0#1, __ieee754_hypotf_~w~0#1, __ieee754_hypotf_~j~0#1, __ieee754_hypotf_~k~0#1, __ieee754_hypotf_~ha~0#1, __ieee754_hypotf_~hb~0#1;__ieee754_hypotf_~x#1 := __ieee754_hypotf_#in~x#1;__ieee754_hypotf_~y#1 := __ieee754_hypotf_#in~y#1;__ieee754_hypotf_~a~0#1 := __ieee754_hypotf_~x#1;__ieee754_hypotf_~b~0#1 := __ieee754_hypotf_~y#1;havoc __ieee754_hypotf_~t1~0#1;havoc __ieee754_hypotf_~t2~0#1;havoc __ieee754_hypotf_~y1~0#1;havoc __ieee754_hypotf_~y2~0#1;havoc __ieee754_hypotf_~w~0#1;havoc __ieee754_hypotf_~j~0#1;havoc __ieee754_hypotf_~k~0#1;havoc __ieee754_hypotf_~ha~0#1;havoc __ieee754_hypotf_~hb~0#1; {92#true} is VALID [2022-02-20 16:47:08,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {92#true} assume !true; {93#false} is VALID [2022-02-20 16:47:08,044 INFO L290 TraceCheckUtils]: 3: Hoare triple {93#false} __ieee754_hypotf_~ha~0#1 := ~bvand32(2147483647bv32, __ieee754_hypotf_~ha~0#1); {93#false} is VALID [2022-02-20 16:47:08,044 INFO L290 TraceCheckUtils]: 4: Hoare triple {93#false} assume !true; {93#false} is VALID [2022-02-20 16:47:08,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {93#false} __ieee754_hypotf_~hb~0#1 := ~bvand32(2147483647bv32, __ieee754_hypotf_~hb~0#1); {93#false} is VALID [2022-02-20 16:47:08,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {93#false} assume !~bvsgt32(__ieee754_hypotf_~hb~0#1, __ieee754_hypotf_~ha~0#1);__ieee754_hypotf_~a~0#1 := __ieee754_hypotf_~x#1;__ieee754_hypotf_~b~0#1 := __ieee754_hypotf_~y#1; {93#false} is VALID [2022-02-20 16:47:08,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {93#false} assume !true; {93#false} is VALID [2022-02-20 16:47:08,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {93#false} assume !true; {93#false} is VALID [2022-02-20 16:47:08,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {93#false} assume ~bvsgt32(~bvsub32(__ieee754_hypotf_~ha~0#1, __ieee754_hypotf_~hb~0#1), 251658240bv32);__ieee754_hypotf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_hypotf_~a~0#1, __ieee754_hypotf_~b~0#1); {93#false} is VALID [2022-02-20 16:47:08,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {93#false} main_#t~ret24#1 := __ieee754_hypotf_#res#1;assume { :end_inline___ieee754_hypotf } true;main_~res~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem22#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {93#false} is VALID [2022-02-20 16:47:08,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {93#false} assume !true; {93#false} is VALID [2022-02-20 16:47:08,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {93#false} isinf_float_~ix~1#1 := ~bvand32(2147483647bv32, isinf_float_~ix~1#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~1#1 then 1bv32 else 0bv32); {93#false} is VALID [2022-02-20 16:47:08,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {93#false} main_#t~ret25#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {93#false} is VALID [2022-02-20 16:47:08,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {93#false} assume 0bv32 == main_#t~ret25#1;havoc main_#t~ret25#1; {93#false} is VALID [2022-02-20 16:47:08,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {93#false} assume !false; {93#false} is VALID [2022-02-20 16:47:08,047 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:47:08,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:08,048 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:08,048 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1362637461] [2022-02-20 16:47:08,049 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1362637461] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:08,049 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:08,049 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:47:08,050 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859400814] [2022-02-20 16:47:08,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:08,054 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 16:47:08,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:08,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:08,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:08,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:47:08,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:08,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:47:08,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:47:08,103 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.6904761904761905) internal successors, (142), 85 states have internal predecessors, (142), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:18,776 INFO L93 Difference]: Finished difference Result 176 states and 292 transitions. [2022-02-20 16:47:18,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:47:18,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 16:47:18,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2022-02-20 16:47:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:18,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2022-02-20 16:47:18,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 292 transitions. [2022-02-20 16:47:20,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:20,976 INFO L225 Difference]: With dead ends: 176 [2022-02-20 16:47:20,976 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 16:47:20,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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:47:20,981 INFO L933 BasicCegarLoop]: 111 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, 111 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:47:20,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:47:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 16:47:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-02-20 16:47:21,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:21,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:21,005 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:21,005 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:21,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:21,010 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-02-20 16:47:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-02-20 16:47:21,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:21,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:21,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 86 states. [2022-02-20 16:47:21,013 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 86 states. [2022-02-20 16:47:21,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:21,017 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-02-20 16:47:21,017 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-02-20 16:47:21,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:21,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:21,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:21,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:47:21,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-02-20 16:47:21,030 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 16 [2022-02-20 16:47:21,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:21,030 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-02-20 16:47:21,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:47:21,031 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-02-20 16:47:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:47:21,031 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:21,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:47:21,043 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:47:21,243 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:47:21,243 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:21,244 INFO L85 PathProgramCache]: Analyzing trace with hash -927967701, now seen corresponding path program 1 times [2022-02-20 16:47:21,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:21,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352359358] [2022-02-20 16:47:21,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:21,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:21,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:21,248 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:47:21,250 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:47:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:21,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 16:47:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:21,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:22,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {634#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);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {634#true} is VALID [2022-02-20 16:47:22,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {634#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet23#1, main_#t~ret24#1, main_#t~ret25#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_hypotf } true;__ieee754_hypotf_#in~x#1, __ieee754_hypotf_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc __ieee754_hypotf_#res#1;havoc __ieee754_hypotf_#t~mem7#1, __ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset, __ieee754_hypotf_#t~mem8#1, __ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset, __ieee754_hypotf_#t~mem9#1, __ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset, __ieee754_hypotf_#t~mem10#1, __ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset, __ieee754_hypotf_#t~mem11#1, __ieee754_hypotf_~#sf_u~3#1.base, __ieee754_hypotf_~#sf_u~3#1.offset, __ieee754_hypotf_#t~mem12#1, __ieee754_hypotf_~#sf_u~4#1.base, __ieee754_hypotf_~#sf_u~4#1.offset, __ieee754_hypotf_#t~mem13#1, __ieee754_hypotf_~#sf_u~5#1.base, __ieee754_hypotf_~#sf_u~5#1.offset, __ieee754_hypotf_#t~mem14#1, __ieee754_hypotf_~#sf_u~6#1.base, __ieee754_hypotf_~#sf_u~6#1.offset, __ieee754_hypotf_#t~mem15#1, __ieee754_hypotf_~#sf_u~7#1.base, __ieee754_hypotf_~#sf_u~7#1.offset, __ieee754_hypotf_#t~mem16#1, __ieee754_hypotf_~#sf_u~8#1.base, __ieee754_hypotf_~#sf_u~8#1.offset, __ieee754_hypotf_#t~ret17#1, __ieee754_hypotf_#t~mem18#1, __ieee754_hypotf_~#sf_u~9#1.base, __ieee754_hypotf_~#sf_u~9#1.offset, __ieee754_hypotf_#t~mem19#1, __ieee754_hypotf_~#sf_u~10#1.base, __ieee754_hypotf_~#sf_u~10#1.offset, __ieee754_hypotf_#t~ret20#1, __ieee754_hypotf_#t~mem21#1, __ieee754_hypotf_~#sf_u~11#1.base, __ieee754_hypotf_~#sf_u~11#1.offset, __ieee754_hypotf_~x#1, __ieee754_hypotf_~y#1, __ieee754_hypotf_~a~0#1, __ieee754_hypotf_~b~0#1, __ieee754_hypotf_~t1~0#1, __ieee754_hypotf_~t2~0#1, __ieee754_hypotf_~y1~0#1, __ieee754_hypotf_~y2~0#1, __ieee754_hypotf_~w~0#1, __ieee754_hypotf_~j~0#1, __ieee754_hypotf_~k~0#1, __ieee754_hypotf_~ha~0#1, __ieee754_hypotf_~hb~0#1;__ieee754_hypotf_~x#1 := __ieee754_hypotf_#in~x#1;__ieee754_hypotf_~y#1 := __ieee754_hypotf_#in~y#1;__ieee754_hypotf_~a~0#1 := __ieee754_hypotf_~x#1;__ieee754_hypotf_~b~0#1 := __ieee754_hypotf_~y#1;havoc __ieee754_hypotf_~t1~0#1;havoc __ieee754_hypotf_~t2~0#1;havoc __ieee754_hypotf_~y1~0#1;havoc __ieee754_hypotf_~y2~0#1;havoc __ieee754_hypotf_~w~0#1;havoc __ieee754_hypotf_~j~0#1;havoc __ieee754_hypotf_~k~0#1;havoc __ieee754_hypotf_~ha~0#1;havoc __ieee754_hypotf_~hb~0#1; {642#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:22,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {642#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call __ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_hypotf_~x#1, __ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset, 4bv32);call __ieee754_hypotf_#t~mem7#1 := read~intINTTYPE4(__ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset, 4bv32);__ieee754_hypotf_~ha~0#1 := __ieee754_hypotf_#t~mem7#1;havoc __ieee754_hypotf_#t~mem7#1;call ULTIMATE.dealloc(__ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset);havoc __ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset; {642#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:22,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {642#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {642#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:47:22,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {642#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} __ieee754_hypotf_~ha~0#1 := ~bvand32(2147483647bv32, __ieee754_hypotf_~ha~0#1); {652#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} is VALID [2022-02-20 16:47:22,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {652#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))} call __ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_hypotf_~y#1, __ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset, 4bv32);call __ieee754_hypotf_#t~mem8#1 := read~intINTTYPE4(__ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset, 4bv32);__ieee754_hypotf_~hb~0#1 := __ieee754_hypotf_#t~mem8#1;havoc __ieee754_hypotf_#t~mem8#1;call ULTIMATE.dealloc(__ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset);havoc __ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset; {656#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} is VALID [2022-02-20 16:47:22,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} goto; {656#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} is VALID [2022-02-20 16:47:22,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {656#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} __ieee754_hypotf_~hb~0#1 := ~bvand32(2147483647bv32, __ieee754_hypotf_~hb~0#1); {656#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} is VALID [2022-02-20 16:47:22,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {656#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} assume !~bvsgt32(__ieee754_hypotf_~hb~0#1, __ieee754_hypotf_~ha~0#1);__ieee754_hypotf_~a~0#1 := __ieee754_hypotf_~x#1;__ieee754_hypotf_~b~0#1 := __ieee754_hypotf_~y#1; {666#(and (not (bvsgt |ULTIMATE.start___ieee754_hypotf_~hb~0#1| |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} is VALID [2022-02-20 16:47:22,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {666#(and (not (bvsgt |ULTIMATE.start___ieee754_hypotf_~hb~0#1| |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} call __ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(__ieee754_hypotf_~ha~0#1, __ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset, 4bv32);call __ieee754_hypotf_#t~mem9#1 := read~intFLOATTYPE4(__ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset, 4bv32);__ieee754_hypotf_~a~0#1 := __ieee754_hypotf_#t~mem9#1;havoc __ieee754_hypotf_#t~mem9#1;call ULTIMATE.dealloc(__ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset);havoc __ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset; {666#(and (not (bvsgt |ULTIMATE.start___ieee754_hypotf_~hb~0#1| |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} is VALID [2022-02-20 16:47:22,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {666#(and (not (bvsgt |ULTIMATE.start___ieee754_hypotf_~hb~0#1| |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} goto; {666#(and (not (bvsgt |ULTIMATE.start___ieee754_hypotf_~hb~0#1| |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} is VALID [2022-02-20 16:47:22,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {666#(and (not (bvsgt |ULTIMATE.start___ieee754_hypotf_~hb~0#1| |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} call __ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(__ieee754_hypotf_~hb~0#1, __ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset, 4bv32);call __ieee754_hypotf_#t~mem10#1 := read~intFLOATTYPE4(__ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset, 4bv32);__ieee754_hypotf_~b~0#1 := __ieee754_hypotf_#t~mem10#1;havoc __ieee754_hypotf_#t~mem10#1;call ULTIMATE.dealloc(__ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset);havoc __ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset; {666#(and (not (bvsgt |ULTIMATE.start___ieee754_hypotf_~hb~0#1| |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} is VALID [2022-02-20 16:47:22,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#(and (not (bvsgt |ULTIMATE.start___ieee754_hypotf_~hb~0#1| |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} goto; {666#(and (not (bvsgt |ULTIMATE.start___ieee754_hypotf_~hb~0#1| |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} is VALID [2022-02-20 16:47:22,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {666#(and (not (bvsgt |ULTIMATE.start___ieee754_hypotf_~hb~0#1| |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|)))))} assume ~bvsgt32(~bvsub32(__ieee754_hypotf_~ha~0#1, __ieee754_hypotf_~hb~0#1), 251658240bv32);__ieee754_hypotf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_hypotf_~a~0#1, __ieee754_hypotf_~b~0#1); {635#false} is VALID [2022-02-20 16:47:22,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {635#false} main_#t~ret24#1 := __ieee754_hypotf_#res#1;assume { :end_inline___ieee754_hypotf } true;main_~res~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem22#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {635#false} is VALID [2022-02-20 16:47:22,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {635#false} call isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4bv32);call isinf_float_#t~mem22#1 := read~intINTTYPE4(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4bv32);isinf_float_~ix~1#1 := isinf_float_#t~mem22#1;havoc isinf_float_#t~mem22#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset);havoc isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset; {635#false} is VALID [2022-02-20 16:47:22,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {635#false} goto; {635#false} is VALID [2022-02-20 16:47:22,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {635#false} isinf_float_~ix~1#1 := ~bvand32(2147483647bv32, isinf_float_~ix~1#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~1#1 then 1bv32 else 0bv32); {635#false} is VALID [2022-02-20 16:47:22,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {635#false} main_#t~ret25#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {635#false} is VALID [2022-02-20 16:47:22,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {635#false} assume 0bv32 == main_#t~ret25#1;havoc main_#t~ret25#1; {635#false} is VALID [2022-02-20 16:47:22,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {635#false} assume !false; {635#false} is VALID [2022-02-20 16:47:22,175 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:47:22,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:22,175 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:22,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352359358] [2022-02-20 16:47:22,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352359358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:22,176 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:22,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:47:22,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259476871] [2022-02-20 16:47:22,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:22,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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) Word has length 21 [2022-02-20 16:47:22,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:22,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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:47:22,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:47:22,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:47:22,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:22,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:47:22,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:47:22,223 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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:48:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:10,667 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2022-02-20 16:48:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:48:10,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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) Word has length 21 [2022-02-20 16:48:10,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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:48:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2022-02-20 16:48:10,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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:48:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2022-02-20 16:48:10,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 121 transitions. [2022-02-20 16:48:11,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:11,689 INFO L225 Difference]: With dead ends: 99 [2022-02-20 16:48:11,689 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 16:48:11,689 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:48:11,690 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 3 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:11,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 435 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 71 Unchecked, 0.0s Time] [2022-02-20 16:48:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 16:48:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-20 16:48:11,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:11,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:11,698 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:11,699 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:11,701 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-02-20 16:48:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-02-20 16:48:11,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:11,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:11,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 91 states. [2022-02-20 16:48:11,703 INFO L87 Difference]: Start difference. First operand has 91 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 91 states. [2022-02-20 16:48:11,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:11,705 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-02-20 16:48:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-02-20 16:48:11,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:11,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:11,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:11,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 87 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2022-02-20 16:48:11,709 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 21 [2022-02-20 16:48:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:11,710 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2022-02-20 16:48:11,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 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:48:11,710 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-02-20 16:48:11,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:48:11,711 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:11,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:11,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:48:11,920 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:48:11,921 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:11,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:11,921 INFO L85 PathProgramCache]: Analyzing trace with hash -341161687, now seen corresponding path program 1 times [2022-02-20 16:48:11,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:48:11,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76107014] [2022-02-20 16:48:11,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:11,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:48:11,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:48:11,923 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:48:11,925 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:48:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:12,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-20 16:48:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:12,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:12,333 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:48:12,794 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-02-20 16:48:12,795 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 45 treesize of output 32 [2022-02-20 16:48:13,141 INFO L356 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2022-02-20 16:48:13,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 59 [2022-02-20 16:48:14,332 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 46 treesize of output 30 [2022-02-20 16:48:16,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {1115#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);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {1120#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:48:16,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {1120#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet23#1, main_#t~ret24#1, main_#t~ret25#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_hypotf } true;__ieee754_hypotf_#in~x#1, __ieee754_hypotf_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc __ieee754_hypotf_#res#1;havoc __ieee754_hypotf_#t~mem7#1, __ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset, __ieee754_hypotf_#t~mem8#1, __ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset, __ieee754_hypotf_#t~mem9#1, __ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset, __ieee754_hypotf_#t~mem10#1, __ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset, __ieee754_hypotf_#t~mem11#1, __ieee754_hypotf_~#sf_u~3#1.base, __ieee754_hypotf_~#sf_u~3#1.offset, __ieee754_hypotf_#t~mem12#1, __ieee754_hypotf_~#sf_u~4#1.base, __ieee754_hypotf_~#sf_u~4#1.offset, __ieee754_hypotf_#t~mem13#1, __ieee754_hypotf_~#sf_u~5#1.base, __ieee754_hypotf_~#sf_u~5#1.offset, __ieee754_hypotf_#t~mem14#1, __ieee754_hypotf_~#sf_u~6#1.base, __ieee754_hypotf_~#sf_u~6#1.offset, __ieee754_hypotf_#t~mem15#1, __ieee754_hypotf_~#sf_u~7#1.base, __ieee754_hypotf_~#sf_u~7#1.offset, __ieee754_hypotf_#t~mem16#1, __ieee754_hypotf_~#sf_u~8#1.base, __ieee754_hypotf_~#sf_u~8#1.offset, __ieee754_hypotf_#t~ret17#1, __ieee754_hypotf_#t~mem18#1, __ieee754_hypotf_~#sf_u~9#1.base, __ieee754_hypotf_~#sf_u~9#1.offset, __ieee754_hypotf_#t~mem19#1, __ieee754_hypotf_~#sf_u~10#1.base, __ieee754_hypotf_~#sf_u~10#1.offset, __ieee754_hypotf_#t~ret20#1, __ieee754_hypotf_#t~mem21#1, __ieee754_hypotf_~#sf_u~11#1.base, __ieee754_hypotf_~#sf_u~11#1.offset, __ieee754_hypotf_~x#1, __ieee754_hypotf_~y#1, __ieee754_hypotf_~a~0#1, __ieee754_hypotf_~b~0#1, __ieee754_hypotf_~t1~0#1, __ieee754_hypotf_~t2~0#1, __ieee754_hypotf_~y1~0#1, __ieee754_hypotf_~y2~0#1, __ieee754_hypotf_~w~0#1, __ieee754_hypotf_~j~0#1, __ieee754_hypotf_~k~0#1, __ieee754_hypotf_~ha~0#1, __ieee754_hypotf_~hb~0#1;__ieee754_hypotf_~x#1 := __ieee754_hypotf_#in~x#1;__ieee754_hypotf_~y#1 := __ieee754_hypotf_#in~y#1;__ieee754_hypotf_~a~0#1 := __ieee754_hypotf_~x#1;__ieee754_hypotf_~b~0#1 := __ieee754_hypotf_~y#1;havoc __ieee754_hypotf_~t1~0#1;havoc __ieee754_hypotf_~t2~0#1;havoc __ieee754_hypotf_~y1~0#1;havoc __ieee754_hypotf_~y2~0#1;havoc __ieee754_hypotf_~w~0#1;havoc __ieee754_hypotf_~j~0#1;havoc __ieee754_hypotf_~k~0#1;havoc __ieee754_hypotf_~ha~0#1;havoc __ieee754_hypotf_~hb~0#1; {1124#(and (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:48:16,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {1124#(and (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call __ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_hypotf_~x#1, __ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset, 4bv32);call __ieee754_hypotf_#t~mem7#1 := read~intINTTYPE4(__ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset, 4bv32);__ieee754_hypotf_~ha~0#1 := __ieee754_hypotf_#t~mem7#1;havoc __ieee754_hypotf_#t~mem7#1;call ULTIMATE.dealloc(__ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset);havoc __ieee754_hypotf_~#gf_u~1#1.base, __ieee754_hypotf_~#gf_u~1#1.offset; {1124#(and (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:48:16,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {1124#(and (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {1124#(and (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:48:16,079 INFO L290 TraceCheckUtils]: 4: Hoare triple {1124#(and (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} __ieee754_hypotf_~ha~0#1 := ~bvand32(2147483647bv32, __ieee754_hypotf_~ha~0#1); {1134#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:48:16,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {1134#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_hypotf_~y#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call __ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_hypotf_~y#1, __ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset, 4bv32);call __ieee754_hypotf_#t~mem8#1 := read~intINTTYPE4(__ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset, 4bv32);__ieee754_hypotf_~hb~0#1 := __ieee754_hypotf_#t~mem8#1;havoc __ieee754_hypotf_#t~mem8#1;call ULTIMATE.dealloc(__ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset);havoc __ieee754_hypotf_~#gf_u~2#1.base, __ieee754_hypotf_~#gf_u~2#1.offset; {1138#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:48:16,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {1138#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (= currentRoundingMode roundNearestTiesToEven))} goto; {1138#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:48:16,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_hypotf_~hb~0#1 := ~bvand32(2147483647bv32, __ieee754_hypotf_~hb~0#1); {1138#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:48:16,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsgt32(__ieee754_hypotf_~hb~0#1, __ieee754_hypotf_~ha~0#1);__ieee754_hypotf_~a~0#1 := __ieee754_hypotf_~y#1;__ieee754_hypotf_~b~0#1 := __ieee754_hypotf_~x#1;__ieee754_hypotf_~j~0#1 := __ieee754_hypotf_~ha~0#1;__ieee754_hypotf_~ha~0#1 := __ieee754_hypotf_~hb~0#1;__ieee754_hypotf_~hb~0#1 := __ieee754_hypotf_~j~0#1; {1148#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))))} is VALID [2022-02-20 16:48:16,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {1148#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))))} call __ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(__ieee754_hypotf_~ha~0#1, __ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset, 4bv32);call __ieee754_hypotf_#t~mem9#1 := read~intFLOATTYPE4(__ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset, 4bv32);__ieee754_hypotf_~a~0#1 := __ieee754_hypotf_#t~mem9#1;havoc __ieee754_hypotf_#t~mem9#1;call ULTIMATE.dealloc(__ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset);havoc __ieee754_hypotf_~#sf_u~1#1.base, __ieee754_hypotf_~#sf_u~1#1.offset; {1152#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32)))) |ULTIMATE.start___ieee754_hypotf_~a~0#1|) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))))} is VALID [2022-02-20 16:48:16,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {1152#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32)))) |ULTIMATE.start___ieee754_hypotf_~a~0#1|) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))))} goto; {1152#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32)))) |ULTIMATE.start___ieee754_hypotf_~a~0#1|) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))))} is VALID [2022-02-20 16:48:16,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {1152#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32)))) |ULTIMATE.start___ieee754_hypotf_~a~0#1|) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_7|) (_ bv0 32))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#gf_u~2#1.base_8|) (_ bv0 32)))) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))))} call __ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(__ieee754_hypotf_~hb~0#1, __ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset, 4bv32);call __ieee754_hypotf_#t~mem10#1 := read~intFLOATTYPE4(__ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset, 4bv32);__ieee754_hypotf_~b~0#1 := __ieee754_hypotf_#t~mem10#1;havoc __ieee754_hypotf_#t~mem10#1;call ULTIMATE.dealloc(__ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset);havoc __ieee754_hypotf_~#sf_u~2#1.base, __ieee754_hypotf_~#sf_u~2#1.offset; {1159#(and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)))) |ULTIMATE.start___ieee754_hypotf_~b~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|))) (= |ULTIMATE.start___ieee754_hypotf_~a~0#1| (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))))} is VALID [2022-02-20 16:48:16,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {1159#(and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)))) |ULTIMATE.start___ieee754_hypotf_~b~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|))) (= |ULTIMATE.start___ieee754_hypotf_~a~0#1| (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))))} goto; {1159#(and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)))) |ULTIMATE.start___ieee754_hypotf_~b~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|))) (= |ULTIMATE.start___ieee754_hypotf_~a~0#1| (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))))} is VALID [2022-02-20 16:48:16,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {1159#(and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)))) |ULTIMATE.start___ieee754_hypotf_~b~0#1|) (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)) |ULTIMATE.start___ieee754_hypotf_~hb~0#1|))) (= |ULTIMATE.start___ieee754_hypotf_~a~0#1| (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))))} assume ~bvsgt32(~bvsub32(__ieee754_hypotf_~ha~0#1, __ieee754_hypotf_~hb~0#1), 251658240bv32);__ieee754_hypotf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_hypotf_~a~0#1, __ieee754_hypotf_~b~0#1); {1166#(exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7| (_ BitVec 32)) (|ULTIMATE.start___ieee754_hypotf_~ha~0#1| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= |ULTIMATE.start___ieee754_hypotf_#res#1| (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)))))) (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) (bvsgt (bvadd |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvneg (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (_ bv251658240 32))))} is VALID [2022-02-20 16:48:16,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {1166#(exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7| (_ BitVec 32)) (|ULTIMATE.start___ieee754_hypotf_~ha~0#1| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= |ULTIMATE.start___ieee754_hypotf_#res#1| (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)))))) (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) (bvsgt (bvadd |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvneg (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (_ bv251658240 32))))} main_#t~ret24#1 := __ieee754_hypotf_#res#1;assume { :end_inline___ieee754_hypotf } true;main_~res~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem22#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {1170#(exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7| (_ BitVec 32)) (|ULTIMATE.start___ieee754_hypotf_~ha~0#1| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))))) |ULTIMATE.start_isinf_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) (bvsgt (bvadd |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvneg (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (_ bv251658240 32))))} is VALID [2022-02-20 16:48:16,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {1170#(exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7| (_ BitVec 32)) (|ULTIMATE.start___ieee754_hypotf_~ha~0#1| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32))))) |ULTIMATE.start_isinf_float_~x#1|) (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_7|) (_ bv0 32)) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) (bvsgt (bvadd |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvneg (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (_ bv251658240 32))))} call isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4bv32);call isinf_float_#t~mem22#1 := read~intINTTYPE4(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4bv32);isinf_float_~ix~1#1 := isinf_float_#t~mem22#1;havoc isinf_float_#t~mem22#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset);havoc isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset; {1174#(exists ((|ULTIMATE.start___ieee754_hypotf_~ha~0#1| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|))) (bvsgt (bvadd |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvneg (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (_ bv251658240 32))))} is VALID [2022-02-20 16:48:16,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {1174#(exists ((|ULTIMATE.start___ieee754_hypotf_~ha~0#1| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|))) (bvsgt (bvadd |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvneg (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (_ bv251658240 32))))} goto; {1174#(exists ((|ULTIMATE.start___ieee754_hypotf_~ha~0#1| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|))) (bvsgt (bvadd |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvneg (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (_ bv251658240 32))))} is VALID [2022-02-20 16:48:16,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {1174#(exists ((|ULTIMATE.start___ieee754_hypotf_~ha~0#1| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|))) (bvsgt (bvadd |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvneg (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (_ bv251658240 32))))} isinf_float_~ix~1#1 := ~bvand32(2147483647bv32, isinf_float_~ix~1#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~1#1 then 1bv32 else 0bv32); {1181#(exists ((|ULTIMATE.start___ieee754_hypotf_~ha~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_isinf_float_~ix~1#1_6| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))))) (fp ((_ extract 31 31) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|) ((_ extract 30 23) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|) ((_ extract 22 0) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|))) (= (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32)) (bvsgt (bvadd |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvneg (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (_ bv251658240 32))))} is VALID [2022-02-20 16:48:16,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {1181#(exists ((|ULTIMATE.start___ieee754_hypotf_~ha~0#1| (_ BitVec 32)) (|v_ULTIMATE.start_isinf_float_~ix~1#1_6| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ BitVec 32))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|)) (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32))))) (fp ((_ extract 31 31) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|) ((_ extract 30 23) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|) ((_ extract 22 0) |v_ULTIMATE.start_isinf_float_~ix~1#1_6|))) (= (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_hypotf_~ha~0#1|))) (= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32)) (bvsgt (bvadd |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvneg (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_26| (_ bv2147483647 32)))) (_ bv251658240 32))))} main_#t~ret25#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {1185#(= |ULTIMATE.start_main_#t~ret25#1| (_ bv1 32))} is VALID [2022-02-20 16:48:16,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {1185#(= |ULTIMATE.start_main_#t~ret25#1| (_ bv1 32))} assume 0bv32 == main_#t~ret25#1;havoc main_#t~ret25#1; {1116#false} is VALID [2022-02-20 16:48:16,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {1116#false} assume !false; {1116#false} is VALID [2022-02-20 16:48:16,435 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:48:16,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:48:16,435 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:48:16,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76107014] [2022-02-20 16:48:16,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76107014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:16,435 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:16,435 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 16:48:16,436 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982750374] [2022-02-20 16:48:16,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:16,436 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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) Word has length 21 [2022-02-20 16:48:16,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:16,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 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)