./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1011a.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-newlib/float_req_bl_1011a.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 887f0640b1b5afa2d39789f5b16e950cef616033 .................................................................................................................................................................................................................................................................................................................................................... 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-newlib/float_req_bl_1011a.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 887f0640b1b5afa2d39789f5b16e950cef616033 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:52:55,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:52:55,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:52:55,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:52:55,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:52:55,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:52:55,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:52:55,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:52:55,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:52:55,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:52:55,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:52:55,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:52:55,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:52:55,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:52:55,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:52:55,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:52:55,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:52:55,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:52:55,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:52:55,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:52:55,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:52:55,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:52:55,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:52:55,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:52:55,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:52:55,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:52:55,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:52:55,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:52:55,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:52:55,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:52:55,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:52:55,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:52:55,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:52:55,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:52:55,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:52:55,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:52:55,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:52:55,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:52:55,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:52:55,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:52:55,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:52:55,480 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:52:55,496 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:52:55,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:52:55,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:52:55,498 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:52:55,498 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:52:55,498 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:52:55,499 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:52:55,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:52:55,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:52:55,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:52:55,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:52:55,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:52:55,500 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:52:55,501 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:52:55,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:52:55,501 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:52:55,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:52:55,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:52:55,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:52:55,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:52:55,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:52:55,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:52:55,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:52:55,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:52:55,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:52:55,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:52:55,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:52:55,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:52:55,505 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:52:55,505 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 -> 887f0640b1b5afa2d39789f5b16e950cef616033 [2020-07-28 17:52:55,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:52:55,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:52:55,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:52:55,887 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:52:55,888 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:52:55,888 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1011a.c [2020-07-28 17:52:55,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c5e04f9/f3fef9d30a7744d884cdd14f566a2e8f/FLAG9486223e7 [2020-07-28 17:52:56,352 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:52:56,352 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1011a.c [2020-07-28 17:52:56,360 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c5e04f9/f3fef9d30a7744d884cdd14f566a2e8f/FLAG9486223e7 [2020-07-28 17:52:56,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20c5e04f9/f3fef9d30a7744d884cdd14f566a2e8f [2020-07-28 17:52:56,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:52:56,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:52:56,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:52:56,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:52:56,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:52:56,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:52:56" (1/1) ... [2020-07-28 17:52:56,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9cdda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:52:56, skipping insertion in model container [2020-07-28 17:52:56,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:52:56" (1/1) ... [2020-07-28 17:52:56,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:52:56,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:52:56,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:52:57,003 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:52:57,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:52:57,051 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:52:57,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:52:57 WrapperNode [2020-07-28 17:52:57,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:52:57,052 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:52:57,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:52:57,053 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:52:57,126 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:52:57" (1/1) ... [2020-07-28 17:52:57,144 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:52:57" (1/1) ... [2020-07-28 17:52:57,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:52:57,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:52:57,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:52:57,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:52:57,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:52:57" (1/1) ... [2020-07-28 17:52:57,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:52:57" (1/1) ... [2020-07-28 17:52:57,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:52:57" (1/1) ... [2020-07-28 17:52:57,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:52:57" (1/1) ... [2020-07-28 17:52:57,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:52:57" (1/1) ... [2020-07-28 17:52:57,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:52:57" (1/1) ... [2020-07-28 17:52:57,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:52:57" (1/1) ... [2020-07-28 17:52:57,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:52:57,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:52:57,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:52:57,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:52:57,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:52:57" (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:52:57,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:52:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 17:52:57,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:52:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:52:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:52:57,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:52:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:52:57,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:52:57,691 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:52:57,692 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:52:57,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:52:57 BoogieIcfgContainer [2020-07-28 17:52:57,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:52:57,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:52:57,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:52:57,700 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:52:57,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:52:56" (1/3) ... [2020-07-28 17:52:57,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db9e236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:52:57, skipping insertion in model container [2020-07-28 17:52:57,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:52:57" (2/3) ... [2020-07-28 17:52:57,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db9e236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:52:57, skipping insertion in model container [2020-07-28 17:52:57,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:52:57" (3/3) ... [2020-07-28 17:52:57,714 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1011a.c [2020-07-28 17:52:57,726 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:52:57,733 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:52:57,748 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:52:57,772 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:52:57,772 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:52:57,772 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:52:57,772 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:52:57,772 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:52:57,773 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:52:57,773 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:52:57,773 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:52:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 17:52:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 17:52:57,793 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:52:57,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:52:57,795 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:52:57,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:52:57,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1641221055, now seen corresponding path program 1 times [2020-07-28 17:52:57,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:52:57,809 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463969051] [2020-07-28 17:52:57,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:52:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:52:57,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {22#true} is VALID [2020-07-28 17:52:57,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := 0.0;fabs_float_#in~x := main_~x~0;havoc fabs_float_#res;havoc fabs_float_#t~mem0, fabs_float_#t~union1, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, fabs_float_#t~mem2, fabs_float_#t~union3, fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, fabs_float_~x, fabs_float_~ix~0;fabs_float_~x := fabs_float_#in~x;havoc fabs_float_~ix~0; {22#true} is VALID [2020-07-28 17:52:57,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 17:52:57,928 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume !true; {23#false} is VALID [2020-07-28 17:52:57,929 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} fabs_float_#res := fabs_float_~x; {23#false} is VALID [2020-07-28 17:52:57,929 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#false} main_#t~ret6 := fabs_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~someBinaryFLOATComparisonOperation(main_~res~0, 0.0); {23#false} is VALID [2020-07-28 17:52:57,929 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} assume !main_#t~short8; {23#false} is VALID [2020-07-28 17:52:57,930 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} assume !main_#t~short8;havoc main_#t~ret7;havoc main_#t~short8; {23#false} is VALID [2020-07-28 17:52:57,930 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 17:52:57,932 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:52:57,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463969051] [2020-07-28 17:52:57,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:52:57,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:52:57,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057656169] [2020-07-28 17:52:57,941 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:52:57,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:52:57,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:52:57,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:52:57,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:52:57,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:52:57,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:52:57,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:52:57,993 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-28 17:52:58,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:52:58,076 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-07-28 17:52:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:52:58,077 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:52:58,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:52:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:52:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:52:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:52:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:52:58,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2020-07-28 17:52:58,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:52:58,181 INFO L225 Difference]: With dead ends: 36 [2020-07-28 17:52:58,182 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:52:58,186 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:52:58,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:52:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:52:58,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:52:58,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:52:58,226 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:52:58,226 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:52:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:52:58,229 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:52:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:52:58,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:52:58,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:52:58,230 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:52:58,230 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:52:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:52:58,233 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:52:58,234 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:52:58,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:52:58,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:52:58,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:52:58,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:52:58,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:52:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-28 17:52:58,239 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2020-07-28 17:52:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:52:58,239 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-28 17:52:58,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:52:58,240 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:52:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:52:58,240 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:52:58,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:52:58,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:52:58,241 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:52:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:52:58,242 INFO L82 PathProgramCache]: Analyzing trace with hash 558264036, now seen corresponding path program 1 times [2020-07-28 17:52:58,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:52:58,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754727222] [2020-07-28 17:52:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:52:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:52:58,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:52:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:52:58,313 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:52:58,340 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 17:52:58,340 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:52:58,342 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:52:58,370 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:52:58,371 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:52:58,371 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-28 17:52:58,371 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-28 17:52:58,371 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-28 17:52:58,371 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-28 17:52:58,371 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 17:52:58,371 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 17:52:58,371 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 17:52:58,372 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 17:52:58,372 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-28 17:52:58,372 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-28 17:52:58,372 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-28 17:52:58,372 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-28 17:52:58,372 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-28 17:52:58,372 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-28 17:52:58,373 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-28 17:52:58,373 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-28 17:52:58,373 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-28 17:52:58,373 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-28 17:52:58,373 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 17:52:58,373 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 17:52:58,374 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 17:52:58,374 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-28 17:52:58,374 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-28 17:52:58,374 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:52:58,374 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:52:58,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:52:58 BoogieIcfgContainer [2020-07-28 17:52:58,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:52:58,377 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:52:58,377 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:52:58,378 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:52:58,378 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:52:57" (3/4) ... [2020-07-28 17:52:58,382 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-28 17:52:58,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:52:58,386 INFO L168 Benchmark]: Toolchain (without parser) took 1605.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 961.6 MB in the beginning and 1.0 GB in the end (delta: -66.0 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:52:58,387 INFO L168 Benchmark]: CDTParser took 0.34 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:52:58,388 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.70 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.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:52:58,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:52:58,390 INFO L168 Benchmark]: Boogie Preprocessor took 32.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:52:58,390 INFO L168 Benchmark]: RCFGBuilder took 492.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:52:58,391 INFO L168 Benchmark]: TraceAbstraction took 680.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:52:58,392 INFO L168 Benchmark]: Witness Printer took 5.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:52:58,396 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.34 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 268.70 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.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 117.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 492.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 680.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 50]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of bitwiseAnd at line 21. Possible FailurePath: [L45] float x = 0.0f; [L13] __uint32_t ix; [L15] ieee_float_shape_type gf_u; [L16] gf_u.value = (x) [L17] EXPR gf_u.word [L17] (ix) = gf_u.word [L20] ieee_float_shape_type sf_u; [L21] sf_u.word = (ix & 0x7fffffff) [L22] EXPR sf_u.value [L22] (x) = sf_u.value [L24] return x; [L46] float res = fabs_float(x); [L49] EXPR res == 0.0f && __signbit_float(res) == 0 [L49] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L50] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 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=19occurred 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, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 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:53:00,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:53:00,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:53:00,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:53:00,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:53:00,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:53:00,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:53:00,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:53:00,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:53:00,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:53:00,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:53:00,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:53:00,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:53:00,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:53:00,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:53:00,544 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:53:00,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:53:00,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:53:00,548 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:53:00,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:53:00,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:53:00,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:53:00,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:53:00,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:53:00,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:53:00,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:53:00,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:53:00,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:53:00,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:53:00,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:53:00,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:53:00,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:53:00,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:53:00,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:53:00,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:53:00,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:53:00,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:53:00,566 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:53:00,566 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:53:00,567 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:53:00,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:53:00,569 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:53:00,584 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:53:00,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:53:00,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:53:00,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:53:00,586 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:53:00,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:53:00,586 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:53:00,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:53:00,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:53:00,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:53:00,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:53:00,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:53:00,587 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:53:00,588 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:53:00,588 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:53:00,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:53:00,588 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:53:00,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:53:00,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:53:00,589 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:53:00,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:53:00,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:53:00,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:53:00,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:53:00,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:53:00,590 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:53:00,591 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:53:00,591 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:53:00,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:53:00,591 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:53:00,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:53:00,592 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 -> 887f0640b1b5afa2d39789f5b16e950cef616033 [2020-07-28 17:53:00,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:53:00,923 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:53:00,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:53:00,929 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:53:00,929 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:53:00,930 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1011a.c [2020-07-28 17:53:00,996 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6481abf5/0c944f099b954f4699b05e73b4092ca9/FLAG79ad3fc84 [2020-07-28 17:53:01,390 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:53:01,391 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1011a.c [2020-07-28 17:53:01,404 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6481abf5/0c944f099b954f4699b05e73b4092ca9/FLAG79ad3fc84 [2020-07-28 17:53:01,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6481abf5/0c944f099b954f4699b05e73b4092ca9 [2020-07-28 17:53:01,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:53:01,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:53:01,788 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:53:01,789 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:53:01,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:53:01,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:53:01" (1/1) ... [2020-07-28 17:53:01,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d0efdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:01, skipping insertion in model container [2020-07-28 17:53:01,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:53:01" (1/1) ... [2020-07-28 17:53:01,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:53:01,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:53:02,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:53:02,051 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:53:02,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:53:02,206 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:53:02,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:02 WrapperNode [2020-07-28 17:53:02,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:53:02,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:53:02,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:53:02,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:53:02,221 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:53:02" (1/1) ... [2020-07-28 17:53:02,249 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:53:02" (1/1) ... [2020-07-28 17:53:02,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:53:02,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:53:02,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:53:02,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:53:02,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:02" (1/1) ... [2020-07-28 17:53:02,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:02" (1/1) ... [2020-07-28 17:53:02,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:02" (1/1) ... [2020-07-28 17:53:02,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:02" (1/1) ... [2020-07-28 17:53:02,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:02" (1/1) ... [2020-07-28 17:53:02,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:02" (1/1) ... [2020-07-28 17:53:02,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:02" (1/1) ... [2020-07-28 17:53:02,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:53:02,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:53:02,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:53:02,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:53:02,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:02" (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:53:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:53:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2020-07-28 17:53:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:53:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:53:02,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:53:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-07-28 17:53:02,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 17:53:02,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:53:02,825 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:53:02,826 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:53:02,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:53:02 BoogieIcfgContainer [2020-07-28 17:53:02,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:53:02,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:53:02,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:53:02,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:53:02,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:53:01" (1/3) ... [2020-07-28 17:53:02,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d08fffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:53:02, skipping insertion in model container [2020-07-28 17:53:02,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:53:02" (2/3) ... [2020-07-28 17:53:02,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d08fffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:53:02, skipping insertion in model container [2020-07-28 17:53:02,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:53:02" (3/3) ... [2020-07-28 17:53:02,838 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1011a.c [2020-07-28 17:53:02,849 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:53:02,857 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:53:02,868 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:53:02,892 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:53:02,892 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:53:02,892 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:53:02,893 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:53:02,893 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:53:02,893 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:53:02,893 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:53:02,893 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:53:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 17:53:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 17:53:02,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:53:02,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:53:02,914 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:53:02,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:53:02,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1641221055, now seen corresponding path program 1 times [2020-07-28 17:53:02,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:53:02,931 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1893914001] [2020-07-28 17:53:02,931 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:53:02,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:03,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:53:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:03,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:53:03,061 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {22#true} is VALID [2020-07-28 17:53:03,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~FLOAT();fabs_float_#in~x := main_~x~0;havoc fabs_float_#res;havoc fabs_float_#t~mem0, fabs_float_#t~union1, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, fabs_float_#t~mem2, fabs_float_#t~union3, fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, fabs_float_~x, fabs_float_~ix~0;fabs_float_~x := fabs_float_#in~x;havoc fabs_float_~ix~0; {22#true} is VALID [2020-07-28 17:53:03,064 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 17:53:03,064 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume !true; {23#false} is VALID [2020-07-28 17:53:03,065 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} fabs_float_#res := fabs_float_~x; {23#false} is VALID [2020-07-28 17:53:03,065 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#false} main_#t~ret6 := fabs_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~fp.eq~FLOAT(main_~res~0, ~Pluszero~FLOAT()); {23#false} is VALID [2020-07-28 17:53:03,065 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} assume !main_#t~short8; {23#false} is VALID [2020-07-28 17:53:03,066 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} assume !main_#t~short8;havoc main_#t~short8;havoc main_#t~ret7; {23#false} is VALID [2020-07-28 17:53:03,066 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 17:53:03,068 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:53:03,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:53:03,091 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 17:53:03,091 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} assume !main_#t~short8;havoc main_#t~short8;havoc main_#t~ret7; {23#false} is VALID [2020-07-28 17:53:03,092 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} assume !main_#t~short8; {23#false} is VALID [2020-07-28 17:53:03,092 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#false} main_#t~ret6 := fabs_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~fp.eq~FLOAT(main_~res~0, ~Pluszero~FLOAT()); {23#false} is VALID [2020-07-28 17:53:03,093 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} fabs_float_#res := fabs_float_~x; {23#false} is VALID [2020-07-28 17:53:03,093 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume !true; {23#false} is VALID [2020-07-28 17:53:03,094 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 17:53:03,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~FLOAT();fabs_float_#in~x := main_~x~0;havoc fabs_float_#res;havoc fabs_float_#t~mem0, fabs_float_#t~union1, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, fabs_float_#t~mem2, fabs_float_#t~union3, fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, fabs_float_~x, fabs_float_~ix~0;fabs_float_~x := fabs_float_#in~x;havoc fabs_float_~ix~0; {22#true} is VALID [2020-07-28 17:53:03,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {22#true} is VALID [2020-07-28 17:53:03,096 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:53:03,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1893914001] [2020-07-28 17:53:03,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:53:03,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:53:03,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813336650] [2020-07-28 17:53:03,106 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:53:03,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:53:03,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:53:03,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:03,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:53:03,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:53:03,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:53:03,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:53:03,148 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-28 17:53:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:03,224 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-07-28 17:53:03,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:53:03,225 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:53:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:53:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:53:03,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:53:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:53:03,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:53:03,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2020-07-28 17:53:03,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:03,339 INFO L225 Difference]: With dead ends: 36 [2020-07-28 17:53:03,339 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:53:03,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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:53:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:53:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:53:03,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:53:03,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:53:03,380 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:53:03,380 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:53:03,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:03,382 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:53:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:53:03,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:03,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:03,384 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:53:03,384 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:53:03,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:03,386 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:53:03,386 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:53:03,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:03,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:03,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:53:03,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:53:03,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:53:03,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-28 17:53:03,391 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2020-07-28 17:53:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:53:03,391 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-28 17:53:03,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:53:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:53:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:53:03,392 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:53:03,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:53:03,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:53:03,606 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:53:03,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:53:03,607 INFO L82 PathProgramCache]: Analyzing trace with hash 558264036, now seen corresponding path program 1 times [2020-07-28 17:53:03,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:53:03,609 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191092174] [2020-07-28 17:53:03,609 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:53:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:03,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-28 17:53:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:03,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:53:03,836 INFO L280 TraceCheckUtils]: 0: Hoare triple {172#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {172#true} is VALID [2020-07-28 17:53:03,838 INFO L280 TraceCheckUtils]: 1: Hoare triple {172#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~FLOAT();fabs_float_#in~x := main_~x~0;havoc fabs_float_#res;havoc fabs_float_#t~mem0, fabs_float_#t~union1, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, fabs_float_#t~mem2, fabs_float_#t~union3, fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, fabs_float_~x, fabs_float_~ix~0;fabs_float_~x := fabs_float_#in~x;havoc fabs_float_~ix~0; {180#(= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x)} is VALID [2020-07-28 17:53:03,841 INFO L280 TraceCheckUtils]: 2: Hoare triple {180#(= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x)} call fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fabs_float_~x, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, 4bv32);call fabs_float_#t~mem0 := read~intINTTYPE4(fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, 4bv32);fabs_float_~ix~0 := fabs_float_#t~mem0;call write~intFLOATTYPE4(fabs_float_#t~union1, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, 4bv32);havoc fabs_float_#t~union1;havoc fabs_float_#t~mem0;call ULTIMATE.dealloc(fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset);havoc fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset; {184#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 30 23) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 22 0) ULTIMATE.start_fabs_float_~ix~0)))} is VALID [2020-07-28 17:53:03,842 INFO L280 TraceCheckUtils]: 3: Hoare triple {184#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 30 23) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 22 0) ULTIMATE.start_fabs_float_~ix~0)))} goto; {184#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 30 23) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 22 0) ULTIMATE.start_fabs_float_~ix~0)))} is VALID [2020-07-28 17:53:03,845 INFO L280 TraceCheckUtils]: 4: Hoare triple {184#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 30 23) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 22 0) ULTIMATE.start_fabs_float_~ix~0)))} call fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483647bv32, fabs_float_~ix~0), fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, 4bv32);call fabs_float_#t~mem2 := read~intFLOATTYPE4(fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, 4bv32);fabs_float_~x := fabs_float_#t~mem2;call write~intINTTYPE4(fabs_float_#t~union3, fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, 4bv32);havoc fabs_float_#t~union3;havoc fabs_float_#t~mem2;call ULTIMATE.dealloc(fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset);havoc fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset; {180#(= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x)} is VALID [2020-07-28 17:53:03,846 INFO L280 TraceCheckUtils]: 5: Hoare triple {180#(= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x)} goto; {180#(= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x)} is VALID [2020-07-28 17:53:03,847 INFO L280 TraceCheckUtils]: 6: Hoare triple {180#(= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x)} fabs_float_#res := fabs_float_~x; {197#(= (_ +zero 8 24) |ULTIMATE.start_fabs_float_#res|)} is VALID [2020-07-28 17:53:03,848 INFO L280 TraceCheckUtils]: 7: Hoare triple {197#(= (_ +zero 8 24) |ULTIMATE.start_fabs_float_#res|)} main_#t~ret6 := fabs_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~fp.eq~FLOAT(main_~res~0, ~Pluszero~FLOAT()); {201#|ULTIMATE.start_main_#t~short8|} is VALID [2020-07-28 17:53:03,849 INFO L280 TraceCheckUtils]: 8: Hoare triple {201#|ULTIMATE.start_main_#t~short8|} assume !main_#t~short8; {173#false} is VALID [2020-07-28 17:53:03,849 INFO L280 TraceCheckUtils]: 9: Hoare triple {173#false} assume !main_#t~short8;havoc main_#t~short8;havoc main_#t~ret7; {173#false} is VALID [2020-07-28 17:53:03,850 INFO L280 TraceCheckUtils]: 10: Hoare triple {173#false} assume !false; {173#false} is VALID [2020-07-28 17:53:03,851 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:53:03,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:53:03,977 INFO L280 TraceCheckUtils]: 10: Hoare triple {173#false} assume !false; {173#false} is VALID [2020-07-28 17:53:03,978 INFO L280 TraceCheckUtils]: 9: Hoare triple {173#false} assume !main_#t~short8;havoc main_#t~short8;havoc main_#t~ret7; {173#false} is VALID [2020-07-28 17:53:03,979 INFO L280 TraceCheckUtils]: 8: Hoare triple {201#|ULTIMATE.start_main_#t~short8|} assume !main_#t~short8; {173#false} is VALID [2020-07-28 17:53:03,980 INFO L280 TraceCheckUtils]: 7: Hoare triple {220#(fp.eq |ULTIMATE.start_fabs_float_#res| (_ +zero 8 24))} main_#t~ret6 := fabs_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~fp.eq~FLOAT(main_~res~0, ~Pluszero~FLOAT()); {201#|ULTIMATE.start_main_#t~short8|} is VALID [2020-07-28 17:53:03,981 INFO L280 TraceCheckUtils]: 6: Hoare triple {224#(fp.eq ULTIMATE.start_fabs_float_~x (_ +zero 8 24))} fabs_float_#res := fabs_float_~x; {220#(fp.eq |ULTIMATE.start_fabs_float_#res| (_ +zero 8 24))} is VALID [2020-07-28 17:53:03,982 INFO L280 TraceCheckUtils]: 5: Hoare triple {224#(fp.eq ULTIMATE.start_fabs_float_~x (_ +zero 8 24))} goto; {224#(fp.eq ULTIMATE.start_fabs_float_~x (_ +zero 8 24))} is VALID [2020-07-28 17:53:03,984 INFO L280 TraceCheckUtils]: 4: Hoare triple {231#(fp.eq (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 30 23) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 22 0) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0))) (_ +zero 8 24))} call fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483647bv32, fabs_float_~ix~0), fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, 4bv32);call fabs_float_#t~mem2 := read~intFLOATTYPE4(fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, 4bv32);fabs_float_~x := fabs_float_#t~mem2;call write~intINTTYPE4(fabs_float_#t~union3, fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, 4bv32);havoc fabs_float_#t~union3;havoc fabs_float_#t~mem2;call ULTIMATE.dealloc(fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset);havoc fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset; {224#(fp.eq ULTIMATE.start_fabs_float_~x (_ +zero 8 24))} is VALID [2020-07-28 17:53:03,985 INFO L280 TraceCheckUtils]: 3: Hoare triple {231#(fp.eq (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 30 23) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 22 0) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0))) (_ +zero 8 24))} goto; {231#(fp.eq (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 30 23) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 22 0) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0))) (_ +zero 8 24))} is VALID [2020-07-28 17:53:03,989 INFO L280 TraceCheckUtils]: 2: Hoare triple {224#(fp.eq ULTIMATE.start_fabs_float_~x (_ +zero 8 24))} call fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fabs_float_~x, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, 4bv32);call fabs_float_#t~mem0 := read~intINTTYPE4(fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, 4bv32);fabs_float_~ix~0 := fabs_float_#t~mem0;call write~intFLOATTYPE4(fabs_float_#t~union1, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, 4bv32);havoc fabs_float_#t~union1;havoc fabs_float_#t~mem0;call ULTIMATE.dealloc(fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset);havoc fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset; {231#(fp.eq (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 30 23) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 22 0) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0))) (_ +zero 8 24))} is VALID [2020-07-28 17:53:03,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {172#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~FLOAT();fabs_float_#in~x := main_~x~0;havoc fabs_float_#res;havoc fabs_float_#t~mem0, fabs_float_#t~union1, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, fabs_float_#t~mem2, fabs_float_#t~union3, fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, fabs_float_~x, fabs_float_~ix~0;fabs_float_~x := fabs_float_#in~x;havoc fabs_float_~ix~0; {224#(fp.eq ULTIMATE.start_fabs_float_~x (_ +zero 8 24))} is VALID [2020-07-28 17:53:03,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {172#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {172#true} is VALID [2020-07-28 17:53:03,992 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:53:03,993 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191092174] [2020-07-28 17:53:03,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:53:03,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-07-28 17:53:03,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780685476] [2020-07-28 17:53:03,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2020-07-28 17:53:03,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:53:03,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 17:53:04,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:04,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 17:53:04,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:53:04,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 17:53:04,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-28 17:53:04,036 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2020-07-28 17:53:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:04,330 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-28 17:53:04,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:53:04,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2020-07-28 17:53:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:53:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:53:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-07-28 17:53:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:53:04,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-07-28 17:53:04,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2020-07-28 17:53:04,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:04,395 INFO L225 Difference]: With dead ends: 19 [2020-07-28 17:53:04,395 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:53:04,396 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-07-28 17:53:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:53:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:53:04,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:53:04,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:53:04,411 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:53:04,411 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:53:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:04,413 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:53:04,413 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:53:04,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:04,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:04,414 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:53:04,418 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:53:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:04,420 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:53:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:53:04,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:04,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:04,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:53:04,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:53:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:53:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2020-07-28 17:53:04,425 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 11 [2020-07-28 17:53:04,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:53:04,425 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2020-07-28 17:53:04,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 17:53:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:53:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:53:04,427 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:53:04,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:53:04,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:53:04,629 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:53:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:53:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2014349959, now seen corresponding path program 1 times [2020-07-28 17:53:04,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:53:04,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390663099] [2020-07-28 17:53:04,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 17:53:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:04,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-28 17:53:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:53:04,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:53:04,880 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:53:04,933 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {324#true} is VALID [2020-07-28 17:53:04,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {324#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~FLOAT();fabs_float_#in~x := main_~x~0;havoc fabs_float_#res;havoc fabs_float_#t~mem0, fabs_float_#t~union1, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, fabs_float_#t~mem2, fabs_float_#t~union3, fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, fabs_float_~x, fabs_float_~ix~0;fabs_float_~x := fabs_float_#in~x;havoc fabs_float_~ix~0; {332#(= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x)} is VALID [2020-07-28 17:53:04,937 INFO L280 TraceCheckUtils]: 2: Hoare triple {332#(= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x)} call fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fabs_float_~x, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, 4bv32);call fabs_float_#t~mem0 := read~intINTTYPE4(fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, 4bv32);fabs_float_~ix~0 := fabs_float_#t~mem0;call write~intFLOATTYPE4(fabs_float_#t~union1, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, 4bv32);havoc fabs_float_#t~union1;havoc fabs_float_#t~mem0;call ULTIMATE.dealloc(fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset);havoc fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset; {336#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 30 23) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 22 0) ULTIMATE.start_fabs_float_~ix~0)))} is VALID [2020-07-28 17:53:04,941 INFO L280 TraceCheckUtils]: 3: Hoare triple {336#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 30 23) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 22 0) ULTIMATE.start_fabs_float_~ix~0)))} goto; {336#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 30 23) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 22 0) ULTIMATE.start_fabs_float_~ix~0)))} is VALID [2020-07-28 17:53:04,944 INFO L280 TraceCheckUtils]: 4: Hoare triple {336#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 30 23) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 22 0) ULTIMATE.start_fabs_float_~ix~0)))} call fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483647bv32, fabs_float_~ix~0), fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, 4bv32);call fabs_float_#t~mem2 := read~intFLOATTYPE4(fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, 4bv32);fabs_float_~x := fabs_float_#t~mem2;call write~intINTTYPE4(fabs_float_#t~union3, fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, 4bv32);havoc fabs_float_#t~union3;havoc fabs_float_#t~mem2;call ULTIMATE.dealloc(fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset);havoc fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset; {332#(= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x)} is VALID [2020-07-28 17:53:04,947 INFO L280 TraceCheckUtils]: 5: Hoare triple {332#(= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x)} goto; {332#(= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x)} is VALID [2020-07-28 17:53:04,949 INFO L280 TraceCheckUtils]: 6: Hoare triple {332#(= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x)} fabs_float_#res := fabs_float_~x; {349#(= (_ +zero 8 24) |ULTIMATE.start_fabs_float_#res|)} is VALID [2020-07-28 17:53:04,950 INFO L280 TraceCheckUtils]: 7: Hoare triple {349#(= (_ +zero 8 24) |ULTIMATE.start_fabs_float_#res|)} main_#t~ret6 := fabs_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~fp.eq~FLOAT(main_~res~0, ~Pluszero~FLOAT()); {353#(= (_ +zero 8 24) ULTIMATE.start_main_~res~0)} is VALID [2020-07-28 17:53:04,951 INFO L280 TraceCheckUtils]: 8: Hoare triple {353#(= (_ +zero 8 24) ULTIMATE.start_main_~res~0)} assume main_#t~short8;__signbit_float_#in~x := main_~res~0;havoc __signbit_float_#res;havoc __signbit_float_#t~mem4, __signbit_float_#t~union5, __signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset, __signbit_float_~x, __signbit_float_~w~0;__signbit_float_~x := __signbit_float_#in~x;havoc __signbit_float_~w~0; {357#(= (_ +zero 8 24) ULTIMATE.start___signbit_float_~x)} is VALID [2020-07-28 17:53:04,954 INFO L280 TraceCheckUtils]: 9: Hoare triple {357#(= (_ +zero 8 24) ULTIMATE.start___signbit_float_~x)} call __signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__signbit_float_~x, __signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset, 4bv32);call __signbit_float_#t~mem4 := read~intINTTYPE4(__signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset, 4bv32);__signbit_float_~w~0 := __signbit_float_#t~mem4;call write~intFLOATTYPE4(__signbit_float_#t~union5, __signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset, 4bv32);havoc __signbit_float_#t~mem4;havoc __signbit_float_#t~union5;call ULTIMATE.dealloc(__signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset);havoc __signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset; {361#(= (fp ((_ extract 31 31) ULTIMATE.start___signbit_float_~w~0) ((_ extract 30 23) ULTIMATE.start___signbit_float_~w~0) ((_ extract 22 0) ULTIMATE.start___signbit_float_~w~0)) (_ +zero 8 24))} is VALID [2020-07-28 17:53:04,955 INFO L280 TraceCheckUtils]: 10: Hoare triple {361#(= (fp ((_ extract 31 31) ULTIMATE.start___signbit_float_~w~0) ((_ extract 30 23) ULTIMATE.start___signbit_float_~w~0) ((_ extract 22 0) ULTIMATE.start___signbit_float_~w~0)) (_ +zero 8 24))} goto; {361#(= (fp ((_ extract 31 31) ULTIMATE.start___signbit_float_~w~0) ((_ extract 30 23) ULTIMATE.start___signbit_float_~w~0) ((_ extract 22 0) ULTIMATE.start___signbit_float_~w~0)) (_ +zero 8 24))} is VALID [2020-07-28 17:53:04,957 INFO L280 TraceCheckUtils]: 11: Hoare triple {361#(= (fp ((_ extract 31 31) ULTIMATE.start___signbit_float_~w~0) ((_ extract 30 23) ULTIMATE.start___signbit_float_~w~0) ((_ extract 22 0) ULTIMATE.start___signbit_float_~w~0)) (_ +zero 8 24))} __signbit_float_#res := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~0) then 1bv32 else 0bv32); {368#(= |ULTIMATE.start___signbit_float_#res| (_ bv0 32))} is VALID [2020-07-28 17:53:04,962 INFO L280 TraceCheckUtils]: 12: Hoare triple {368#(= |ULTIMATE.start___signbit_float_#res| (_ bv0 32))} main_#t~ret7 := __signbit_float_#res;main_#t~short8 := 0bv32 == main_#t~ret7; {372#|ULTIMATE.start_main_#t~short8|} is VALID [2020-07-28 17:53:04,966 INFO L280 TraceCheckUtils]: 13: Hoare triple {372#|ULTIMATE.start_main_#t~short8|} assume !main_#t~short8;havoc main_#t~short8;havoc main_#t~ret7; {325#false} is VALID [2020-07-28 17:53:04,967 INFO L280 TraceCheckUtils]: 14: Hoare triple {325#false} assume !false; {325#false} is VALID [2020-07-28 17:53:04,968 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:53:04,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:53:05,483 INFO L280 TraceCheckUtils]: 14: Hoare triple {325#false} assume !false; {325#false} is VALID [2020-07-28 17:53:05,484 INFO L280 TraceCheckUtils]: 13: Hoare triple {372#|ULTIMATE.start_main_#t~short8|} assume !main_#t~short8;havoc main_#t~short8;havoc main_#t~ret7; {325#false} is VALID [2020-07-28 17:53:05,485 INFO L280 TraceCheckUtils]: 12: Hoare triple {368#(= |ULTIMATE.start___signbit_float_#res| (_ bv0 32))} main_#t~ret7 := __signbit_float_#res;main_#t~short8 := 0bv32 == main_#t~ret7; {372#|ULTIMATE.start_main_#t~short8|} is VALID [2020-07-28 17:53:05,486 INFO L280 TraceCheckUtils]: 11: Hoare triple {388#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_float_~w~0))} __signbit_float_#res := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_float_~w~0) then 1bv32 else 0bv32); {368#(= |ULTIMATE.start___signbit_float_#res| (_ bv0 32))} is VALID [2020-07-28 17:53:05,486 INFO L280 TraceCheckUtils]: 10: Hoare triple {388#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_float_~w~0))} goto; {388#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_float_~w~0))} is VALID [2020-07-28 17:53:05,489 INFO L280 TraceCheckUtils]: 9: Hoare triple {395#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) ULTIMATE.start___signbit_float_~x)) (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32))))} call __signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__signbit_float_~x, __signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset, 4bv32);call __signbit_float_#t~mem4 := read~intINTTYPE4(__signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset, 4bv32);__signbit_float_~w~0 := __signbit_float_#t~mem4;call write~intFLOATTYPE4(__signbit_float_#t~union5, __signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset, 4bv32);havoc __signbit_float_#t~mem4;havoc __signbit_float_#t~union5;call ULTIMATE.dealloc(__signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset);havoc __signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset; {388#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_float_~w~0))} is VALID [2020-07-28 17:53:05,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {399#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) ULTIMATE.start_main_~res~0))))} assume main_#t~short8;__signbit_float_#in~x := main_~res~0;havoc __signbit_float_#res;havoc __signbit_float_#t~mem4, __signbit_float_#t~union5, __signbit_float_~#gf_u~1.base, __signbit_float_~#gf_u~1.offset, __signbit_float_~x, __signbit_float_~w~0;__signbit_float_~x := __signbit_float_#in~x;havoc __signbit_float_~w~0; {395#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) ULTIMATE.start___signbit_float_~x)) (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32))))} is VALID [2020-07-28 17:53:05,496 INFO L280 TraceCheckUtils]: 7: Hoare triple {403#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) |ULTIMATE.start_fabs_float_#res|))))} main_#t~ret6 := fabs_float_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~fp.eq~FLOAT(main_~res~0, ~Pluszero~FLOAT()); {399#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) ULTIMATE.start_main_~res~0))))} is VALID [2020-07-28 17:53:05,497 INFO L280 TraceCheckUtils]: 6: Hoare triple {407#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) ULTIMATE.start_fabs_float_~x))))} fabs_float_#res := fabs_float_~x; {403#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) |ULTIMATE.start_fabs_float_#res|))))} is VALID [2020-07-28 17:53:05,498 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) ULTIMATE.start_fabs_float_~x))))} goto; {407#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) ULTIMATE.start_fabs_float_~x))))} is VALID [2020-07-28 17:53:05,499 INFO L280 TraceCheckUtils]: 4: Hoare triple {414#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 30 23) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 22 0) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)))))))} call fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483647bv32, fabs_float_~ix~0), fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, 4bv32);call fabs_float_#t~mem2 := read~intFLOATTYPE4(fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, 4bv32);fabs_float_~x := fabs_float_#t~mem2;call write~intINTTYPE4(fabs_float_#t~union3, fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, 4bv32);havoc fabs_float_#t~union3;havoc fabs_float_#t~mem2;call ULTIMATE.dealloc(fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset);havoc fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset; {407#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) ULTIMATE.start_fabs_float_~x))))} is VALID [2020-07-28 17:53:05,500 INFO L280 TraceCheckUtils]: 3: Hoare triple {414#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 30 23) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 22 0) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)))))))} goto; {414#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 30 23) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 22 0) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)))))))} is VALID [2020-07-28 17:53:05,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {421#(forall ((v_ULTIMATE.start_fabs_float_~ix~0_7 (_ BitVec 32)) (v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= ULTIMATE.start_fabs_float_~x (fp ((_ extract 31 31) v_ULTIMATE.start_fabs_float_~ix~0_7) ((_ extract 30 23) v_ULTIMATE.start_fabs_float_~ix~0_7) ((_ extract 22 0) v_ULTIMATE.start_fabs_float_~ix~0_7)))) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) v_ULTIMATE.start_fabs_float_~ix~0_7)) ((_ extract 30 23) (bvand (_ bv2147483647 32) v_ULTIMATE.start_fabs_float_~ix~0_7)) ((_ extract 22 0) (bvand (_ bv2147483647 32) v_ULTIMATE.start_fabs_float_~ix~0_7)))))))} call fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fabs_float_~x, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, 4bv32);call fabs_float_#t~mem0 := read~intINTTYPE4(fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, 4bv32);fabs_float_~ix~0 := fabs_float_#t~mem0;call write~intFLOATTYPE4(fabs_float_#t~union1, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, 4bv32);havoc fabs_float_#t~union1;havoc fabs_float_#t~mem0;call ULTIMATE.dealloc(fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset);havoc fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset; {414#(forall ((v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 30 23) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)) ((_ extract 22 0) (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_float_~ix~0)))))))} is VALID [2020-07-28 17:53:05,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {324#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~FLOAT();fabs_float_#in~x := main_~x~0;havoc fabs_float_#res;havoc fabs_float_#t~mem0, fabs_float_#t~union1, fabs_float_~#gf_u~0.base, fabs_float_~#gf_u~0.offset, fabs_float_#t~mem2, fabs_float_#t~union3, fabs_float_~#sf_u~0.base, fabs_float_~#sf_u~0.offset, fabs_float_~x, fabs_float_~ix~0;fabs_float_~x := fabs_float_#in~x;havoc fabs_float_~ix~0; {421#(forall ((v_ULTIMATE.start_fabs_float_~ix~0_7 (_ BitVec 32)) (v_ULTIMATE.start___signbit_float_~w~0_5 (_ BitVec 32))) (or (= (bvand (_ bv2147483648 32) v_ULTIMATE.start___signbit_float_~w~0_5) (_ bv0 32)) (not (= ULTIMATE.start_fabs_float_~x (fp ((_ extract 31 31) v_ULTIMATE.start_fabs_float_~ix~0_7) ((_ extract 30 23) v_ULTIMATE.start_fabs_float_~ix~0_7) ((_ extract 22 0) v_ULTIMATE.start_fabs_float_~ix~0_7)))) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 30 23) v_ULTIMATE.start___signbit_float_~w~0_5) ((_ extract 22 0) v_ULTIMATE.start___signbit_float_~w~0_5)) (fp ((_ extract 31 31) (bvand (_ bv2147483647 32) v_ULTIMATE.start_fabs_float_~ix~0_7)) ((_ extract 30 23) (bvand (_ bv2147483647 32) v_ULTIMATE.start_fabs_float_~ix~0_7)) ((_ extract 22 0) (bvand (_ bv2147483647 32) v_ULTIMATE.start_fabs_float_~ix~0_7)))))))} is VALID [2020-07-28 17:53:05,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {324#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {324#true} is VALID [2020-07-28 17:53:05,509 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:53:05,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390663099] [2020-07-28 17:53:05,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:53:05,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 11] imperfect sequences [] total 17 [2020-07-28 17:53:05,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625491259] [2020-07-28 17:53:05,511 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-07-28 17:53:05,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:53:05,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-28 17:53:05,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:05,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-28 17:53:05,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:53:05,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-28 17:53:05,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-07-28 17:53:05,609 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 17 states. [2020-07-28 17:53:06,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:06,258 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:53:06,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 17:53:06,258 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-07-28 17:53:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:53:06,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 17:53:06,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2020-07-28 17:53:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 17:53:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2020-07-28 17:53:06,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 15 transitions. [2020-07-28 17:53:06,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:53:06,298 INFO L225 Difference]: With dead ends: 16 [2020-07-28 17:53:06,298 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:53:06,299 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2020-07-28 17:53:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:53:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:53:06,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:53:06,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:53:06,300 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:53:06,300 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:53:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:06,301 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:53:06,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:53:06,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:06,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:06,302 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:53:06,302 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:53:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:53:06,302 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:53:06,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:53:06,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:06,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:53:06,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:53:06,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:53:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:53:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:53:06,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-07-28 17:53:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:53:06,304 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:53:06,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-28 17:53:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:53:06,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:53:06,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:53:06,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:53:06,657 INFO L268 CegarLoopResult]: For program point L19(lines 19 23) no Hoare annotation was computed. [2020-07-28 17:53:06,657 INFO L268 CegarLoopResult]: For program point L19-1(lines 12 25) no Hoare annotation was computed. [2020-07-28 17:53:06,657 INFO L268 CegarLoopResult]: For program point L19-2(lines 19 23) no Hoare annotation was computed. [2020-07-28 17:53:06,658 INFO L264 CegarLoopResult]: At program point L36(lines 27 37) the Hoare annotation is: (and (= (_ +zero 8 24) |ULTIMATE.start_fabs_float_#res|) (= (fp ((_ extract 31 31) ULTIMATE.start___signbit_float_~w~0) ((_ extract 30 23) ULTIMATE.start___signbit_float_~w~0) ((_ extract 22 0) ULTIMATE.start___signbit_float_~w~0)) (_ +zero 8 24)) (= (_ +zero 8 24) ULTIMATE.start_main_~res~0) (= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x) |ULTIMATE.start_main_#t~short8| (= (_ +zero 8 24) ULTIMATE.start___signbit_float_~x) (= |ULTIMATE.start___signbit_float_#res| (_ bv0 32)) (= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 30 23) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 22 0) ULTIMATE.start_fabs_float_~ix~0)))) [2020-07-28 17:53:06,658 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:53:06,658 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:53:06,658 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:53:06,658 INFO L264 CegarLoopResult]: At program point L24(lines 12 25) the Hoare annotation is: (and (= (_ +zero 8 24) |ULTIMATE.start_fabs_float_#res|) (= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x) (= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 30 23) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 22 0) ULTIMATE.start_fabs_float_~ix~0)))) [2020-07-28 17:53:06,659 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2020-07-28 17:53:06,659 INFO L268 CegarLoopResult]: For program point L49(line 49) no Hoare annotation was computed. [2020-07-28 17:53:06,659 INFO L268 CegarLoopResult]: For program point L49-2(lines 49 52) no Hoare annotation was computed. [2020-07-28 17:53:06,660 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:53:06,660 INFO L271 CegarLoopResult]: At program point L54(lines 39 55) the Hoare annotation is: true [2020-07-28 17:53:06,660 INFO L268 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-07-28 17:53:06,660 INFO L268 CegarLoopResult]: For program point L30-1(lines 30 34) no Hoare annotation was computed. [2020-07-28 17:53:06,660 INFO L264 CegarLoopResult]: At program point L30-2(lines 30 34) the Hoare annotation is: (and (= (_ +zero 8 24) |ULTIMATE.start_fabs_float_#res|) (= (_ +zero 8 24) ULTIMATE.start_main_~res~0) (= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x) |ULTIMATE.start_main_#t~short8| (= (_ +zero 8 24) ULTIMATE.start___signbit_float_~x) (= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 30 23) ULTIMATE.start_fabs_float_~ix~0) ((_ extract 22 0) ULTIMATE.start_fabs_float_~ix~0)))) [2020-07-28 17:53:06,660 INFO L268 CegarLoopResult]: For program point L30-3(lines 30 34) no Hoare annotation was computed. [2020-07-28 17:53:06,661 INFO L268 CegarLoopResult]: For program point L14-1(lines 14 18) no Hoare annotation was computed. [2020-07-28 17:53:06,661 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 18) the Hoare annotation is: (= (_ +zero 8 24) ULTIMATE.start_fabs_float_~x) [2020-07-28 17:53:06,668 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:53:06,668 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:53:06,668 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-28 17:53:06,669 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 17:53:06,669 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-28 17:53:06,669 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-28 17:53:06,669 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 17:53:06,670 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 17:53:06,670 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 17:53:06,670 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-28 17:53:06,670 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2020-07-28 17:53:06,670 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-28 17:53:06,671 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-28 17:53:06,671 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-28 17:53:06,671 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-28 17:53:06,671 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 17:53:06,671 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-28 17:53:06,672 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-28 17:53:06,672 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-28 17:53:06,672 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-28 17:53:06,672 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-28 17:53:06,673 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 17:53:06,673 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 17:53:06,673 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:53:06,673 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-28 17:53:06,674 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:53:06,674 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:53:06,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:53:06 BoogieIcfgContainer [2020-07-28 17:53:06,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:53:06,711 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:53:06,712 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:53:06,712 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:53:06,716 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:53:02" (3/4) ... [2020-07-28 17:53:06,722 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 17:53:06,731 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-07-28 17:53:06,731 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 17:53:06,732 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 17:53:06,773 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:53:06,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:53:06,777 INFO L168 Benchmark]: Toolchain (without parser) took 4991.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 960.2 MB in the beginning and 823.5 MB in the end (delta: 136.7 MB). Peak memory consumption was 283.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:06,777 INFO L168 Benchmark]: CDTParser took 0.26 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:53:06,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:06,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.55 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:06,779 INFO L168 Benchmark]: Boogie Preprocessor took 38.20 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:53:06,781 INFO L168 Benchmark]: RCFGBuilder took 489.48 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: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:06,781 INFO L168 Benchmark]: TraceAbstraction took 3880.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 823.5 MB in the end (delta: 285.7 MB). Peak memory consumption was 285.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:53:06,782 INFO L168 Benchmark]: Witness Printer took 62.31 ms. Allocated memory is still 1.2 GB. Free memory is still 823.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:53:06,786 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.26 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 419.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.55 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.20 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 489.48 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: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3880.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 823.5 MB in the end (delta: 285.7 MB). Peak memory consumption was 285.7 MB. Max. memory is 11.5 GB. * Witness Printer took 62.31 ms. Allocated memory is still 1.2 GB. Free memory is still 823.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((~Pluszero~LONGDOUBLE() == \result && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == x) && aux-res == 0.0f && __signbit_float(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == x) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(ix[31:31], ix[30:23], ix[22:0]) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == \result && ~Pluszero~LONGDOUBLE() == x) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(ix[31:31], ix[30:23], ix[22:0]) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((~Pluszero~LONGDOUBLE() == \result && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == x) && aux-res == 0.0f && __signbit_float(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == x) && \result == 0bv32) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(ix[31:31], ix[30:23], ix[22:0]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.6s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 34 SDtfs, 101 SDslu, 44 SDs, 0 SdLazy, 62 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 78 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 64 ConstructedInterpolants, 8 QuantifiedInterpolants, 4540 SizeOfPredicates, 22 NumberOfNonLiveVariables, 104 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...