./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1270b.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_1270b.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 35bac483b91a5ef1ca7e770e0d3fb7ad4f1fb6725ed9e57de7011eda6b44423e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:57,416 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:57,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:57,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:57,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:57,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:57,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:57,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:57,472 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:57,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:57,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:57,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:57,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:57,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:57,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:57,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:57,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:57,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:57,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:57,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:57,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:57,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:57,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:57,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:57,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:57,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:57,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:57,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:57,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:57,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:57,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:57,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:57,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:57,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:57,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:57,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:57,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:57,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:57,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:57,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:57,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:57,517 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:46:57,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:57,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:57,548 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:57,548 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:57,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:57,549 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:57,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:57,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:57,550 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:57,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:57,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:57,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:57,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:57,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:57,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:57,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:57,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:57,552 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:57,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:57,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:57,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:57,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:57,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:57,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:57,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:57,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:57,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:57,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:57,556 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:57,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:57,556 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:57,556 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:57,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:57,557 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 -> 35bac483b91a5ef1ca7e770e0d3fb7ad4f1fb6725ed9e57de7011eda6b44423e [2022-02-20 16:46:57,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:57,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:57,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:57,820 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:57,821 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:57,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2022-02-20 16:46:57,880 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e50780f80/f171c86c7c8144ee9fbacc758929e5dd/FLAGc8860b80b [2022-02-20 16:46:58,242 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:58,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2022-02-20 16:46:58,248 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e50780f80/f171c86c7c8144ee9fbacc758929e5dd/FLAGc8860b80b [2022-02-20 16:46:58,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e50780f80/f171c86c7c8144ee9fbacc758929e5dd [2022-02-20 16:46:58,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:58,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:58,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:58,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:58,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:58,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:58" (1/1) ... [2022-02-20 16:46:58,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f369668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58, skipping insertion in model container [2022-02-20 16:46:58,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:58" (1/1) ... [2022-02-20 16:46:58,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:58,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:58,532 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_1270b.c[4704,4717] [2022-02-20 16:46:58,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:58,543 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:58,596 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_1270b.c[4704,4717] [2022-02-20 16:46:58,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:58,613 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:58,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58 WrapperNode [2022-02-20 16:46:58,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:58,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:58,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:58,615 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:58,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58" (1/1) ... [2022-02-20 16:46:58,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58" (1/1) ... [2022-02-20 16:46:58,665 INFO L137 Inliner]: procedures = 18, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 254 [2022-02-20 16:46:58,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:58,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:58,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:58,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:58,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58" (1/1) ... [2022-02-20 16:46:58,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58" (1/1) ... [2022-02-20 16:46:58,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58" (1/1) ... [2022-02-20 16:46:58,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58" (1/1) ... [2022-02-20 16:46:58,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58" (1/1) ... [2022-02-20 16:46:58,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58" (1/1) ... [2022-02-20 16:46:58,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58" (1/1) ... [2022-02-20 16:46:58,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:58,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:58,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:58,710 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:58,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58" (1/1) ... [2022-02-20 16:46:58,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:58,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:58,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:46:58,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:46:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:58,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2022-02-20 16:46:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2022-02-20 16:46:58,857 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:58,858 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:59,391 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:59,399 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:59,399 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2022-02-20 16:46:59,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:59 BoogieIcfgContainer [2022-02-20 16:46:59,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:59,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:59,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:59,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:59,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:58" (1/3) ... [2022-02-20 16:46:59,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa6a095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:59, skipping insertion in model container [2022-02-20 16:46:59,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:58" (2/3) ... [2022-02-20 16:46:59,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa6a095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:59, skipping insertion in model container [2022-02-20 16:46:59,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:59" (3/3) ... [2022-02-20 16:46:59,410 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b.c [2022-02-20 16:46:59,415 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:59,416 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:59,461 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:59,466 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:46:59,467 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:59,485 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:46:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:46:59,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:59,490 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:46:59,490 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:59,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1724151004, now seen corresponding path program 1 times [2022-02-20 16:46:59,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:59,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008005411] [2022-02-20 16:46:59,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:59,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:59,648 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:46:59,648 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 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);main_~y~0#1 := main_#t~nondet25#1;havoc main_#t~nondet25#1;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:46:59,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume !true; {100#false} is VALID [2022-02-20 16:46:59,650 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:46:59,651 INFO L290 TraceCheckUtils]: 4: Hoare triple {100#false} assume !true; {100#false} is VALID [2022-02-20 16:46:59,651 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:46:59,652 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:46:59,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {100#false} assume !true; {100#false} is VALID [2022-02-20 16:46:59,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {100#false} assume !true; {100#false} is VALID [2022-02-20 16:46:59,652 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:46:59,653 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:46:59,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {100#false} assume !true; {100#false} is VALID [2022-02-20 16:46:59,654 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:46:59,655 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:46:59,655 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:46:59,655 INFO L290 TraceCheckUtils]: 15: Hoare triple {100#false} assume !false; {100#false} is VALID [2022-02-20 16:46:59,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:59,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:59,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008005411] [2022-02-20 16:46:59,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008005411] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:59,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:59,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:59,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600113803] [2022-02-20 16:46:59,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:59,666 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:46:59,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:59,670 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:46:59,696 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:46:59,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:59,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:59,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:59,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:59,724 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:46:59,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:59,887 INFO L93 Difference]: Finished difference Result 190 states and 322 transitions. [2022-02-20 16:46:59,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:59,887 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:46:59,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:59,889 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:46:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 322 transitions. [2022-02-20 16:46:59,900 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:46:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 322 transitions. [2022-02-20 16:46:59,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 322 transitions. [2022-02-20 16:47:00,174 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:00,190 INFO L225 Difference]: With dead ends: 190 [2022-02-20 16:47:00,190 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 16:47:00,194 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:00,197 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:00,199 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:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 16:47:00,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-02-20 16:47:00,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:00,238 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:00,239 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:00,239 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:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:00,245 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2022-02-20 16:47:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-02-20 16:47:00,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:00,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:00,247 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:00,248 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:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:00,252 INFO L93 Difference]: Finished difference Result 93 states and 118 transitions. [2022-02-20 16:47:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-02-20 16:47:00,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:00,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:00,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:00,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:00,255 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:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2022-02-20 16:47:00,260 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 16 [2022-02-20 16:47:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:00,261 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2022-02-20 16:47:00,261 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:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2022-02-20 16:47:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:47:00,262 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:00,262 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:00,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:47:00,263 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:00,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash -927967701, now seen corresponding path program 1 times [2022-02-20 16:47:00,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:47:00,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372263658] [2022-02-20 16:47:00,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:00,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:47:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:47:00,373 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:47:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:47:00,484 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:47:00,485 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:47:00,486 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:47:00,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:47:00,492 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:47:00,494 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:47:00,540 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:47:00,540 WARN L170 areAnnotationChecker]: __ieee754_sqrtfENTRY has no Hoare annotation [2022-02-20 16:47:00,541 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:47:00,541 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:47:00,541 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:47:00,541 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:47:00,541 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:47:00,541 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:47:00,541 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:47:00,541 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:47:00,541 WARN L170 areAnnotationChecker]: L21-3 has no Hoare annotation [2022-02-20 16:47:00,542 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-02-20 16:47:00,542 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-02-20 16:47:00,542 WARN L170 areAnnotationChecker]: L87-3 has no Hoare annotation [2022-02-20 16:47:00,542 WARN L170 areAnnotationChecker]: L26-7 has no Hoare annotation [2022-02-20 16:47:00,542 WARN L170 areAnnotationChecker]: L26-7 has no Hoare annotation [2022-02-20 16:47:00,542 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:47:00,543 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-02-20 16:47:00,543 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-02-20 16:47:00,543 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-02-20 16:47:00,543 WARN L170 areAnnotationChecker]: __ieee754_sqrtfFINAL has no Hoare annotation [2022-02-20 16:47:00,543 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:47:00,543 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:47:00,543 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:47:00,543 WARN L170 areAnnotationChecker]: L26-3 has no Hoare annotation [2022-02-20 16:47:00,543 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-02-20 16:47:00,544 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2022-02-20 16:47:00,544 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-02-20 16:47:00,544 WARN L170 areAnnotationChecker]: __ieee754_sqrtfEXIT has no Hoare annotation [2022-02-20 16:47:00,544 WARN L170 areAnnotationChecker]: __ieee754_sqrtfEXIT has no Hoare annotation [2022-02-20 16:47:00,544 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:47:00,544 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:47:00,544 WARN L170 areAnnotationChecker]: L26-5 has no Hoare annotation [2022-02-20 16:47:00,544 WARN L170 areAnnotationChecker]: L26-5 has no Hoare annotation [2022-02-20 16:47:00,544 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:47:00,545 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:47:00,545 WARN L170 areAnnotationChecker]: L184-1 has no Hoare annotation [2022-02-20 16:47:00,545 WARN L170 areAnnotationChecker]: L199-1 has no Hoare annotation [2022-02-20 16:47:00,545 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:47:00,545 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:47:00,545 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2022-02-20 16:47:00,545 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2022-02-20 16:47:00,545 WARN L170 areAnnotationChecker]: L177-2 has no Hoare annotation [2022-02-20 16:47:00,545 WARN L170 areAnnotationChecker]: L177-2 has no Hoare annotation [2022-02-20 16:47:00,546 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:47:00,546 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:47:00,546 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:47:00,546 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:47:00,546 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:47:00,547 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:47:00,548 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2022-02-20 16:47:00,548 WARN L170 areAnnotationChecker]: L114-1 has no Hoare annotation [2022-02-20 16:47:00,548 WARN L170 areAnnotationChecker]: L202-2 has no Hoare annotation [2022-02-20 16:47:00,548 WARN L170 areAnnotationChecker]: L202-2 has no Hoare annotation [2022-02-20 16:47:00,548 WARN L170 areAnnotationChecker]: L209 has no Hoare annotation [2022-02-20 16:47:00,548 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2022-02-20 16:47:00,548 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:47:00,548 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:47:00,548 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:47:00,549 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-02-20 16:47:00,549 WARN L170 areAnnotationChecker]: L114 has no Hoare annotation [2022-02-20 16:47:00,549 WARN L170 areAnnotationChecker]: L114-2 has no Hoare annotation [2022-02-20 16:47:00,549 WARN L170 areAnnotationChecker]: L114-2 has no Hoare annotation [2022-02-20 16:47:00,549 WARN L170 areAnnotationChecker]: L202-1 has no Hoare annotation [2022-02-20 16:47:00,549 WARN L170 areAnnotationChecker]: L202-1 has no Hoare annotation [2022-02-20 16:47:00,549 WARN L170 areAnnotationChecker]: L202-3 has no Hoare annotation [2022-02-20 16:47:00,549 WARN L170 areAnnotationChecker]: L215-2 has no Hoare annotation [2022-02-20 16:47:00,549 WARN L170 areAnnotationChecker]: L215-2 has no Hoare annotation [2022-02-20 16:47:00,549 WARN L170 areAnnotationChecker]: L43-8 has no Hoare annotation [2022-02-20 16:47:00,550 WARN L170 areAnnotationChecker]: L43-8 has no Hoare annotation [2022-02-20 16:47:00,550 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:47:00,550 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:47:00,550 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:47:00,550 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:47:00,550 WARN L170 areAnnotationChecker]: L215-1 has no Hoare annotation [2022-02-20 16:47:00,550 WARN L170 areAnnotationChecker]: L215-1 has no Hoare annotation [2022-02-20 16:47:00,550 WARN L170 areAnnotationChecker]: L215-3 has no Hoare annotation [2022-02-20 16:47:00,550 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2022-02-20 16:47:00,551 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2022-02-20 16:47:00,551 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2022-02-20 16:47:00,551 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:47:00,551 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:47:00,551 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2022-02-20 16:47:00,551 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2022-02-20 16:47:00,551 WARN L170 areAnnotationChecker]: L221 has no Hoare annotation [2022-02-20 16:47:00,551 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:47:00,551 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:47:00,551 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:47:00,552 WARN L170 areAnnotationChecker]: L43-6 has no Hoare annotation [2022-02-20 16:47:00,552 WARN L170 areAnnotationChecker]: L43-6 has no Hoare annotation [2022-02-20 16:47:00,552 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-02-20 16:47:00,552 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-02-20 16:47:00,552 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:47:00,553 WARN L170 areAnnotationChecker]: L136-2 has no Hoare annotation [2022-02-20 16:47:00,553 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2022-02-20 16:47:00,553 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2022-02-20 16:47:00,553 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:47:00,553 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2022-02-20 16:47:00,553 WARN L170 areAnnotationChecker]: L236 has no Hoare annotation [2022-02-20 16:47:00,553 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:47:00,553 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:47:00,553 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:47:00,553 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:47:00,554 WARN L170 areAnnotationChecker]: L126-2 has no Hoare annotation [2022-02-20 16:47:00,556 WARN L170 areAnnotationChecker]: L126-2 has no Hoare annotation [2022-02-20 16:47:00,556 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-20 16:47:00,556 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-20 16:47:00,556 WARN L170 areAnnotationChecker]: L141-1 has no Hoare annotation [2022-02-20 16:47:00,557 WARN L170 areAnnotationChecker]: L141-1 has no Hoare annotation [2022-02-20 16:47:00,557 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2022-02-20 16:47:00,557 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2022-02-20 16:47:00,557 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:47:00,557 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:47:00,561 WARN L170 areAnnotationChecker]: L237 has no Hoare annotation [2022-02-20 16:47:00,562 WARN L170 areAnnotationChecker]: L237 has no Hoare annotation [2022-02-20 16:47:00,562 WARN L170 areAnnotationChecker]: L240 has no Hoare annotation [2022-02-20 16:47:00,562 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:47:00,562 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 16:47:00,562 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:47:00,562 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:47:00,563 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2022-02-20 16:47:00,563 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-02-20 16:47:00,563 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-02-20 16:47:00,563 WARN L170 areAnnotationChecker]: L151-2 has no Hoare annotation [2022-02-20 16:47:00,563 WARN L170 areAnnotationChecker]: L151-2 has no Hoare annotation [2022-02-20 16:47:00,563 WARN L170 areAnnotationChecker]: L163-2 has no Hoare annotation [2022-02-20 16:47:00,563 WARN L170 areAnnotationChecker]: L163-2 has no Hoare annotation [2022-02-20 16:47:00,563 WARN L170 areAnnotationChecker]: L178-2 has no Hoare annotation [2022-02-20 16:47:00,563 WARN L170 areAnnotationChecker]: L178-2 has no Hoare annotation [2022-02-20 16:47:00,563 WARN L170 areAnnotationChecker]: L187-2 has no Hoare annotation [2022-02-20 16:47:00,563 WARN L170 areAnnotationChecker]: L187-2 has no Hoare annotation [2022-02-20 16:47:00,564 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:47:00,564 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:47:00,564 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:47:00,564 WARN L170 areAnnotationChecker]: L75-2 has no Hoare annotation [2022-02-20 16:47:00,564 WARN L170 areAnnotationChecker]: L75-2 has no Hoare annotation [2022-02-20 16:47:00,564 WARN L170 areAnnotationChecker]: L151-1 has no Hoare annotation [2022-02-20 16:47:00,564 WARN L170 areAnnotationChecker]: L151-1 has no Hoare annotation [2022-02-20 16:47:00,565 WARN L170 areAnnotationChecker]: L151-3 has no Hoare annotation [2022-02-20 16:47:00,565 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-02-20 16:47:00,565 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-02-20 16:47:00,565 WARN L170 areAnnotationChecker]: L168-1 has no Hoare annotation [2022-02-20 16:47:00,565 WARN L170 areAnnotationChecker]: L168-1 has no Hoare annotation [2022-02-20 16:47:00,565 WARN L170 areAnnotationChecker]: L178-1 has no Hoare annotation [2022-02-20 16:47:00,565 WARN L170 areAnnotationChecker]: L178-1 has no Hoare annotation [2022-02-20 16:47:00,565 WARN L170 areAnnotationChecker]: L178-3 has no Hoare annotation [2022-02-20 16:47:00,565 WARN L170 areAnnotationChecker]: L187-1 has no Hoare annotation [2022-02-20 16:47:00,565 WARN L170 areAnnotationChecker]: L187-1 has no Hoare annotation [2022-02-20 16:47:00,565 WARN L170 areAnnotationChecker]: L187-3 has no Hoare annotation [2022-02-20 16:47:00,566 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:47:00,566 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 16:47:00,566 WARN L170 areAnnotationChecker]: L75-3 has no Hoare annotation [2022-02-20 16:47:00,566 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2022-02-20 16:47:00,566 WARN L170 areAnnotationChecker]: L168 has no Hoare annotation [2022-02-20 16:47:00,566 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:47:00,566 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:47:00,566 WARN L170 areAnnotationChecker]: L193-2 has no Hoare annotation [2022-02-20 16:47:00,566 WARN L170 areAnnotationChecker]: L193-2 has no Hoare annotation [2022-02-20 16:47:00,566 WARN L170 areAnnotationChecker]: L193-1 has no Hoare annotation [2022-02-20 16:47:00,566 WARN L170 areAnnotationChecker]: L193-1 has no Hoare annotation [2022-02-20 16:47:00,567 WARN L170 areAnnotationChecker]: L193-3 has no Hoare annotation [2022-02-20 16:47:00,567 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-02-20 16:47:00,567 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-02-20 16:47:00,567 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:00,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:47:00 BoogieIcfgContainer [2022-02-20 16:47:00,569 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:47:00,570 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:47:00,570 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:47:00,570 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:47:00,570 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:59" (3/4) ... [2022-02-20 16:47:00,573 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:47:00,573 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:47:00,575 INFO L158 Benchmark]: Toolchain (without parser) took 2309.47ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 53.8MB in the beginning and 70.3MB in the end (delta: -16.5MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,575 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 73.4MB. Free memory was 52.1MB in the beginning and 52.0MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:47:00,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.27ms. Allocated memory is still 88.1MB. Free memory was 53.5MB in the beginning and 59.3MB in the end (delta: -5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.76ms. Allocated memory is still 88.1MB. Free memory was 59.3MB in the beginning and 56.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,580 INFO L158 Benchmark]: Boogie Preprocessor took 42.93ms. Allocated memory is still 88.1MB. Free memory was 56.4MB in the beginning and 53.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,581 INFO L158 Benchmark]: RCFGBuilder took 690.00ms. Allocated memory is still 88.1MB. Free memory was 53.4MB in the beginning and 49.0MB in the end (delta: 4.4MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,581 INFO L158 Benchmark]: TraceAbstraction took 1165.14ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 48.4MB in the beginning and 70.3MB in the end (delta: -21.9MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,581 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 115.3MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:47:00,587 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.17ms. Allocated memory is still 73.4MB. Free memory was 52.1MB in the beginning and 52.0MB in the end (delta: 28.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.27ms. Allocated memory is still 88.1MB. Free memory was 53.5MB in the beginning and 59.3MB in the end (delta: -5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.76ms. Allocated memory is still 88.1MB. Free memory was 59.3MB in the beginning and 56.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.93ms. Allocated memory is still 88.1MB. Free memory was 56.4MB in the beginning and 53.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 690.00ms. Allocated memory is still 88.1MB. Free memory was 53.4MB in the beginning and 49.0MB in the end (delta: 4.4MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1165.14ms. Allocated memory was 88.1MB in the beginning and 115.3MB in the end (delta: 27.3MB). Free memory was 48.4MB in the beginning and 70.3MB in the end (delta: -21.9MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 115.3MB. Free memory is still 70.3MB. 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 = -1.0f / 0.0f; [L232] float y = __VERIFIER_nondet_float(); [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: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, 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.1s 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:00,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_1270b.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 35bac483b91a5ef1ca7e770e0d3fb7ad4f1fb6725ed9e57de7011eda6b44423e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:47:02,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:47:02,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:47:02,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:47:02,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:47:02,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:47:02,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:47:02,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:47:02,626 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:47:02,632 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:47:02,633 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:47:02,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:47:02,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:47:02,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:47:02,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:47:02,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:47:02,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:47:02,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:47:02,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:47:02,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:47:02,653 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:47:02,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:47:02,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:47:02,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:47:02,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:47:02,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:47:02,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:47:02,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:47:02,664 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:47:02,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:47:02,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:47:02,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:47:02,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:47:02,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:47:02,668 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:47:02,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:47:02,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:47:02,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:47:02,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:47:02,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:47:02,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:47:02,672 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:02,705 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:47:02,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:47:02,706 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:47:02,706 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:47:02,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:47:02,707 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:47:02,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:47:02,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:47:02,709 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:47:02,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:47:02,710 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:47:02,710 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:47:02,710 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:47:02,710 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:47:02,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:47:02,711 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:47:02,711 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:47:02,711 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:47:02,711 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:47:02,711 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:47:02,712 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:47:02,712 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:47:02,712 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:47:02,712 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:47:02,712 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:47:02,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:47:02,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:47:02,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:47:02,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:47:02,720 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:47:02,720 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:47:02,720 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:47:02,721 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:47:02,721 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:47:02,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:47:02,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:47:02,721 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 -> 35bac483b91a5ef1ca7e770e0d3fb7ad4f1fb6725ed9e57de7011eda6b44423e [2022-02-20 16:47:02,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:47:03,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:47:03,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:47:03,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:47:03,017 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:47:03,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2022-02-20 16:47:03,074 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/561b73846/fd9c13ef720246eca48bc5be35a199d6/FLAG5166670d6 [2022-02-20 16:47:03,474 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:47:03,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270b.c [2022-02-20 16:47:03,482 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/561b73846/fd9c13ef720246eca48bc5be35a199d6/FLAG5166670d6 [2022-02-20 16:47:03,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/561b73846/fd9c13ef720246eca48bc5be35a199d6 [2022-02-20 16:47:03,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:47:03,890 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:47:03,891 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:47:03,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:47:03,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:47:03,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:47:03" (1/1) ... [2022-02-20 16:47:03,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1071ecb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:03, skipping insertion in model container [2022-02-20 16:47:03,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:47:03" (1/1) ... [2022-02-20 16:47:03,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:47:03,928 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:47:04,117 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_1270b.c[4704,4717] [2022-02-20 16:47:04,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:47:04,171 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:47:04,245 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_1270b.c[4704,4717] [2022-02-20 16:47:04,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:47:04,266 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:47:04,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:04 WrapperNode [2022-02-20 16:47:04,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:47:04,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:47:04,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:47:04,268 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:47:04,273 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:04" (1/1) ... [2022-02-20 16:47:04,284 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:04" (1/1) ... [2022-02-20 16:47:04,321 INFO L137 Inliner]: procedures = 21, calls = 75, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 254 [2022-02-20 16:47:04,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:47:04,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:47:04,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:47:04,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:47:04,332 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:04" (1/1) ... [2022-02-20 16:47:04,333 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:04" (1/1) ... [2022-02-20 16:47:04,338 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:04" (1/1) ... [2022-02-20 16:47:04,338 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:04" (1/1) ... [2022-02-20 16:47:04,353 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:04" (1/1) ... [2022-02-20 16:47:04,364 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:04" (1/1) ... [2022-02-20 16:47:04,366 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:04" (1/1) ... [2022-02-20 16:47:04,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:47:04,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:47:04,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:47:04,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:47:04,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:04" (1/1) ... [2022-02-20 16:47:04,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:47:04,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:47:04,413 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:04,432 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:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:47:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:47:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:47:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:47:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:47:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:47:04,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:47:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:47:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:47:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:47:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2022-02-20 16:47:04,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2022-02-20 16:47:04,583 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:47:04,585 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:47:05,908 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:47:05,914 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:47:05,914 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2022-02-20 16:47:05,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:47:05 BoogieIcfgContainer [2022-02-20 16:47:05,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:47:05,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:47:05,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:47:05,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:47:05,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:47:03" (1/3) ... [2022-02-20 16:47:05,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7759e9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:47:05, skipping insertion in model container [2022-02-20 16:47:05,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:47:04" (2/3) ... [2022-02-20 16:47:05,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7759e9c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:47:05, skipping insertion in model container [2022-02-20 16:47:05,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:47:05" (3/3) ... [2022-02-20 16:47:05,926 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b.c [2022-02-20 16:47:05,931 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:47:05,931 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:47:05,983 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:47:05,991 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:05,992 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:47:06,012 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:06,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:47:06,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:06,017 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:06,018 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:06,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:06,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1724151004, now seen corresponding path program 1 times [2022-02-20 16:47:06,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:06,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937805019] [2022-02-20 16:47:06,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:06,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:06,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:06,047 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:06,079 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:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:06,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:47:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:06,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:06,313 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:06,314 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 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;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:06,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {92#true} assume !true; {93#false} is VALID [2022-02-20 16:47:06,315 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:06,316 INFO L290 TraceCheckUtils]: 4: Hoare triple {93#false} assume !true; {93#false} is VALID [2022-02-20 16:47:06,316 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:06,316 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:06,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {93#false} assume !true; {93#false} is VALID [2022-02-20 16:47:06,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {93#false} assume !true; {93#false} is VALID [2022-02-20 16:47:06,317 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:06,318 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:06,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {93#false} assume !true; {93#false} is VALID [2022-02-20 16:47:06,318 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:06,319 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:06,319 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:06,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {93#false} assume !false; {93#false} is VALID [2022-02-20 16:47:06,320 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:06,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:06,321 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:06,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937805019] [2022-02-20 16:47:06,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937805019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:06,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:06,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:47:06,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848870196] [2022-02-20 16:47:06,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:06,330 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:06,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:06,334 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:06,367 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:06,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:47:06,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:06,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:47:06,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:47:06,395 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:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:15,657 INFO L93 Difference]: Finished difference Result 176 states and 292 transitions. [2022-02-20 16:47:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:47:15,658 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:15,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:47:15,659 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:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2022-02-20 16:47:15,671 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:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 292 transitions. [2022-02-20 16:47:15,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 292 transitions. [2022-02-20 16:47:17,768 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:17,778 INFO L225 Difference]: With dead ends: 176 [2022-02-20 16:47:17,778 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 16:47:17,780 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:17,783 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:17,784 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:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 16:47:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-02-20 16:47:17,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:47:17,810 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:17,811 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:17,812 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:17,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:17,817 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-02-20 16:47:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-02-20 16:47:17,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:17,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:17,819 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:17,820 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:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:47:17,824 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-02-20 16:47:17,824 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-02-20 16:47:17,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:47:17,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:47:17,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:47:17,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:47:17,826 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:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-02-20 16:47:17,831 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 16 [2022-02-20 16:47:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:47:17,832 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-02-20 16:47:17,832 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:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-02-20 16:47:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:47:17,833 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:47:17,833 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:17,845 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:18,040 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:18,040 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:47:18,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:47:18,041 INFO L85 PathProgramCache]: Analyzing trace with hash -927967701, now seen corresponding path program 1 times [2022-02-20 16:47:18,042 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:47:18,042 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421279011] [2022-02-20 16:47:18,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:47:18,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:47:18,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:47:18,044 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:18,046 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:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:18,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 16:47:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:47:18,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:47:18,831 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:47:19,147 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-02-20 16:47:19,147 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 40 treesize of output 31 [2022-02-20 16:47:20,927 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 64 treesize of output 44 [2022-02-20 16:47:22,702 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)); {639#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:47:22,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {639#(= 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 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());main_~y~0#1 := main_#t~nondet23#1;havoc main_#t~nondet23#1;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; {643#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_hypotf_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:47:22,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {643#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_hypotf_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} 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; {647#(and (= (fp.div currentRoundingMode (fp.neg ((_ 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|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:47:22,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {647#(and (= (fp.div currentRoundingMode (fp.neg ((_ 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|))) (= currentRoundingMode roundNearestTiesToEven))} goto; {647#(and (= (fp.div currentRoundingMode (fp.neg ((_ 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|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:47:22,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {647#(and (= (fp.div currentRoundingMode (fp.neg ((_ 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|))) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_hypotf_~ha~0#1 := ~bvand32(2147483647bv32, __ieee754_hypotf_~ha~0#1); {654#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:47:22,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {654#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (= currentRoundingMode roundNearestTiesToEven))} 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; {654#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:47:22,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {654#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (= currentRoundingMode roundNearestTiesToEven))} goto; {654#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:47:22,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {654#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_hypotf_~hb~0#1 := ~bvand32(2147483647bv32, __ieee754_hypotf_~hb~0#1); {664#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:47:22,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|))) (= currentRoundingMode roundNearestTiesToEven))} 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; {664#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:47:22,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|))) (= currentRoundingMode roundNearestTiesToEven))} 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; {671#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~a~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:47:22,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {671#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~a~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))))) (= currentRoundingMode roundNearestTiesToEven))} goto; {671#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~a~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:47:22,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {671#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~a~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))))) (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1#1.base_6|) (_ bv0 32))))) (= currentRoundingMode roundNearestTiesToEven))} 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; {678#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|))) (= |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|))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start___ieee754_hypotf_~b~0#1|) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:47:22,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {678#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|))) (= |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|))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start___ieee754_hypotf_~b~0#1|) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))))) (= currentRoundingMode roundNearestTiesToEven))} goto; {678#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|))) (= |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|))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start___ieee754_hypotf_~b~0#1|) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:47:22,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {678#(and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_~ha~0#1| (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|))) (= |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|))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32)))) |ULTIMATE.start___ieee754_hypotf_~b~0#1|) (= |ULTIMATE.start___ieee754_hypotf_~hb~0#1| (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))))) (= currentRoundingMode roundNearestTiesToEven))} 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); {685#(exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (bvsgt (bvadd (bvneg (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (_ bv251658240 32)) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) (= |ULTIMATE.start___ieee754_hypotf_#res#1| (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))))))))} is VALID [2022-02-20 16:47:22,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {685#(exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (bvsgt (bvadd (bvneg (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (_ bv251658240 32)) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) (= |ULTIMATE.start___ieee754_hypotf_#res#1| (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 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; {689#(exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))))) |ULTIMATE.start_isinf_float_~x#1|) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (bvsgt (bvadd (bvneg (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (_ bv251658240 32)) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32)))))} is VALID [2022-02-20 16:47:22,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {689#(exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))))) |ULTIMATE.start_isinf_float_~x#1|) (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (bvsgt (bvadd (bvneg (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 32))) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (_ bv251658240 32)) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2#1.base_6|) (_ bv0 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; {693#(exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)) ((_ extract 30 23) (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)) ((_ extract 22 0) (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)))) (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 (bvneg (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (_ bv251658240 32))))} is VALID [2022-02-20 16:47:22,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {693#(exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)) ((_ extract 30 23) (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)) ((_ extract 22 0) (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)))) (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 (bvneg (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (_ bv251658240 32))))} goto; {693#(exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)) ((_ extract 30 23) (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)) ((_ extract 22 0) (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)))) (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 (bvneg (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) (_ bv251658240 32))))} is VALID [2022-02-20 16:47:22,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {693#(exists ((|v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25|)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 30 23) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32))) ((_ extract 22 0) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ bv2147483647 32)))) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)) ((_ extract 30 23) (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)) ((_ extract 22 0) (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)))) (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 (bvneg (bvand (_ bv2147483647 32) |v_ULTIMATE.start___ieee754_hypotf_~hb~0#1_26|)) (bvand |v_ULTIMATE.start___ieee754_hypotf_~ha~0#1_25| (_ 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); {700#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} is VALID [2022-02-20 16:47:22,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {700#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} main_#t~ret25#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {704#(= |ULTIMATE.start_main_#t~ret25#1| (_ bv1 32))} is VALID [2022-02-20 16:47:22,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {704#(= |ULTIMATE.start_main_#t~ret25#1| (_ bv1 32))} assume 0bv32 == main_#t~ret25#1;havoc main_#t~ret25#1; {635#false} is VALID [2022-02-20 16:47:22,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {635#false} assume !false; {635#false} is VALID [2022-02-20 16:47:22,902 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,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:47:22,902 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:47:22,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421279011] [2022-02-20 16:47:22,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421279011] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:47:22,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:47:22,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 16:47:22,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995513156] [2022-02-20 16:47:22,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:47:22,904 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:47:22,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:47:22,904 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) [2022-02-20 16:47:23,215 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:23,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 16:47:23,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:47:23,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 16:47:23,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-02-20 16:47:23,217 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand 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) [2022-02-20 16:47:28,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []