./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-benchs/inv_sqrt_Quake.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ef5ae5daf685fd27f3736d07af04899028dd989 ...................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-benchs/inv_sqrt_Quake.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ef5ae5daf685fd27f3736d07af04899028dd989 .................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:25:56,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:25:56,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:25:56,643 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:25:56,643 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:25:56,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:25:56,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:25:56,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:25:56,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:25:56,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:25:56,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:25:56,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:25:56,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:25:56,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:25:56,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:25:56,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:25:56,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:25:56,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:25:56,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:25:56,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:25:56,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:25:56,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:25:56,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:25:56,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:25:56,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:25:56,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:25:56,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:25:56,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:25:56,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:25:56,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:25:56,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:25:56,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:25:56,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:25:56,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:25:56,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:25:56,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:25:56,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:25:56,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:25:56,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:25:56,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:25:56,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:25:56,694 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:25:56,709 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:25:56,710 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:25:56,711 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:25:56,712 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:25:56,712 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:25:56,712 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:25:56,713 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:25:56,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:25:56,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:25:56,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:25:56,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:25:56,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:25:56,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:25:56,715 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:25:56,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:25:56,715 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:25:56,716 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:25:56,716 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:25:56,716 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:25:56,717 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:25:56,717 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:25:56,717 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:25:56,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:25:56,718 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:25:56,718 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:25:56,718 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:25:56,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:25:56,719 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:25:56,719 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:25:56,719 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 0ef5ae5daf685fd27f3736d07af04899028dd989 [2020-07-28 17:25:57,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:25:57,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:25:57,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:25:57,048 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:25:57,052 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:25:57,053 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c [2020-07-28 17:25:57,127 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f101ec7/e936de20b5784f8c9e1dc0bd2c0f1f06/FLAGa9320adf1 [2020-07-28 17:25:57,547 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:25:57,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c [2020-07-28 17:25:57,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f101ec7/e936de20b5784f8c9e1dc0bd2c0f1f06/FLAGa9320adf1 [2020-07-28 17:25:57,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f101ec7/e936de20b5784f8c9e1dc0bd2c0f1f06 [2020-07-28 17:25:57,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:25:57,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:25:57,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:25:57,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:25:57,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:25:57,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:25:57" (1/1) ... [2020-07-28 17:25:57,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c31f27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:57, skipping insertion in model container [2020-07-28 17:25:57,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:25:57" (1/1) ... [2020-07-28 17:25:58,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:25:58,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:25:58,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:25:58,199 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:25:58,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:25:58,246 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:25:58,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:58 WrapperNode [2020-07-28 17:25:58,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:25:58,247 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:25:58,247 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:25:58,247 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:25:58,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:58" (1/1) ... [2020-07-28 17:25:58,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:58" (1/1) ... [2020-07-28 17:25:58,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:25:58,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:25:58,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:25:58,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:25:58,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:58" (1/1) ... [2020-07-28 17:25:58,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:58" (1/1) ... [2020-07-28 17:25:58,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:58" (1/1) ... [2020-07-28 17:25:58,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:58" (1/1) ... [2020-07-28 17:25:58,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:58" (1/1) ... [2020-07-28 17:25:58,431 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:58" (1/1) ... [2020-07-28 17:25:58,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:58" (1/1) ... [2020-07-28 17:25:58,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:25:58,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:25:58,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:25:58,442 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:25:58,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:25:58,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:25:58,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 17:25:58,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:25:58,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:25:58,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:25:58,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:25:58,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:25:58,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:25:58,851 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:25:58,851 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-28 17:25:58,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:25:58 BoogieIcfgContainer [2020-07-28 17:25:58,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:25:58,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:25:58,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:25:58,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:25:58,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:25:57" (1/3) ... [2020-07-28 17:25:58,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b08175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:25:58, skipping insertion in model container [2020-07-28 17:25:58,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:25:58" (2/3) ... [2020-07-28 17:25:58,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b08175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:25:58, skipping insertion in model container [2020-07-28 17:25:58,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:25:58" (3/3) ... [2020-07-28 17:25:58,881 INFO L109 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake.c [2020-07-28 17:25:58,903 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:25:58,912 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:25:58,924 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:25:58,948 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:25:58,948 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:25:58,948 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:25:58,949 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:25:58,949 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:25:58,949 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:25:58,949 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:25:58,950 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:25:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-07-28 17:25:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 17:25:58,971 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:25:58,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:25:58,973 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:25:58,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:25:58,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1804965382, now seen corresponding path program 1 times [2020-07-28 17:25:58,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:25:58,991 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330449412] [2020-07-28 17:25:58,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:25:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:25:59,147 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {15#true} is VALID [2020-07-28 17:25:59,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#true} havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~r~0;havoc main_~a~0;havoc main_~r~0;main_~a~0 := main_#t~nondet3;havoc main_#t~nondet3;assume_abort_if_not_#in~cond := (if ~someBinaryFLOATComparisonOperation(main_~a~0, 0.1) && ~someBinaryFLOATComparisonOperation(main_~a~0, 100.0) then 1 else 0);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {15#true} is VALID [2020-07-28 17:25:59,150 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#true} assume 0 == assume_abort_if_not_~cond;assume false; {16#false} is VALID [2020-07-28 17:25:59,150 INFO L280 TraceCheckUtils]: 3: Hoare triple {16#false} InvSqrt_#in~x := main_~a~0;havoc InvSqrt_#res;havoc InvSqrt_#t~mem0, InvSqrt_#t~mem1, InvSqrt_#t~union2, InvSqrt_~x, InvSqrt_~xhalf~0, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset;InvSqrt_~x := InvSqrt_#in~x;InvSqrt_~xhalf~0 := ~someBinaryArithmeticFLOAToperation(0.5, InvSqrt_~x);call InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset := #Ultimate.allocOnStack(4);call write~real(InvSqrt_~x, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4);call InvSqrt_#t~mem0 := read~int(InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4);call write~int(1597463007 - InvSqrt_#t~mem0 / 2, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4);havoc InvSqrt_#t~mem0;call InvSqrt_#t~mem1 := read~real(InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4);InvSqrt_~x := InvSqrt_#t~mem1;call write~int(InvSqrt_#t~union2, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4);havoc InvSqrt_#t~mem1;havoc InvSqrt_#t~union2;InvSqrt_~x := ~someBinaryArithmeticFLOAToperation(InvSqrt_~x, ~someBinaryArithmeticFLOAToperation(1.5, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(InvSqrt_~xhalf~0, InvSqrt_~x), InvSqrt_~x)));InvSqrt_#res := InvSqrt_~x;call ULTIMATE.dealloc(InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset);havoc InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset; {16#false} is VALID [2020-07-28 17:25:59,151 INFO L280 TraceCheckUtils]: 4: Hoare triple {16#false} main_#t~ret4 := InvSqrt_#res;main_~r~0 := main_#t~ret4;havoc main_#t~ret4;__VERIFIER_assert_#in~cond := (if ~someBinaryFLOATComparisonOperation(main_~r~0, 0.0) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 10.0) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#false} is VALID [2020-07-28 17:25:59,152 INFO L280 TraceCheckUtils]: 5: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond; {16#false} is VALID [2020-07-28 17:25:59,152 INFO L280 TraceCheckUtils]: 6: Hoare triple {16#false} assume !false; {16#false} is VALID [2020-07-28 17:25:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:25:59,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330449412] [2020-07-28 17:25:59,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:25:59,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:25:59,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040712209] [2020-07-28 17:25:59,164 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-28 17:25:59,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:25:59,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:25:59,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:25:59,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:25:59,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:25:59,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:25:59,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:25:59,230 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2020-07-28 17:25:59,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:25:59,270 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 17:25:59,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:25:59,271 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-28 17:25:59,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:25:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:25:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2020-07-28 17:25:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:25:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2020-07-28 17:25:59,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 22 transitions. [2020-07-28 17:25:59,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:25:59,345 INFO L225 Difference]: With dead ends: 21 [2020-07-28 17:25:59,345 INFO L226 Difference]: Without dead ends: 8 [2020-07-28 17:25:59,349 INFO L675 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 [2020-07-28 17:25:59,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-28 17:25:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-28 17:25:59,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:25:59,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2020-07-28 17:25:59,384 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 17:25:59,384 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 17:25:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:25:59,386 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2020-07-28 17:25:59,386 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-07-28 17:25:59,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:25:59,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:25:59,387 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 17:25:59,388 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 17:25:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:25:59,389 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2020-07-28 17:25:59,389 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-07-28 17:25:59,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:25:59,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:25:59,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:25:59,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:25:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:25:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2020-07-28 17:25:59,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2020-07-28 17:25:59,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:25:59,394 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2020-07-28 17:25:59,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:25:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-07-28 17:25:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 17:25:59,395 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:25:59,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:25:59,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:25:59,396 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:25:59,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:25:59,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1806812424, now seen corresponding path program 1 times [2020-07-28 17:25:59,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:25:59,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617483363] [2020-07-28 17:25:59,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:25:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:25:59,433 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:25:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:25:59,454 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:25:59,477 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 17:25:59,478 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:25:59,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:25:59,503 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:25:59,504 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:25:59,504 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-28 17:25:59,504 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-28 17:25:59,505 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 17:25:59,505 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 17:25:59,505 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 17:25:59,505 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 17:25:59,505 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-28 17:25:59,506 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-28 17:25:59,506 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-28 17:25:59,506 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:25:59,506 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:25:59,507 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. [2020-07-28 17:25:59,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:25:59 BoogieIcfgContainer [2020-07-28 17:25:59,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:25:59,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:25:59,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:25:59,511 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:25:59,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:25:58" (3/4) ... [2020-07-28 17:25:59,515 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-28 17:25:59,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:25:59,519 INFO L168 Benchmark]: Toolchain (without parser) took 1541.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -109.3 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:25:59,520 INFO L168 Benchmark]: CDTParser took 0.90 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:25:59,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.79 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:25:59,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 128.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:25:59,523 INFO L168 Benchmark]: Boogie Preprocessor took 64.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:25:59,524 INFO L168 Benchmark]: RCFGBuilder took 421.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:25:59,525 INFO L168 Benchmark]: TraceAbstraction took 646.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:25:59,525 INFO L168 Benchmark]: Witness Printer took 5.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:25:59,530 INFO L336 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.90 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 266.79 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 128.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 421.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 646.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 11]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryArithmeticFLOAToperation at line 20. Possible FailurePath: [L43] float a,r; [L45] a = __VERIFIER_nondet_float() [L9] COND FALSE !(!cond) [L20] float xhalf = 0.5f*x; [L21] union float_int i; [L22] i.f = x [L23] EXPR i.i [L23] i.i = 0x5f3759df - (i.i>>1) [L24] EXPR i.f [L24] x = i.f [L25] x = x*(1.5f-xhalf*x*x) [L26] return x; [L26] return x; [L48] r = InvSqrt(a) [L11] COND TRUE !(cond) [L11] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, 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=12occurred in iteration=0, 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 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 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:26:01,546 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:26:01,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:26:01,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:26:01,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:26:01,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:26:01,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:26:01,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:26:01,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:26:01,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:26:01,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:26:01,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:26:01,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:26:01,575 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:26:01,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:26:01,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:26:01,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:26:01,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:26:01,583 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:26:01,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:26:01,587 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:26:01,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:26:01,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:26:01,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:26:01,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:26:01,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:26:01,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:26:01,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:26:01,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:26:01,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:26:01,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:26:01,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:26:01,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:26:01,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:26:01,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:26:01,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:26:01,603 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:26:01,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:26:01,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:26:01,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:26:01,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:26:01,606 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 17:26:01,623 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:26:01,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:26:01,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:26:01,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:26:01,625 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:26:01,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:26:01,626 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:26:01,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:26:01,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:26:01,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:26:01,627 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:26:01,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:26:01,627 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:26:01,628 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:26:01,628 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:26:01,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:26:01,629 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:26:01,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:26:01,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:26:01,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:26:01,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:26:01,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:26:01,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:26:01,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:26:01,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:26:01,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:26:01,632 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:26:01,632 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:26:01,632 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:26:01,632 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:26:01,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:26:01,633 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(__VERIFIER_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 -> 0ef5ae5daf685fd27f3736d07af04899028dd989 [2020-07-28 17:26:01,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:26:01,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:26:01,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:26:01,983 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:26:01,983 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:26:01,984 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c [2020-07-28 17:26:02,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1767b4c55/e35c6ca80b1544d78741342d969dca7c/FLAG33f65f483 [2020-07-28 17:26:02,585 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:26:02,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_sqrt_Quake.c [2020-07-28 17:26:02,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1767b4c55/e35c6ca80b1544d78741342d969dca7c/FLAG33f65f483 [2020-07-28 17:26:02,989 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1767b4c55/e35c6ca80b1544d78741342d969dca7c [2020-07-28 17:26:02,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:26:02,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:26:02,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:26:02,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:26:03,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:26:03,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:26:02" (1/1) ... [2020-07-28 17:26:03,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bfa321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03, skipping insertion in model container [2020-07-28 17:26:03,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:26:02" (1/1) ... [2020-07-28 17:26:03,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:26:03,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:26:03,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:26:03,244 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:26:03,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:26:03,360 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:26:03,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03 WrapperNode [2020-07-28 17:26:03,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:26:03,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:26:03,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:26:03,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:26:03,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03" (1/1) ... [2020-07-28 17:26:03,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03" (1/1) ... [2020-07-28 17:26:03,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:26:03,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:26:03,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:26:03,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:26:03,426 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03" (1/1) ... [2020-07-28 17:26:03,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03" (1/1) ... [2020-07-28 17:26:03,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03" (1/1) ... [2020-07-28 17:26:03,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03" (1/1) ... [2020-07-28 17:26:03,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03" (1/1) ... [2020-07-28 17:26:03,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03" (1/1) ... [2020-07-28 17:26:03,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03" (1/1) ... [2020-07-28 17:26:03,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:26:03,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:26:03,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:26:03,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:26:03,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:26:03,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:26:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2020-07-28 17:26:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:26:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:26:03,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:26:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-07-28 17:26:03,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:26:03,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 17:26:05,065 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:26:05,066 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-28 17:26:05,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:26:05 BoogieIcfgContainer [2020-07-28 17:26:05,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:26:05,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:26:05,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:26:05,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:26:05,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:26:02" (1/3) ... [2020-07-28 17:26:05,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1fc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:26:05, skipping insertion in model container [2020-07-28 17:26:05,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:26:03" (2/3) ... [2020-07-28 17:26:05,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a1fc5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:26:05, skipping insertion in model container [2020-07-28 17:26:05,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:26:05" (3/3) ... [2020-07-28 17:26:05,078 INFO L109 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake.c [2020-07-28 17:26:05,087 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:26:05,093 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:26:05,103 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:26:05,124 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:26:05,124 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:26:05,125 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:26:05,125 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:26:05,127 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:26:05,127 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:26:05,127 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:26:05,127 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:26:05,141 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-07-28 17:26:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 17:26:05,147 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:26:05,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:26:05,148 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:26:05,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:26:05,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1804965382, now seen corresponding path program 1 times [2020-07-28 17:26:05,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:26:05,167 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500651059] [2020-07-28 17:26:05,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 17:26:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:26:05,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:26:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:26:05,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:26:05,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {15#true} is VALID [2020-07-28 17:26:05,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#true} havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~r~0;havoc main_~a~0;havoc main_~r~0;main_~a~0 := main_#t~nondet3;havoc main_#t~nondet3;assume_abort_if_not_#in~cond := (if ~fp.geq~FLOAT(main_~a~0, ~to_fp~FLOAT(currentRoundingMode, 0.1)) && ~fp.leq~FLOAT(main_~a~0, ~to_fp~FLOAT(currentRoundingMode, 100.0)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {15#true} is VALID [2020-07-28 17:26:05,483 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {16#false} is VALID [2020-07-28 17:26:05,484 INFO L280 TraceCheckUtils]: 3: Hoare triple {16#false} InvSqrt_#in~x := main_~a~0;havoc InvSqrt_#res;havoc InvSqrt_#t~mem0, InvSqrt_#t~mem1, InvSqrt_#t~union2, InvSqrt_~x, InvSqrt_~xhalf~0, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset;InvSqrt_~x := InvSqrt_#in~x;InvSqrt_~xhalf~0 := ~fp.mul~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 0.5), InvSqrt_~x);call InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(InvSqrt_~x, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);call InvSqrt_#t~mem0 := read~intINTTYPE4(InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);call write~intINTTYPE4(~bvsub32(1597463007bv32, ~bvashr32(InvSqrt_#t~mem0, 1bv32)), InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);havoc InvSqrt_#t~mem0;call InvSqrt_#t~mem1 := read~intFLOATTYPE4(InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);InvSqrt_~x := InvSqrt_#t~mem1;call write~intINTTYPE4(InvSqrt_#t~union2, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);havoc InvSqrt_#t~mem1;havoc InvSqrt_#t~union2;InvSqrt_~x := ~fp.mul~FLOAT(currentRoundingMode, InvSqrt_~x, ~fp.sub~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.5), ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, InvSqrt_~xhalf~0, InvSqrt_~x), InvSqrt_~x)));InvSqrt_#res := InvSqrt_~x;call ULTIMATE.dealloc(InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset);havoc InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset; {16#false} is VALID [2020-07-28 17:26:05,484 INFO L280 TraceCheckUtils]: 4: Hoare triple {16#false} main_#t~ret4 := InvSqrt_#res;main_~r~0 := main_#t~ret4;havoc main_#t~ret4;__VERIFIER_assert_#in~cond := (if ~fp.geq~FLOAT(main_~r~0, ~Pluszero~FLOAT()) && ~fp.leq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~r~0), ~to_fp~DOUBLE(currentRoundingMode, 10.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#false} is VALID [2020-07-28 17:26:05,485 INFO L280 TraceCheckUtils]: 5: Hoare triple {16#false} assume 0bv32 == __VERIFIER_assert_~cond; {16#false} is VALID [2020-07-28 17:26:05,485 INFO L280 TraceCheckUtils]: 6: Hoare triple {16#false} assume !false; {16#false} is VALID [2020-07-28 17:26:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:26:05,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:26:05,508 INFO L280 TraceCheckUtils]: 6: Hoare triple {16#false} assume !false; {16#false} is VALID [2020-07-28 17:26:05,509 INFO L280 TraceCheckUtils]: 5: Hoare triple {16#false} assume 0bv32 == __VERIFIER_assert_~cond; {16#false} is VALID [2020-07-28 17:26:05,509 INFO L280 TraceCheckUtils]: 4: Hoare triple {16#false} main_#t~ret4 := InvSqrt_#res;main_~r~0 := main_#t~ret4;havoc main_#t~ret4;__VERIFIER_assert_#in~cond := (if ~fp.geq~FLOAT(main_~r~0, ~Pluszero~FLOAT()) && ~fp.leq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~r~0), ~to_fp~DOUBLE(currentRoundingMode, 10.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#false} is VALID [2020-07-28 17:26:05,509 INFO L280 TraceCheckUtils]: 3: Hoare triple {16#false} InvSqrt_#in~x := main_~a~0;havoc InvSqrt_#res;havoc InvSqrt_#t~mem0, InvSqrt_#t~mem1, InvSqrt_#t~union2, InvSqrt_~x, InvSqrt_~xhalf~0, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset;InvSqrt_~x := InvSqrt_#in~x;InvSqrt_~xhalf~0 := ~fp.mul~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 0.5), InvSqrt_~x);call InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(InvSqrt_~x, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);call InvSqrt_#t~mem0 := read~intINTTYPE4(InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);call write~intINTTYPE4(~bvsub32(1597463007bv32, ~bvashr32(InvSqrt_#t~mem0, 1bv32)), InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);havoc InvSqrt_#t~mem0;call InvSqrt_#t~mem1 := read~intFLOATTYPE4(InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);InvSqrt_~x := InvSqrt_#t~mem1;call write~intINTTYPE4(InvSqrt_#t~union2, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);havoc InvSqrt_#t~mem1;havoc InvSqrt_#t~union2;InvSqrt_~x := ~fp.mul~FLOAT(currentRoundingMode, InvSqrt_~x, ~fp.sub~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.5), ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, InvSqrt_~xhalf~0, InvSqrt_~x), InvSqrt_~x)));InvSqrt_#res := InvSqrt_~x;call ULTIMATE.dealloc(InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset);havoc InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset; {16#false} is VALID [2020-07-28 17:26:05,511 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#true} assume 0bv32 == assume_abort_if_not_~cond;assume false; {16#false} is VALID [2020-07-28 17:26:05,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#true} havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~r~0;havoc main_~a~0;havoc main_~r~0;main_~a~0 := main_#t~nondet3;havoc main_#t~nondet3;assume_abort_if_not_#in~cond := (if ~fp.geq~FLOAT(main_~a~0, ~to_fp~FLOAT(currentRoundingMode, 0.1)) && ~fp.leq~FLOAT(main_~a~0, ~to_fp~FLOAT(currentRoundingMode, 100.0)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {15#true} is VALID [2020-07-28 17:26:05,511 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {15#true} is VALID [2020-07-28 17:26:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:26:05,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500651059] [2020-07-28 17:26:05,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:26:05,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:26:05,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254070680] [2020-07-28 17:26:05,523 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-28 17:26:05,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:26:05,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:26:05,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:26:05,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:26:05,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:26:05,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:26:05,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:26:05,721 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2020-07-28 17:26:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:26:07,860 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 17:26:07,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:26:07,861 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-07-28 17:26:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:26:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:26:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2020-07-28 17:26:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:26:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 22 transitions. [2020-07-28 17:26:07,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 22 transitions. [2020-07-28 17:26:08,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:26:08,254 INFO L225 Difference]: With dead ends: 21 [2020-07-28 17:26:08,254 INFO L226 Difference]: Without dead ends: 8 [2020-07-28 17:26:08,257 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:26:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-28 17:26:08,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-28 17:26:08,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:26:08,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2020-07-28 17:26:08,299 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 17:26:08,300 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 17:26:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:26:08,302 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2020-07-28 17:26:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-07-28 17:26:08,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:26:08,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:26:08,303 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 17:26:08,303 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 17:26:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:26:08,305 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2020-07-28 17:26:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-07-28 17:26:08,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:26:08,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:26:08,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:26:08,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:26:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:26:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2020-07-28 17:26:08,309 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2020-07-28 17:26:08,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:26:08,309 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2020-07-28 17:26:08,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:26:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-07-28 17:26:08,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 17:26:08,310 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:26:08,310 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:26:08,520 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:26:08,521 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:26:08,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:26:08,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1806812424, now seen corresponding path program 1 times [2020-07-28 17:26:08,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:26:08,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917290523] [2020-07-28 17:26:08,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 17:26:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:26:10,295 WARN L261 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-28 17:26:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-28 17:26:12,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:26:12,489 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:26:14,818 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))) (and (= (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 3.0 2.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 2.0)) .cse1) .cse0) .cse0)))) |c_ULTIMATE.start_InvSqrt_#res|) (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 10.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-07-28 17:26:15,709 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:26:17,750 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:26:35,032 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse1) .cse2) .cse2)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.geq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven .cse0) ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse5 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))) (and (not (fp.geq (let ((.cse4 (let ((.cse6 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse5) .cse4) .cse4)))) (_ +zero 8 24))) (fp.geq .cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq .cse5 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) .cse7) (and (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))) (and (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (let ((.cse8 (let ((.cse10 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.mul roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse9) .cse8) .cse8))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq .cse9 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq .cse9 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) .cse7))) is different from false [2020-07-28 17:26:45,380 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))) (and (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse1) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (exists ((v_prenex_1 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (fp.leq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (not (fp.geq (let ((.cse4 (let ((.cse5 (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse3) .cse4) .cse4)))) (_ +zero 8 24))) (fp.geq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))))))) is different from false [2020-07-28 17:26:47,423 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)))) (and (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (let ((.cse0 (let ((.cse2 (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse1) .cse0) .cse0))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq .cse1 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (exists ((v_prenex_1 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (fp.leq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (not (fp.geq (let ((.cse4 (let ((.cse5 (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) .cse3) .cse4) .cse4)))) (_ +zero 8 24))) (fp.geq .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))))))) is different from true [2020-07-28 17:26:47,430 INFO L280 TraceCheckUtils]: 0: Hoare triple {107#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {112#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2020-07-28 17:26:47,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {112#(= currentRoundingMode roundNearestTiesToEven)} havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~r~0;havoc main_~a~0;havoc main_~r~0;main_~a~0 := main_#t~nondet3;havoc main_#t~nondet3;assume_abort_if_not_#in~cond := (if ~fp.geq~FLOAT(main_~a~0, ~to_fp~FLOAT(currentRoundingMode, 0.1)) && ~fp.leq~FLOAT(main_~a~0, ~to_fp~FLOAT(currentRoundingMode, 100.0)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {116#(and (or (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (fp.geq ULTIMATE.start_main_~a~0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 10.0))) (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 8 24) currentRoundingMode 100.0))) (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (or (not (fp.geq ULTIMATE.start_main_~a~0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 10.0)))) (not (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 8 24) currentRoundingMode 100.0)))))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:26:47,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {116#(and (or (and (= (_ bv1 32) ULTIMATE.start_assume_abort_if_not_~cond) (fp.geq ULTIMATE.start_main_~a~0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 10.0))) (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 8 24) currentRoundingMode 100.0))) (and (= (_ bv0 32) ULTIMATE.start_assume_abort_if_not_~cond) (or (not (fp.geq ULTIMATE.start_main_~a~0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 10.0)))) (not (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 8 24) currentRoundingMode 100.0)))))) (= currentRoundingMode roundNearestTiesToEven))} assume !(0bv32 == assume_abort_if_not_~cond); {120#(and (fp.geq ULTIMATE.start_main_~a~0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 10.0))) (= currentRoundingMode roundNearestTiesToEven) (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 8 24) currentRoundingMode 100.0)))} is VALID [2020-07-28 17:26:49,620 INFO L280 TraceCheckUtils]: 3: Hoare triple {120#(and (fp.geq ULTIMATE.start_main_~a~0 ((_ to_fp 8 24) currentRoundingMode (/ 1.0 10.0))) (= currentRoundingMode roundNearestTiesToEven) (fp.leq ULTIMATE.start_main_~a~0 ((_ to_fp 8 24) currentRoundingMode 100.0)))} InvSqrt_#in~x := main_~a~0;havoc InvSqrt_#res;havoc InvSqrt_#t~mem0, InvSqrt_#t~mem1, InvSqrt_#t~union2, InvSqrt_~x, InvSqrt_~xhalf~0, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset;InvSqrt_~x := InvSqrt_#in~x;InvSqrt_~xhalf~0 := ~fp.mul~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 0.5), InvSqrt_~x);call InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(InvSqrt_~x, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);call InvSqrt_#t~mem0 := read~intINTTYPE4(InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);call write~intINTTYPE4(~bvsub32(1597463007bv32, ~bvashr32(InvSqrt_#t~mem0, 1bv32)), InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);havoc InvSqrt_#t~mem0;call InvSqrt_#t~mem1 := read~intFLOATTYPE4(InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);InvSqrt_~x := InvSqrt_#t~mem1;call write~intINTTYPE4(InvSqrt_#t~union2, InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset, 4bv32);havoc InvSqrt_#t~mem1;havoc InvSqrt_#t~union2;InvSqrt_~x := ~fp.mul~FLOAT(currentRoundingMode, InvSqrt_~x, ~fp.sub~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.5), ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, InvSqrt_~xhalf~0, InvSqrt_~x), InvSqrt_~x)));InvSqrt_#res := InvSqrt_~x;call ULTIMATE.dealloc(InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset);havoc InvSqrt_~#i~0.base, InvSqrt_~#i~0.offset; {124#(and (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (and (= (fp.mul currentRoundingMode (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 3.0 2.0)) (fp.mul currentRoundingMode (fp.mul currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 2.0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))))) |ULTIMATE.start_InvSqrt_#res|) (fp.leq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) currentRoundingMode 100.0)) (fp.geq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) currentRoundingMode (/ 1.0 10.0))))) (= currentRoundingMode roundNearestTiesToEven))} is UNKNOWN [2020-07-28 17:26:52,528 INFO L280 TraceCheckUtils]: 4: Hoare triple {124#(and (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (and (= (fp.mul currentRoundingMode (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 3.0 2.0)) (fp.mul currentRoundingMode (fp.mul currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 1.0 2.0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))))) |ULTIMATE.start_InvSqrt_#res|) (fp.leq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) currentRoundingMode 100.0)) (fp.geq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) currentRoundingMode (/ 1.0 10.0))))) (= currentRoundingMode roundNearestTiesToEven))} main_#t~ret4 := InvSqrt_#res;main_~r~0 := main_#t~ret4;havoc main_#t~ret4;__VERIFIER_assert_#in~cond := (if ~fp.geq~FLOAT(main_~r~0, ~Pluszero~FLOAT()) && ~fp.leq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~r~0), ~to_fp~DOUBLE(currentRoundingMode, 10.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {128#(or (and (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (and (fp.geq (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))))) (_ +zero 8 24)) (fp.geq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (and (not (fp.geq (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))))) (_ +zero 8 24))) (fp.geq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (and (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))))} is UNKNOWN [2020-07-28 17:26:53,574 INFO L280 TraceCheckUtils]: 5: Hoare triple {128#(or (and (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (and (fp.geq (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))))) (_ +zero 8 24)) (fp.geq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (and (not (fp.geq (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))))) (_ +zero 8 24))) (fp.geq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (and (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))))} assume 0bv32 == __VERIFIER_assert_~cond; {132#(or (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (and (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) (exists ((v_prenex_1 (_ BitVec 32))) (and (fp.leq (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (not (fp.geq (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))))))) (_ +zero 8 24))) (fp.geq (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))))))} is VALID [2020-07-28 17:26:55,656 INFO L280 TraceCheckUtils]: 6: Hoare triple {132#(or (exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 32))) (and (not (fp.leq ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr |v_skolemized_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))))))) ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (fp.geq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))) (fp.leq (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_3|)) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) (exists ((v_prenex_1 (_ BitVec 32))) (and (fp.leq (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (not (fp.geq (fp.mul roundNearestTiesToEven (fp ((_ extract 31 31) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32)))) (fp.sub roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 3.0 2.0)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 2.0)) (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))))) (fp ((_ extract 31 31) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 30 23) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))) ((_ extract 22 0) (bvadd (bvneg (bvashr v_prenex_1 (_ bv1 32))) (_ bv1597463007 32))))))) (_ +zero 8 24))) (fp.geq (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)) ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 10.0))))))} assume !false; {108#false} is UNKNOWN [2020-07-28 17:26:55,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:26:55,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:26:56,520 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-07-28 17:26:58,576 INFO L523 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-28 17:27:05,779 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-07-28 17:27:05,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917290523] [2020-07-28 17:27:05,781 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2020-07-28 17:27:05,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [407187809] [2020-07-28 17:27:05,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-07-28 17:27:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:27:06,527 WARN L261 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-28 17:27:06,528 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@15484376 [2020-07-28 17:27:06,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673132359] [2020-07-28 17:27:06,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:27:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:27:38,316 WARN L261 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-28 17:27:38,317 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@15484376 [2020-07-28 17:27:38,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:27:38,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-07-28 17:27:38,318 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-07-28 17:27:38,318 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:27:38,923 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk,3 mathsat -unsat_core_generation=3,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 17:27:38,940 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:27:38,941 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:27:38,941 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-28 17:27:38,941 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-28 17:27:38,941 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-28 17:27:38,941 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 17:27:38,941 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 17:27:38,941 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 17:27:38,942 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-28 17:27:38,942 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2020-07-28 17:27:38,942 WARN L170 areAnnotationChecker]: L11-3 has no Hoare annotation [2020-07-28 17:27:38,942 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:27:38,942 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:27:38,942 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. [2020-07-28 17:27:38,944 WARN L231 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-07-28 17:27:38,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:27:38 BoogieIcfgContainer [2020-07-28 17:27:38,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:27:38,946 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:27:38,946 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:27:38,946 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:27:38,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:26:05" (3/4) ... [2020-07-28 17:27:38,951 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-28 17:27:38,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:27:38,953 INFO L168 Benchmark]: Toolchain (without parser) took 95958.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 960.2 MB in the beginning and 980.9 MB in the end (delta: -20.7 MB). Peak memory consumption was 112.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:27:38,954 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:27:38,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:27:38,956 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:27:38,957 INFO L168 Benchmark]: Boogie Preprocessor took 37.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:27:38,958 INFO L168 Benchmark]: RCFGBuilder took 1616.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:27:38,959 INFO L168 Benchmark]: TraceAbstraction took 93874.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.9 MB in the end (delta: 121.6 MB). Peak memory consumption was 121.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:27:38,959 INFO L168 Benchmark]: Witness Printer took 4.97 ms. Allocated memory is still 1.2 GB. Free memory is still 980.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:27:38,964 INFO L336 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 363.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1616.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 93874.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 980.9 MB in the end (delta: 121.6 MB). Peak memory consumption was 121.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.97 ms. Allocated memory is still 1.2 GB. Free memory is still 980.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 11]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L43] float a,r; [L45] a = __VERIFIER_nondet_float() [L9] COND FALSE !(!cond) [L20] float xhalf = 0.5f*x; [L21] union float_int i; [L22] i.f = x [L23] EXPR i.i [L23] i.i = 0x5f3759df - (i.i>>1) [L24] EXPR i.f [L24] x = i.f [L25] x = x*(1.5f-xhalf*x*x) [L26] return x; [L26] return x; [L48] r = InvSqrt(a) [L11] COND TRUE !(cond) [L11] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 93.8s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, 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.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 72 SizeOfPredicates, 0 NumberOfNonLiveVariables, 28 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 Received shutdown request...