./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1052d.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/double_req_bl_1052d.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 204277589f1e9105606b7fb7cfd8af760c5fd585 ........................................................................................................................................................................................................................................................................................................................................ 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/double_req_bl_1052d.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 204277589f1e9105606b7fb7cfd8af760c5fd585 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:42:26,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:42:26,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:42:26,761 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:42:26,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:42:26,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:42:26,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:42:26,779 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:42:26,781 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:42:26,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:42:26,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:42:26,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:42:26,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:42:26,785 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:42:26,786 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:42:26,787 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:42:26,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:42:26,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:42:26,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:42:26,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:42:26,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:42:26,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:42:26,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:42:26,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:42:26,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:42:26,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:42:26,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:42:26,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:42:26,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:42:26,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:42:26,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:42:26,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:42:26,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:42:26,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:42:26,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:42:26,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:42:26,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:42:26,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:42:26,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:42:26,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:42:26,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:42:26,810 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:42:26,825 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:42:26,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:42:26,826 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:42:26,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:42:26,827 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:42:26,827 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:42:26,827 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:42:26,828 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:42:26,828 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:42:26,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:42:26,828 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:42:26,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:42:26,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:42:26,829 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:42:26,829 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:42:26,829 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:42:26,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:42:26,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:42:26,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:42:26,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:42:26,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:42:26,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:42:26,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:42:26,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:42:26,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:42:26,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:42:26,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:42:26,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:42:26,832 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:42:26,833 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 -> 204277589f1e9105606b7fb7cfd8af760c5fd585 [2020-07-28 17:42:27,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:42:27,149 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:42:27,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:42:27,155 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:42:27,155 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:42:27,156 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1052d.c [2020-07-28 17:42:27,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ef251c3c/bcb13e099bda4557ba676d595abbcb31/FLAGac0bac85b [2020-07-28 17:42:27,644 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:42:27,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052d.c [2020-07-28 17:42:27,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ef251c3c/bcb13e099bda4557ba676d595abbcb31/FLAGac0bac85b [2020-07-28 17:42:28,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ef251c3c/bcb13e099bda4557ba676d595abbcb31 [2020-07-28 17:42:28,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:42:28,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:42:28,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:28,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:42:28,070 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:42:28,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:28" (1/1) ... [2020-07-28 17:42:28,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35fffd82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:28, skipping insertion in model container [2020-07-28 17:42:28,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:28" (1/1) ... [2020-07-28 17:42:28,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:42:28,118 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:42:28,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:28,328 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:42:28,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:28,535 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:42:28,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:28 WrapperNode [2020-07-28 17:42:28,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:28,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:28,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:42:28,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:42:28,549 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:42:28" (1/1) ... [2020-07-28 17:42:28,584 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:42:28" (1/1) ... [2020-07-28 17:42:28,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:28,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:42:28,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:42:28,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:42:28,664 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:28" (1/1) ... [2020-07-28 17:42:28,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:28" (1/1) ... [2020-07-28 17:42:28,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:28" (1/1) ... [2020-07-28 17:42:28,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:28" (1/1) ... [2020-07-28 17:42:28,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:28" (1/1) ... [2020-07-28 17:42:28,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:28" (1/1) ... [2020-07-28 17:42:28,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:28" (1/1) ... [2020-07-28 17:42:28,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:42:28,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:42:28,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:42:28,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:42:28,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:28" (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:42:28,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 17:42:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:42:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:42:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:42:28,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:42:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:42:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:42:28,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:42:29,388 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:42:29,389 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:42:29,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:29 BoogieIcfgContainer [2020-07-28 17:42:29,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:42:29,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:42:29,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:42:29,398 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:42:29,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:42:28" (1/3) ... [2020-07-28 17:42:29,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72de5a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:29, skipping insertion in model container [2020-07-28 17:42:29,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:28" (2/3) ... [2020-07-28 17:42:29,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72de5a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:29, skipping insertion in model container [2020-07-28 17:42:29,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:29" (3/3) ... [2020-07-28 17:42:29,402 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052d.c [2020-07-28 17:42:29,413 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:42:29,421 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:42:29,437 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:42:29,463 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:42:29,463 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:42:29,464 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:42:29,464 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:42:29,464 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:42:29,464 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:42:29,465 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:42:29,465 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:42:29,483 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-28 17:42:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:42:29,490 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:29,491 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:29,492 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:29,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2020-07-28 17:42:29,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:42:29,511 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765470990] [2020-07-28 17:42:29,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:42:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:29,668 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~huge_floor~0 := 1.0E300; {41#true} is VALID [2020-07-28 17:42:29,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := 0.0;floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {41#true} is VALID [2020-07-28 17:42:29,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#true} assume !true; {42#false} is VALID [2020-07-28 17:42:29,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#false} floor_double_~j0~0 := ~bitwiseAnd(floor_double_~i0~0 / 1048576, 2047) - 1023; {42#false} is VALID [2020-07-28 17:42:29,672 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#false} assume floor_double_~j0~0 < 20; {42#false} is VALID [2020-07-28 17:42:29,672 INFO L280 TraceCheckUtils]: 5: Hoare triple {42#false} assume !(floor_double_~j0~0 < 0);floor_double_~i~0 := ~shiftRight(1048575, floor_double_~j0~0); {42#false} is VALID [2020-07-28 17:42:29,673 INFO L280 TraceCheckUtils]: 6: Hoare triple {42#false} assume 0 == ~bitwiseOr(~bitwiseAnd(floor_double_~i0~0, floor_double_~i~0), floor_double_~i1~0) % 4294967296;floor_double_#res := floor_double_~x; {42#false} is VALID [2020-07-28 17:42:29,673 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); {42#false} is VALID [2020-07-28 17:42:29,674 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#false} assume !main_#t~short10; {42#false} is VALID [2020-07-28 17:42:29,674 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#false} assume !main_#t~short10;havoc main_#t~ret9;havoc main_#t~short10; {42#false} is VALID [2020-07-28 17:42:29,675 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-28 17:42:29,678 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:42:29,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765470990] [2020-07-28 17:42:29,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:29,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:42:29,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005214005] [2020-07-28 17:42:29,688 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:29,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:29,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:42:29,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:29,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:42:29,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:42:29,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:42:29,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:42:29,734 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2020-07-28 17:42:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:29,830 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2020-07-28 17:42:29,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:42:29,830 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:29,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2020-07-28 17:42:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:29,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2020-07-28 17:42:29,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 118 transitions. [2020-07-28 17:42:30,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:30,056 INFO L225 Difference]: With dead ends: 74 [2020-07-28 17:42:30,056 INFO L226 Difference]: Without dead ends: 35 [2020-07-28 17:42:30,060 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:42:30,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-28 17:42:30,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-28 17:42:30,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:30,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:30,101 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:30,101 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:30,106 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2020-07-28 17:42:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2020-07-28 17:42:30,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:30,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:30,108 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:30,108 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:30,112 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2020-07-28 17:42:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2020-07-28 17:42:30,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:30,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:30,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:30,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-28 17:42:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2020-07-28 17:42:30,118 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2020-07-28 17:42:30,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:30,119 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2020-07-28 17:42:30,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:42:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2020-07-28 17:42:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:42:30,120 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:30,121 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:30,121 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:42:30,121 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:30,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:30,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2020-07-28 17:42:30,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:42:30,123 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279787821] [2020-07-28 17:42:30,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:42:30,190 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:42:30,191 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:206) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 17:42:30,197 INFO L168 Benchmark]: Toolchain (without parser) took 2133.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -102.5 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:30,198 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:42:30,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 470.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -206.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:30,200 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:42:30,201 INFO L168 Benchmark]: Boogie Preprocessor took 74.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:30,203 INFO L168 Benchmark]: RCFGBuilder took 667.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:30,204 INFO L168 Benchmark]: TraceAbstraction took 799.98 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:30,208 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.37 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 470.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -206.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 112.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 667.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 799.98 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: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:42:32,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:42:32,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:42:32,170 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:42:32,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:42:32,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:42:32,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:42:32,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:42:32,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:42:32,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:42:32,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:42:32,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:42:32,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:42:32,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:42:32,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:42:32,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:42:32,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:42:32,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:42:32,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:42:32,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:42:32,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:42:32,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:42:32,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:42:32,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:42:32,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:42:32,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:42:32,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:42:32,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:42:32,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:42:32,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:42:32,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:42:32,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:42:32,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:42:32,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:42:32,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:42:32,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:42:32,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:42:32,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:42:32,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:42:32,232 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:42:32,233 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:42:32,234 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:42:32,249 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:42:32,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:42:32,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:42:32,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:42:32,251 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:42:32,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:42:32,252 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:42:32,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:42:32,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:42:32,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:42:32,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:42:32,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:42:32,253 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:42:32,253 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:42:32,253 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:42:32,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:42:32,254 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:42:32,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:42:32,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:42:32,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:42:32,255 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:42:32,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:42:32,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:42:32,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:42:32,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:42:32,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:42:32,256 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:42:32,256 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:42:32,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:42:32,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:42:32,257 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:42:32,257 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 -> 204277589f1e9105606b7fb7cfd8af760c5fd585 [2020-07-28 17:42:32,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:42:32,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:42:32,582 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:42:32,583 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:42:32,584 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:42:32,585 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1052d.c [2020-07-28 17:42:32,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a05a77c78/c6024413968d4660afd3387b66205ec0/FLAGcc949bc14 [2020-07-28 17:42:33,094 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:42:33,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1052d.c [2020-07-28 17:42:33,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a05a77c78/c6024413968d4660afd3387b66205ec0/FLAGcc949bc14 [2020-07-28 17:42:33,412 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a05a77c78/c6024413968d4660afd3387b66205ec0 [2020-07-28 17:42:33,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:42:33,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:42:33,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:33,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:42:33,425 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:42:33,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:33" (1/1) ... [2020-07-28 17:42:33,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e9afd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:33, skipping insertion in model container [2020-07-28 17:42:33,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:33" (1/1) ... [2020-07-28 17:42:33,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:42:33,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:42:33,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:33,670 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:42:33,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:33,821 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:42:33,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:33 WrapperNode [2020-07-28 17:42:33,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:33,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:33,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:42:33,826 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:42:33,838 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:42:33" (1/1) ... [2020-07-28 17:42:33,866 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:42:33" (1/1) ... [2020-07-28 17:42:33,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:33,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:42:33,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:42:33,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:42:33,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:33" (1/1) ... [2020-07-28 17:42:33,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:33" (1/1) ... [2020-07-28 17:42:33,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:33" (1/1) ... [2020-07-28 17:42:33,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:33" (1/1) ... [2020-07-28 17:42:33,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:33" (1/1) ... [2020-07-28 17:42:33,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:33" (1/1) ... [2020-07-28 17:42:33,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:33" (1/1) ... [2020-07-28 17:42:34,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:42:34,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:42:34,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:42:34,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:42:34,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:33" (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:42:34,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2020-07-28 17:42:34,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-07-28 17:42:34,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:42:34,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:42:34,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:42:34,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:42:34,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 17:42:34,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:42:35,708 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:42:35,709 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:42:35,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:35 BoogieIcfgContainer [2020-07-28 17:42:35,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:42:35,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:42:35,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:42:35,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:42:35,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:42:33" (1/3) ... [2020-07-28 17:42:35,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4978125a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:35, skipping insertion in model container [2020-07-28 17:42:35,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:33" (2/3) ... [2020-07-28 17:42:35,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4978125a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:35, skipping insertion in model container [2020-07-28 17:42:35,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:35" (3/3) ... [2020-07-28 17:42:35,720 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052d.c [2020-07-28 17:42:35,728 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:42:35,735 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:42:35,747 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:42:35,772 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:42:35,773 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:42:35,773 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:42:35,773 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:42:35,774 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:42:35,774 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:42:35,774 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:42:35,774 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:42:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-28 17:42:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:42:35,799 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:35,800 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:35,800 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:35,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:35,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1930029915, now seen corresponding path program 1 times [2020-07-28 17:42:35,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:35,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932063459] [2020-07-28 17:42:35,823 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:42:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:35,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:42:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:35,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:35,975 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {41#true} is VALID [2020-07-28 17:42:35,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {41#true} is VALID [2020-07-28 17:42:35,980 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#true} assume !true; {42#false} is VALID [2020-07-28 17:42:35,980 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#false} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {42#false} is VALID [2020-07-28 17:42:35,981 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#false} assume ~bvslt32(floor_double_~j0~0, 20bv32); {42#false} is VALID [2020-07-28 17:42:35,981 INFO L280 TraceCheckUtils]: 5: Hoare triple {42#false} assume !~bvslt32(floor_double_~j0~0, 0bv32);floor_double_~i~0 := ~bvashr32(1048575bv32, floor_double_~j0~0); {42#false} is VALID [2020-07-28 17:42:35,982 INFO L280 TraceCheckUtils]: 6: Hoare triple {42#false} assume 0bv32 == ~bvor32(~bvand32(floor_double_~i0~0, floor_double_~i~0), floor_double_~i1~0);floor_double_#res := floor_double_~x; {42#false} is VALID [2020-07-28 17:42:35,982 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {42#false} is VALID [2020-07-28 17:42:35,983 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#false} assume !main_#t~short10; {42#false} is VALID [2020-07-28 17:42:35,983 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#false} assume !main_#t~short10;havoc main_#t~ret9;havoc main_#t~short10; {42#false} is VALID [2020-07-28 17:42:35,983 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-28 17:42:35,987 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:42:35,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:36,014 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-28 17:42:36,014 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#false} assume !main_#t~short10;havoc main_#t~ret9;havoc main_#t~short10; {42#false} is VALID [2020-07-28 17:42:36,015 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#false} assume !main_#t~short10; {42#false} is VALID [2020-07-28 17:42:36,015 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {42#false} is VALID [2020-07-28 17:42:36,015 INFO L280 TraceCheckUtils]: 6: Hoare triple {42#false} assume 0bv32 == ~bvor32(~bvand32(floor_double_~i0~0, floor_double_~i~0), floor_double_~i1~0);floor_double_#res := floor_double_~x; {42#false} is VALID [2020-07-28 17:42:36,016 INFO L280 TraceCheckUtils]: 5: Hoare triple {42#false} assume !~bvslt32(floor_double_~j0~0, 0bv32);floor_double_~i~0 := ~bvashr32(1048575bv32, floor_double_~j0~0); {42#false} is VALID [2020-07-28 17:42:36,016 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#false} assume ~bvslt32(floor_double_~j0~0, 20bv32); {42#false} is VALID [2020-07-28 17:42:36,020 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#false} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {42#false} is VALID [2020-07-28 17:42:36,021 INFO L280 TraceCheckUtils]: 2: Hoare triple {41#true} assume !true; {42#false} is VALID [2020-07-28 17:42:36,022 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {41#true} is VALID [2020-07-28 17:42:36,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {41#true} is VALID [2020-07-28 17:42:36,023 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:42:36,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932063459] [2020-07-28 17:42:36,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:36,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:42:36,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805379314] [2020-07-28 17:42:36,034 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:36,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:36,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:42:36,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:36,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:42:36,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:36,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:42:36,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:42:36,092 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2020-07-28 17:42:37,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:37,112 INFO L93 Difference]: Finished difference Result 74 states and 118 transitions. [2020-07-28 17:42:37,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:42:37,113 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:37,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2020-07-28 17:42:37,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 118 transitions. [2020-07-28 17:42:37,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 118 transitions. [2020-07-28 17:42:37,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:37,752 INFO L225 Difference]: With dead ends: 74 [2020-07-28 17:42:37,753 INFO L226 Difference]: Without dead ends: 35 [2020-07-28 17:42:37,757 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:42:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-28 17:42:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-28 17:42:37,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:37,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:37,806 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:37,806 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:37,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:37,811 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2020-07-28 17:42:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2020-07-28 17:42:37,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:37,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:37,813 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:37,813 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-28 17:42:37,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:37,817 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2020-07-28 17:42:37,817 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2020-07-28 17:42:37,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:37,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:37,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:37,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-28 17:42:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2020-07-28 17:42:37,823 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 11 [2020-07-28 17:42:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:37,824 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2020-07-28 17:42:37,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:42:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2020-07-28 17:42:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:42:37,825 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:37,825 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:38,037 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:42:38,038 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:38,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:38,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1310108990, now seen corresponding path program 1 times [2020-07-28 17:42:38,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:38,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675958452] [2020-07-28 17:42:38,041 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:42:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:38,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 17:42:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:38,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:38,336 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {298#true} is VALID [2020-07-28 17:42:38,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {306#(= (_ +zero 11 53) ULTIMATE.start_floor_double_~x)} is VALID [2020-07-28 17:42:38,344 INFO L280 TraceCheckUtils]: 2: Hoare triple {306#(= (_ +zero 11 53) ULTIMATE.start_floor_double_~x)} call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);call floor_double_#t~mem0 := read~intINTTYPE4(floor_double_~#ew_u~0.base, ~bvadd32(4bv32, floor_double_~#ew_u~0.offset), 4bv32);floor_double_~i0~0 := floor_double_#t~mem0;call write~intFLOATTYPE8(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union1;havoc floor_double_#t~mem0;call floor_double_#t~mem2 := read~intINTTYPE4(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4bv32);floor_double_~i1~0 := floor_double_#t~mem2;call write~intFLOATTYPE8(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; {310#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_floor_double_~i0~0)))} is VALID [2020-07-28 17:42:38,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {310#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_floor_double_~i0~0)))} goto; {310#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_floor_double_~i0~0)))} is VALID [2020-07-28 17:42:38,351 INFO L280 TraceCheckUtils]: 4: Hoare triple {310#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_floor_double_~i0~0)))} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {317#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= (bvadd ULTIMATE.start_floor_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))))))} is VALID [2020-07-28 17:42:38,352 INFO L280 TraceCheckUtils]: 5: Hoare triple {317#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= (bvadd ULTIMATE.start_floor_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))))))} assume ~bvslt32(floor_double_~j0~0, 20bv32); {317#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= (bvadd ULTIMATE.start_floor_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))))))} is VALID [2020-07-28 17:42:38,356 INFO L280 TraceCheckUtils]: 6: Hoare triple {317#(exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= (bvadd ULTIMATE.start_floor_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))))))} assume !~bvslt32(floor_double_~j0~0, 0bv32);floor_double_~i~0 := ~bvashr32(1048575bv32, floor_double_~j0~0); {299#false} is VALID [2020-07-28 17:42:38,356 INFO L280 TraceCheckUtils]: 7: Hoare triple {299#false} assume 0bv32 == ~bvor32(~bvand32(floor_double_~i0~0, floor_double_~i~0), floor_double_~i1~0);floor_double_#res := floor_double_~x; {299#false} is VALID [2020-07-28 17:42:38,357 INFO L280 TraceCheckUtils]: 8: Hoare triple {299#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {299#false} is VALID [2020-07-28 17:42:38,357 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#false} assume !main_#t~short10; {299#false} is VALID [2020-07-28 17:42:38,358 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#false} assume !main_#t~short10;havoc main_#t~ret9;havoc main_#t~short10; {299#false} is VALID [2020-07-28 17:42:38,358 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-28 17:42:38,365 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:42:38,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:38,525 INFO L280 TraceCheckUtils]: 11: Hoare triple {299#false} assume !false; {299#false} is VALID [2020-07-28 17:42:38,525 INFO L280 TraceCheckUtils]: 10: Hoare triple {299#false} assume !main_#t~short10;havoc main_#t~ret9;havoc main_#t~short10; {299#false} is VALID [2020-07-28 17:42:38,525 INFO L280 TraceCheckUtils]: 9: Hoare triple {299#false} assume !main_#t~short10; {299#false} is VALID [2020-07-28 17:42:38,526 INFO L280 TraceCheckUtils]: 8: Hoare triple {299#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {299#false} is VALID [2020-07-28 17:42:38,526 INFO L280 TraceCheckUtils]: 7: Hoare triple {299#false} assume 0bv32 == ~bvor32(~bvand32(floor_double_~i0~0, floor_double_~i~0), floor_double_~i1~0);floor_double_#res := floor_double_~x; {299#false} is VALID [2020-07-28 17:42:38,528 INFO L280 TraceCheckUtils]: 6: Hoare triple {354#(bvslt ULTIMATE.start_floor_double_~j0~0 (_ bv0 32))} assume !~bvslt32(floor_double_~j0~0, 0bv32);floor_double_~i~0 := ~bvashr32(1048575bv32, floor_double_~j0~0); {299#false} is VALID [2020-07-28 17:42:38,529 INFO L280 TraceCheckUtils]: 5: Hoare triple {354#(bvslt ULTIMATE.start_floor_double_~j0~0 (_ bv0 32))} assume ~bvslt32(floor_double_~j0~0, 20bv32); {354#(bvslt ULTIMATE.start_floor_double_~j0~0 (_ bv0 32))} is VALID [2020-07-28 17:42:38,532 INFO L280 TraceCheckUtils]: 4: Hoare triple {361#(bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_floor_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32))} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {354#(bvslt ULTIMATE.start_floor_double_~j0~0 (_ bv0 32))} is VALID [2020-07-28 17:42:38,533 INFO L280 TraceCheckUtils]: 3: Hoare triple {361#(bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_floor_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32))} goto; {361#(bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_floor_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32))} is VALID [2020-07-28 17:42:38,541 INFO L280 TraceCheckUtils]: 2: Hoare triple {368#(forall ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) ULTIMATE.start_floor_double_~x)) (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32))))} call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);call floor_double_#t~mem0 := read~intINTTYPE4(floor_double_~#ew_u~0.base, ~bvadd32(4bv32, floor_double_~#ew_u~0.offset), 4bv32);floor_double_~i0~0 := floor_double_#t~mem0;call write~intFLOATTYPE8(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union1;havoc floor_double_#t~mem0;call floor_double_#t~mem2 := read~intINTTYPE4(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4bv32);floor_double_~i1~0 := floor_double_#t~mem2;call write~intFLOATTYPE8(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; {361#(bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_floor_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32))} is VALID [2020-07-28 17:42:38,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {298#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {368#(forall ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) ULTIMATE.start_floor_double_~x)) (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (_ bv4294966273 32)) (_ bv0 32))))} is VALID [2020-07-28 17:42:38,546 INFO L280 TraceCheckUtils]: 0: Hoare triple {298#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {298#true} is VALID [2020-07-28 17:42:38,548 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:42:38,549 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675958452] [2020-07-28 17:42:38,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:38,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-07-28 17:42:38,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584610736] [2020-07-28 17:42:38,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-28 17:42:38,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:38,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 17:42:38,604 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:42:38,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 17:42:38,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:38,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 17:42:38,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:42:38,606 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand 8 states. [2020-07-28 17:42:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:39,476 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2020-07-28 17:42:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:42:39,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-28 17:42:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:39,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:42:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-28 17:42:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:42:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-28 17:42:39,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2020-07-28 17:42:39,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:39,850 INFO L225 Difference]: With dead ends: 47 [2020-07-28 17:42:39,850 INFO L226 Difference]: Without dead ends: 21 [2020-07-28 17:42:39,851 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-07-28 17:42:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-28 17:42:39,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-28 17:42:39,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:39,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:39,869 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:39,869 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:39,872 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 17:42:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-28 17:42:39,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:39,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:39,873 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:39,873 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:39,875 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2020-07-28 17:42:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-28 17:42:39,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:39,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:39,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:39,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:39,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 17:42:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-28 17:42:39,879 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2020-07-28 17:42:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:39,879 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-28 17:42:39,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 17:42:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-28 17:42:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:42:39,881 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:39,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:40,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:42:40,085 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:40,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:40,086 INFO L82 PathProgramCache]: Analyzing trace with hash -649381144, now seen corresponding path program 1 times [2020-07-28 17:42:40,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:40,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581954064] [2020-07-28 17:42:40,089 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:42:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:40,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 17:42:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:40,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:40,334 INFO L280 TraceCheckUtils]: 0: Hoare triple {501#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {506#(and (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} is VALID [2020-07-28 17:42:40,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {506#(and (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {510#(and (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} is VALID [2020-07-28 17:42:40,339 INFO L280 TraceCheckUtils]: 2: Hoare triple {510#(and (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);call floor_double_#t~mem0 := read~intINTTYPE4(floor_double_~#ew_u~0.base, ~bvadd32(4bv32, floor_double_~#ew_u~0.offset), 4bv32);floor_double_~i0~0 := floor_double_#t~mem0;call write~intFLOATTYPE8(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union1;havoc floor_double_#t~mem0;call floor_double_#t~mem2 := read~intINTTYPE4(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4bv32);floor_double_~i1~0 := floor_double_#t~mem2;call write~intFLOATTYPE8(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; {510#(and (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} is VALID [2020-07-28 17:42:40,340 INFO L280 TraceCheckUtils]: 3: Hoare triple {510#(and (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} goto; {510#(and (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} is VALID [2020-07-28 17:42:40,343 INFO L280 TraceCheckUtils]: 4: Hoare triple {510#(and (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {510#(and (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} is VALID [2020-07-28 17:42:40,353 INFO L280 TraceCheckUtils]: 5: Hoare triple {510#(and (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} assume ~bvslt32(floor_double_~j0~0, 20bv32); {510#(and (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} is VALID [2020-07-28 17:42:40,359 INFO L280 TraceCheckUtils]: 6: Hoare triple {510#(and (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} assume ~bvslt32(floor_double_~j0~0, 0bv32); {510#(and (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} is VALID [2020-07-28 17:42:40,362 INFO L280 TraceCheckUtils]: 7: Hoare triple {510#(and (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))} assume !~fp.gt~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~huge_floor~0, floor_double_~x), ~Pluszero~DOUBLE()); {502#false} is VALID [2020-07-28 17:42:40,362 INFO L280 TraceCheckUtils]: 8: Hoare triple {502#false} call floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(floor_double_~i0~0, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(floor_double_~i1~0, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call floor_double_#t~mem4 := read~intFLOATTYPE8(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 8bv32);floor_double_~x := floor_double_#t~mem4;call write~intINTTYPE4(floor_double_#t~union5.lsw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);havoc floor_double_#t~mem4;havoc floor_double_#t~union5.lsw, floor_double_#t~union5.msw;call ULTIMATE.dealloc(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset);havoc floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset; {502#false} is VALID [2020-07-28 17:42:40,362 INFO L280 TraceCheckUtils]: 9: Hoare triple {502#false} goto; {502#false} is VALID [2020-07-28 17:42:40,363 INFO L280 TraceCheckUtils]: 10: Hoare triple {502#false} floor_double_#res := floor_double_~x; {502#false} is VALID [2020-07-28 17:42:40,363 INFO L280 TraceCheckUtils]: 11: Hoare triple {502#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {502#false} is VALID [2020-07-28 17:42:40,366 INFO L280 TraceCheckUtils]: 12: Hoare triple {502#false} assume !main_#t~short10; {502#false} is VALID [2020-07-28 17:42:40,366 INFO L280 TraceCheckUtils]: 13: Hoare triple {502#false} assume !main_#t~short10;havoc main_#t~ret9;havoc main_#t~short10; {502#false} is VALID [2020-07-28 17:42:40,366 INFO L280 TraceCheckUtils]: 14: Hoare triple {502#false} assume !false; {502#false} is VALID [2020-07-28 17:42:40,368 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:42:40,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:41,243 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-07-28 17:42:41,916 INFO L280 TraceCheckUtils]: 14: Hoare triple {502#false} assume !false; {502#false} is VALID [2020-07-28 17:42:41,916 INFO L280 TraceCheckUtils]: 13: Hoare triple {502#false} assume !main_#t~short10;havoc main_#t~ret9;havoc main_#t~short10; {502#false} is VALID [2020-07-28 17:42:41,916 INFO L280 TraceCheckUtils]: 12: Hoare triple {502#false} assume !main_#t~short10; {502#false} is VALID [2020-07-28 17:42:41,917 INFO L280 TraceCheckUtils]: 11: Hoare triple {502#false} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {502#false} is VALID [2020-07-28 17:42:41,917 INFO L280 TraceCheckUtils]: 10: Hoare triple {502#false} floor_double_#res := floor_double_~x; {502#false} is VALID [2020-07-28 17:42:41,917 INFO L280 TraceCheckUtils]: 9: Hoare triple {502#false} goto; {502#false} is VALID [2020-07-28 17:42:41,917 INFO L280 TraceCheckUtils]: 8: Hoare triple {502#false} call floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(floor_double_~i0~0, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(floor_double_~i1~0, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call floor_double_#t~mem4 := read~intFLOATTYPE8(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 8bv32);floor_double_~x := floor_double_#t~mem4;call write~intINTTYPE4(floor_double_#t~union5.lsw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);havoc floor_double_#t~mem4;havoc floor_double_#t~union5.lsw, floor_double_#t~union5.msw;call ULTIMATE.dealloc(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset);havoc floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset; {502#false} is VALID [2020-07-28 17:42:41,918 INFO L280 TraceCheckUtils]: 7: Hoare triple {571#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} assume !~fp.gt~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~huge_floor~0, floor_double_~x), ~Pluszero~DOUBLE()); {502#false} is VALID [2020-07-28 17:42:41,919 INFO L280 TraceCheckUtils]: 6: Hoare triple {571#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} assume ~bvslt32(floor_double_~j0~0, 0bv32); {571#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} is VALID [2020-07-28 17:42:41,919 INFO L280 TraceCheckUtils]: 5: Hoare triple {571#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} assume ~bvslt32(floor_double_~j0~0, 20bv32); {571#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} is VALID [2020-07-28 17:42:41,920 INFO L280 TraceCheckUtils]: 4: Hoare triple {571#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {571#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} is VALID [2020-07-28 17:42:41,927 INFO L280 TraceCheckUtils]: 3: Hoare triple {571#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} goto; {571#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} is VALID [2020-07-28 17:42:41,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {571#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);call floor_double_#t~mem0 := read~intINTTYPE4(floor_double_~#ew_u~0.base, ~bvadd32(4bv32, floor_double_~#ew_u~0.offset), 4bv32);floor_double_~i0~0 := floor_double_#t~mem0;call write~intFLOATTYPE8(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union1;havoc floor_double_#t~mem0;call floor_double_#t~mem2 := read~intINTTYPE4(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4bv32);floor_double_~i1~0 := floor_double_#t~mem2;call write~intFLOATTYPE8(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; {571#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} is VALID [2020-07-28 17:42:41,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {590#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 (_ +zero 11 53)) (_ +zero 11 53))} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {571#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 ULTIMATE.start_floor_double_~x) (_ +zero 11 53))} is VALID [2020-07-28 17:42:41,930 INFO L280 TraceCheckUtils]: 0: Hoare triple {501#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {590#(fp.gt (fp.add currentRoundingMode ~huge_floor~0 (_ +zero 11 53)) (_ +zero 11 53))} is VALID [2020-07-28 17:42:41,931 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:42:41,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581954064] [2020-07-28 17:42:41,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:41,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-07-28 17:42:41,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972786765] [2020-07-28 17:42:41,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-28 17:42:41,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:41,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:42:42,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:42,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:42:42,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:42:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:42:42,209 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2020-07-28 17:42:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:44,482 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2020-07-28 17:42:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:42:44,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-07-28 17:42:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:44,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:42:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-28 17:42:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:42:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2020-07-28 17:42:44,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2020-07-28 17:42:44,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:44,647 INFO L225 Difference]: With dead ends: 33 [2020-07-28 17:42:44,647 INFO L226 Difference]: Without dead ends: 21 [2020-07-28 17:42:44,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:42:44,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-28 17:42:44,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-28 17:42:44,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:44,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:44,667 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:44,667 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:44,669 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-28 17:42:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-28 17:42:44,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:44,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:44,670 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:44,670 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:44,672 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-28 17:42:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-28 17:42:44,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:44,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:44,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:44,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 17:42:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2020-07-28 17:42:44,674 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2020-07-28 17:42:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:44,675 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2020-07-28 17:42:44,675 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:42:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-28 17:42:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 17:42:44,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:44,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:44,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:42:44,887 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:44,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:44,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1381924140, now seen corresponding path program 1 times [2020-07-28 17:42:44,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:44,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672260659] [2020-07-28 17:42:44,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 17:42:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:45,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-28 17:42:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:45,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:45,110 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2020-07-28 17:42:45,117 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:42:45,121 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:45,122 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:42:45,125 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:45,125 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:42:45,126 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:15 [2020-07-28 17:42:45,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {700#true} is VALID [2020-07-28 17:42:45,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {700#true} is VALID [2020-07-28 17:42:45,183 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);call floor_double_#t~mem0 := read~intINTTYPE4(floor_double_~#ew_u~0.base, ~bvadd32(4bv32, floor_double_~#ew_u~0.offset), 4bv32);floor_double_~i0~0 := floor_double_#t~mem0;call write~intFLOATTYPE8(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union1;havoc floor_double_#t~mem0;call floor_double_#t~mem2 := read~intINTTYPE4(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4bv32);floor_double_~i1~0 := floor_double_#t~mem2;call write~intFLOATTYPE8(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; {700#true} is VALID [2020-07-28 17:42:45,184 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} goto; {700#true} is VALID [2020-07-28 17:42:45,185 INFO L280 TraceCheckUtils]: 4: Hoare triple {700#true} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {700#true} is VALID [2020-07-28 17:42:45,185 INFO L280 TraceCheckUtils]: 5: Hoare triple {700#true} assume ~bvslt32(floor_double_~j0~0, 20bv32); {700#true} is VALID [2020-07-28 17:42:45,185 INFO L280 TraceCheckUtils]: 6: Hoare triple {700#true} assume ~bvslt32(floor_double_~j0~0, 0bv32); {700#true} is VALID [2020-07-28 17:42:45,185 INFO L280 TraceCheckUtils]: 7: Hoare triple {700#true} assume ~fp.gt~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~huge_floor~0, floor_double_~x), ~Pluszero~DOUBLE()); {700#true} is VALID [2020-07-28 17:42:45,186 INFO L280 TraceCheckUtils]: 8: Hoare triple {700#true} assume ~bvsge32(floor_double_~i0~0, 0bv32);floor_double_~i1~0 := 0bv32;floor_double_~i0~0 := floor_double_~i1~0; {729#(and (= ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0) (= ULTIMATE.start_floor_double_~i1~0 (_ bv0 32)))} is VALID [2020-07-28 17:42:45,187 INFO L280 TraceCheckUtils]: 9: Hoare triple {729#(and (= ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0) (= ULTIMATE.start_floor_double_~i1~0 (_ bv0 32)))} call floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(floor_double_~i0~0, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(floor_double_~i1~0, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call floor_double_#t~mem4 := read~intFLOATTYPE8(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 8bv32);floor_double_~x := floor_double_#t~mem4;call write~intINTTYPE4(floor_double_#t~union5.lsw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);havoc floor_double_#t~mem4;havoc floor_double_#t~union5.lsw, floor_double_#t~union5.msw;call ULTIMATE.dealloc(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset);havoc floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset; {733#(= (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))) ULTIMATE.start_floor_double_~x)} is VALID [2020-07-28 17:42:45,188 INFO L280 TraceCheckUtils]: 10: Hoare triple {733#(= (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))) ULTIMATE.start_floor_double_~x)} goto; {733#(= (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))) ULTIMATE.start_floor_double_~x)} is VALID [2020-07-28 17:42:45,189 INFO L280 TraceCheckUtils]: 11: Hoare triple {733#(= (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))) ULTIMATE.start_floor_double_~x)} floor_double_#res := floor_double_~x; {740#(= |ULTIMATE.start_floor_double_#res| (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))))} is VALID [2020-07-28 17:42:45,190 INFO L280 TraceCheckUtils]: 12: Hoare triple {740#(= |ULTIMATE.start_floor_double_#res| (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))))} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {744#|ULTIMATE.start_main_#t~short10|} is VALID [2020-07-28 17:42:45,191 INFO L280 TraceCheckUtils]: 13: Hoare triple {744#|ULTIMATE.start_main_#t~short10|} assume !main_#t~short10; {701#false} is VALID [2020-07-28 17:42:45,191 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#false} assume !main_#t~short10;havoc main_#t~ret9;havoc main_#t~short10; {701#false} is VALID [2020-07-28 17:42:45,191 INFO L280 TraceCheckUtils]: 15: Hoare triple {701#false} assume !false; {701#false} is VALID [2020-07-28 17:42:45,192 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:42:45,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:45,256 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2020-07-28 17:42:45,263 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:42:45,267 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:45,268 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:42:45,273 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:45,273 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:42:45,273 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:15 [2020-07-28 17:42:45,341 INFO L280 TraceCheckUtils]: 15: Hoare triple {701#false} assume !false; {701#false} is VALID [2020-07-28 17:42:45,342 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#false} assume !main_#t~short10;havoc main_#t~ret9;havoc main_#t~short10; {701#false} is VALID [2020-07-28 17:42:45,342 INFO L280 TraceCheckUtils]: 13: Hoare triple {744#|ULTIMATE.start_main_#t~short10|} assume !main_#t~short10; {701#false} is VALID [2020-07-28 17:42:45,343 INFO L280 TraceCheckUtils]: 12: Hoare triple {763#(fp.eq |ULTIMATE.start_floor_double_#res| (_ +zero 11 53))} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {744#|ULTIMATE.start_main_#t~short10|} is VALID [2020-07-28 17:42:45,343 INFO L280 TraceCheckUtils]: 11: Hoare triple {767#(fp.eq ULTIMATE.start_floor_double_~x (_ +zero 11 53))} floor_double_#res := floor_double_~x; {763#(fp.eq |ULTIMATE.start_floor_double_#res| (_ +zero 11 53))} is VALID [2020-07-28 17:42:45,344 INFO L280 TraceCheckUtils]: 10: Hoare triple {767#(fp.eq ULTIMATE.start_floor_double_~x (_ +zero 11 53))} goto; {767#(fp.eq ULTIMATE.start_floor_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:42:45,345 INFO L280 TraceCheckUtils]: 9: Hoare triple {774#(fp.eq (fp ((_ extract 63 63) (concat ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0)) ((_ extract 62 52) (concat ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0)) ((_ extract 51 0) (concat ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0))) (_ +zero 11 53))} call floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(floor_double_~i0~0, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(floor_double_~i1~0, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call floor_double_#t~mem4 := read~intFLOATTYPE8(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 8bv32);floor_double_~x := floor_double_#t~mem4;call write~intINTTYPE4(floor_double_#t~union5.lsw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);havoc floor_double_#t~mem4;havoc floor_double_#t~union5.lsw, floor_double_#t~union5.msw;call ULTIMATE.dealloc(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset);havoc floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset; {767#(fp.eq ULTIMATE.start_floor_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:42:45,346 INFO L280 TraceCheckUtils]: 8: Hoare triple {700#true} assume ~bvsge32(floor_double_~i0~0, 0bv32);floor_double_~i1~0 := 0bv32;floor_double_~i0~0 := floor_double_~i1~0; {774#(fp.eq (fp ((_ extract 63 63) (concat ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0)) ((_ extract 62 52) (concat ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0)) ((_ extract 51 0) (concat ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0))) (_ +zero 11 53))} is VALID [2020-07-28 17:42:45,346 INFO L280 TraceCheckUtils]: 7: Hoare triple {700#true} assume ~fp.gt~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~huge_floor~0, floor_double_~x), ~Pluszero~DOUBLE()); {700#true} is VALID [2020-07-28 17:42:45,346 INFO L280 TraceCheckUtils]: 6: Hoare triple {700#true} assume ~bvslt32(floor_double_~j0~0, 0bv32); {700#true} is VALID [2020-07-28 17:42:45,346 INFO L280 TraceCheckUtils]: 5: Hoare triple {700#true} assume ~bvslt32(floor_double_~j0~0, 20bv32); {700#true} is VALID [2020-07-28 17:42:45,346 INFO L280 TraceCheckUtils]: 4: Hoare triple {700#true} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {700#true} is VALID [2020-07-28 17:42:45,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#true} goto; {700#true} is VALID [2020-07-28 17:42:45,347 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#true} call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);call floor_double_#t~mem0 := read~intINTTYPE4(floor_double_~#ew_u~0.base, ~bvadd32(4bv32, floor_double_~#ew_u~0.offset), 4bv32);floor_double_~i0~0 := floor_double_#t~mem0;call write~intFLOATTYPE8(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union1;havoc floor_double_#t~mem0;call floor_double_#t~mem2 := read~intINTTYPE4(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4bv32);floor_double_~i1~0 := floor_double_#t~mem2;call write~intFLOATTYPE8(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; {700#true} is VALID [2020-07-28 17:42:45,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {700#true} is VALID [2020-07-28 17:42:45,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {700#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {700#true} is VALID [2020-07-28 17:42:45,348 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:42:45,349 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672260659] [2020-07-28 17:42:45,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:45,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-07-28 17:42:45,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904510084] [2020-07-28 17:42:45,350 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-07-28 17:42:45,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:45,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 17:42:45,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:45,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 17:42:45,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:45,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 17:42:45,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-28 17:42:45,416 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 9 states. [2020-07-28 17:42:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:46,206 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2020-07-28 17:42:46,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:42:46,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-07-28 17:42:46,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:42:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2020-07-28 17:42:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:42:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2020-07-28 17:42:46,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2020-07-28 17:42:46,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:46,296 INFO L225 Difference]: With dead ends: 24 [2020-07-28 17:42:46,296 INFO L226 Difference]: Without dead ends: 21 [2020-07-28 17:42:46,297 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-07-28 17:42:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-28 17:42:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-28 17:42:46,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:46,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:46,314 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:46,314 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:46,316 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-28 17:42:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-07-28 17:42:46,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:46,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:46,317 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:46,317 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:46,319 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-28 17:42:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-07-28 17:42:46,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:46,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:46,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:46,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 17:42:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2020-07-28 17:42:46,321 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 16 [2020-07-28 17:42:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:46,321 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2020-07-28 17:42:46,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 17:42:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2020-07-28 17:42:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 17:42:46,322 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:46,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:46,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 17:42:46,534 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:46,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:46,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2014843095, now seen corresponding path program 1 times [2020-07-28 17:42:46,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:46,536 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978030916] [2020-07-28 17:42:46,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-28 17:42:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:46,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-28 17:42:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:46,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:46,713 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2020-07-28 17:42:46,716 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:42:46,720 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:46,721 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:42:46,724 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:46,724 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:42:46,724 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:15 [2020-07-28 17:42:46,859 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:42:46,918 INFO L280 TraceCheckUtils]: 0: Hoare triple {902#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {902#true} is VALID [2020-07-28 17:42:46,918 INFO L280 TraceCheckUtils]: 1: Hoare triple {902#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {902#true} is VALID [2020-07-28 17:42:46,919 INFO L280 TraceCheckUtils]: 2: Hoare triple {902#true} call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);call floor_double_#t~mem0 := read~intINTTYPE4(floor_double_~#ew_u~0.base, ~bvadd32(4bv32, floor_double_~#ew_u~0.offset), 4bv32);floor_double_~i0~0 := floor_double_#t~mem0;call write~intFLOATTYPE8(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union1;havoc floor_double_#t~mem0;call floor_double_#t~mem2 := read~intINTTYPE4(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4bv32);floor_double_~i1~0 := floor_double_#t~mem2;call write~intFLOATTYPE8(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; {902#true} is VALID [2020-07-28 17:42:46,919 INFO L280 TraceCheckUtils]: 3: Hoare triple {902#true} goto; {902#true} is VALID [2020-07-28 17:42:46,919 INFO L280 TraceCheckUtils]: 4: Hoare triple {902#true} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {902#true} is VALID [2020-07-28 17:42:46,919 INFO L280 TraceCheckUtils]: 5: Hoare triple {902#true} assume ~bvslt32(floor_double_~j0~0, 20bv32); {902#true} is VALID [2020-07-28 17:42:46,919 INFO L280 TraceCheckUtils]: 6: Hoare triple {902#true} assume ~bvslt32(floor_double_~j0~0, 0bv32); {902#true} is VALID [2020-07-28 17:42:46,920 INFO L280 TraceCheckUtils]: 7: Hoare triple {902#true} assume ~fp.gt~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~huge_floor~0, floor_double_~x), ~Pluszero~DOUBLE()); {902#true} is VALID [2020-07-28 17:42:46,921 INFO L280 TraceCheckUtils]: 8: Hoare triple {902#true} assume ~bvsge32(floor_double_~i0~0, 0bv32);floor_double_~i1~0 := 0bv32;floor_double_~i0~0 := floor_double_~i1~0; {931#(and (= ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0) (= ULTIMATE.start_floor_double_~i1~0 (_ bv0 32)))} is VALID [2020-07-28 17:42:46,922 INFO L280 TraceCheckUtils]: 9: Hoare triple {931#(and (= ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0) (= ULTIMATE.start_floor_double_~i1~0 (_ bv0 32)))} call floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(floor_double_~i0~0, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(floor_double_~i1~0, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call floor_double_#t~mem4 := read~intFLOATTYPE8(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 8bv32);floor_double_~x := floor_double_#t~mem4;call write~intINTTYPE4(floor_double_#t~union5.lsw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);havoc floor_double_#t~mem4;havoc floor_double_#t~union5.lsw, floor_double_#t~union5.msw;call ULTIMATE.dealloc(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset);havoc floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset; {935#(= (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))) ULTIMATE.start_floor_double_~x)} is VALID [2020-07-28 17:42:46,923 INFO L280 TraceCheckUtils]: 10: Hoare triple {935#(= (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))) ULTIMATE.start_floor_double_~x)} goto; {935#(= (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))) ULTIMATE.start_floor_double_~x)} is VALID [2020-07-28 17:42:46,924 INFO L280 TraceCheckUtils]: 11: Hoare triple {935#(= (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))) ULTIMATE.start_floor_double_~x)} floor_double_#res := floor_double_~x; {942#(= |ULTIMATE.start_floor_double_#res| (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))))} is VALID [2020-07-28 17:42:46,941 INFO L280 TraceCheckUtils]: 12: Hoare triple {942#(= |ULTIMATE.start_floor_double_#res| (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))))} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {946#(= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))))} is VALID [2020-07-28 17:42:46,942 INFO L280 TraceCheckUtils]: 13: Hoare triple {946#(= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))))} assume main_#t~short10;__signbit_double_#in~x := main_~res~0;havoc __signbit_double_#res;havoc __signbit_double_#t~mem6, __signbit_double_#t~union7, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, __signbit_double_~x, __signbit_double_~msw~0;__signbit_double_~x := __signbit_double_#in~x;havoc __signbit_double_~msw~0; {950#(= (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))) ULTIMATE.start___signbit_double_~x)} is VALID [2020-07-28 17:42:46,946 INFO L280 TraceCheckUtils]: 14: Hoare triple {950#(= (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))) ULTIMATE.start___signbit_double_~x)} call __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__signbit_double_~x, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, 8bv32);call __signbit_double_#t~mem6 := read~intINTTYPE4(__signbit_double_~#gh_u~0.base, ~bvadd32(4bv32, __signbit_double_~#gh_u~0.offset), 4bv32);__signbit_double_~msw~0 := __signbit_double_#t~mem6;call write~intFLOATTYPE8(__signbit_double_#t~union7, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, 8bv32);havoc __signbit_double_#t~mem6;havoc __signbit_double_#t~union7;call ULTIMATE.dealloc(__signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset);havoc __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset; {954#(exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_3_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))))))} is VALID [2020-07-28 17:42:46,947 INFO L280 TraceCheckUtils]: 15: Hoare triple {954#(exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_3_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))))))} goto; {954#(exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_3_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))))))} is VALID [2020-07-28 17:42:46,950 INFO L280 TraceCheckUtils]: 16: Hoare triple {954#(exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_3_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 62 52) (concat (_ bv0 32) (_ bv0 32))) ((_ extract 51 0) (concat (_ bv0 32) (_ bv0 32)))))))} __signbit_double_#res := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_double_~msw~0) then 1bv32 else 0bv32); {961#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} is VALID [2020-07-28 17:42:46,951 INFO L280 TraceCheckUtils]: 17: Hoare triple {961#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} main_#t~ret9 := __signbit_double_#res;main_#t~short10 := 0bv32 == main_#t~ret9; {965#|ULTIMATE.start_main_#t~short10|} is VALID [2020-07-28 17:42:46,952 INFO L280 TraceCheckUtils]: 18: Hoare triple {965#|ULTIMATE.start_main_#t~short10|} assume !main_#t~short10;havoc main_#t~ret9;havoc main_#t~short10; {903#false} is VALID [2020-07-28 17:42:46,952 INFO L280 TraceCheckUtils]: 19: Hoare triple {903#false} assume !false; {903#false} is VALID [2020-07-28 17:42:46,954 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:42:46,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:47,263 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2020-07-28 17:42:47,269 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:42:47,274 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:47,274 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:42:47,283 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:47,284 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 17:42:47,285 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:29 [2020-07-28 17:42:47,387 INFO L280 TraceCheckUtils]: 19: Hoare triple {903#false} assume !false; {903#false} is VALID [2020-07-28 17:42:47,388 INFO L280 TraceCheckUtils]: 18: Hoare triple {965#|ULTIMATE.start_main_#t~short10|} assume !main_#t~short10;havoc main_#t~ret9;havoc main_#t~short10; {903#false} is VALID [2020-07-28 17:42:47,389 INFO L280 TraceCheckUtils]: 17: Hoare triple {961#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} main_#t~ret9 := __signbit_double_#res;main_#t~short10 := 0bv32 == main_#t~ret9; {965#|ULTIMATE.start_main_#t~short10|} is VALID [2020-07-28 17:42:47,390 INFO L280 TraceCheckUtils]: 16: Hoare triple {981#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0))} __signbit_double_#res := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_double_~msw~0) then 1bv32 else 0bv32); {961#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} is VALID [2020-07-28 17:42:47,391 INFO L280 TraceCheckUtils]: 15: Hoare triple {981#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0))} goto; {981#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0))} is VALID [2020-07-28 17:42:47,395 INFO L280 TraceCheckUtils]: 14: Hoare triple {988#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start___signbit_double_~x))))} call __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__signbit_double_~x, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, 8bv32);call __signbit_double_#t~mem6 := read~intINTTYPE4(__signbit_double_~#gh_u~0.base, ~bvadd32(4bv32, __signbit_double_~#gh_u~0.offset), 4bv32);__signbit_double_~msw~0 := __signbit_double_#t~mem6;call write~intFLOATTYPE8(__signbit_double_#t~union7, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, 8bv32);havoc __signbit_double_#t~mem6;havoc __signbit_double_#t~union7;call ULTIMATE.dealloc(__signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset);havoc __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset; {981#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0))} is VALID [2020-07-28 17:42:47,396 INFO L280 TraceCheckUtils]: 13: Hoare triple {992#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_main_~res~0)) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} assume main_#t~short10;__signbit_double_#in~x := main_~res~0;havoc __signbit_double_#res;havoc __signbit_double_#t~mem6, __signbit_double_#t~union7, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, __signbit_double_~x, __signbit_double_~msw~0;__signbit_double_~x := __signbit_double_#in~x;havoc __signbit_double_~msw~0; {988#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start___signbit_double_~x))))} is VALID [2020-07-28 17:42:47,398 INFO L280 TraceCheckUtils]: 12: Hoare triple {996#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) |ULTIMATE.start_floor_double_#res|)) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} main_#t~ret8 := floor_double_#res;main_~res~0 := main_#t~ret8;havoc main_#t~ret8;main_#t~short10 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {992#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_main_~res~0)) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} is VALID [2020-07-28 17:42:47,399 INFO L280 TraceCheckUtils]: 11: Hoare triple {1000#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_floor_double_~x)) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} floor_double_#res := floor_double_~x; {996#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) |ULTIMATE.start_floor_double_#res|)) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} is VALID [2020-07-28 17:42:47,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {1000#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_floor_double_~x)) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} goto; {1000#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_floor_double_~x)) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} is VALID [2020-07-28 17:42:47,401 INFO L280 TraceCheckUtils]: 9: Hoare triple {1007#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0)) ((_ extract 62 52) (concat ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0)) ((_ extract 51 0) (concat ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0))))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} call floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(floor_double_~i0~0, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(floor_double_~i1~0, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call floor_double_#t~mem4 := read~intFLOATTYPE8(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 8bv32);floor_double_~x := floor_double_#t~mem4;call write~intINTTYPE4(floor_double_#t~union5.lsw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, ~bvadd32(4bv32, floor_double_~#iw_u~0.offset), 4bv32);havoc floor_double_#t~mem4;havoc floor_double_#t~union5.lsw, floor_double_#t~union5.msw;call ULTIMATE.dealloc(floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset);havoc floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset; {1000#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_floor_double_~x)) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} is VALID [2020-07-28 17:42:47,403 INFO L280 TraceCheckUtils]: 8: Hoare triple {902#true} assume ~bvsge32(floor_double_~i0~0, 0bv32);floor_double_~i1~0 := 0bv32;floor_double_~i0~0 := floor_double_~i1~0; {1007#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0)) ((_ extract 62 52) (concat ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0)) ((_ extract 51 0) (concat ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0))))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} is VALID [2020-07-28 17:42:47,403 INFO L280 TraceCheckUtils]: 7: Hoare triple {902#true} assume ~fp.gt~DOUBLE(~fp.add~DOUBLE(currentRoundingMode, ~huge_floor~0, floor_double_~x), ~Pluszero~DOUBLE()); {902#true} is VALID [2020-07-28 17:42:47,404 INFO L280 TraceCheckUtils]: 6: Hoare triple {902#true} assume ~bvslt32(floor_double_~j0~0, 0bv32); {902#true} is VALID [2020-07-28 17:42:47,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {902#true} assume ~bvslt32(floor_double_~j0~0, 20bv32); {902#true} is VALID [2020-07-28 17:42:47,404 INFO L280 TraceCheckUtils]: 4: Hoare triple {902#true} floor_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(floor_double_~i0~0, 20bv32)), 1023bv32); {902#true} is VALID [2020-07-28 17:42:47,405 INFO L280 TraceCheckUtils]: 3: Hoare triple {902#true} goto; {902#true} is VALID [2020-07-28 17:42:47,405 INFO L280 TraceCheckUtils]: 2: Hoare triple {902#true} call floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(floor_double_~x, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);call floor_double_#t~mem0 := read~intINTTYPE4(floor_double_~#ew_u~0.base, ~bvadd32(4bv32, floor_double_~#ew_u~0.offset), 4bv32);floor_double_~i0~0 := floor_double_#t~mem0;call write~intFLOATTYPE8(floor_double_#t~union1, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union1;havoc floor_double_#t~mem0;call floor_double_#t~mem2 := read~intINTTYPE4(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 4bv32);floor_double_~i1~0 := floor_double_#t~mem2;call write~intFLOATTYPE8(floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, 8bv32);havoc floor_double_#t~union3;havoc floor_double_#t~mem2;call ULTIMATE.dealloc(floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset);havoc floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset; {902#true} is VALID [2020-07-28 17:42:47,405 INFO L280 TraceCheckUtils]: 1: Hoare triple {902#true} havoc main_#res;havoc main_#t~ret8, main_#t~ret9, main_#t~short10, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();floor_double_#in~x := main_~x~0;havoc floor_double_#res;havoc floor_double_#t~mem0, floor_double_#t~union1, floor_double_#t~mem2, floor_double_#t~union3, floor_double_~#ew_u~0.base, floor_double_~#ew_u~0.offset, floor_double_#t~mem4, floor_double_#t~union5.lsw, floor_double_#t~union5.msw, floor_double_~#iw_u~0.base, floor_double_~#iw_u~0.offset, floor_double_~x, floor_double_~i0~0, floor_double_~i1~0, floor_double_~j0~0, floor_double_~i~0, floor_double_~j~0;floor_double_~x := floor_double_#in~x;havoc floor_double_~i0~0;havoc floor_double_~i1~0;havoc floor_double_~j0~0;havoc floor_double_~i~0;havoc floor_double_~j~0; {902#true} is VALID [2020-07-28 17:42:47,405 INFO L280 TraceCheckUtils]: 0: Hoare triple {902#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~huge_floor~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E300); {902#true} is VALID [2020-07-28 17:42:47,407 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:42:47,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978030916] [2020-07-28 17:42:47,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:47,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2020-07-28 17:42:47,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803632853] [2020-07-28 17:42:47,408 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2020-07-28 17:42:47,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:47,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-28 17:42:47,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:47,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-28 17:42:47,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:47,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-28 17:42:47,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-07-28 17:42:47,521 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 16 states. [2020-07-28 17:42:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:49,301 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2020-07-28 17:42:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 17:42:49,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2020-07-28 17:42:49,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:42:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2020-07-28 17:42:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:42:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2020-07-28 17:42:49,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 20 transitions. [2020-07-28 17:42:49,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:49,389 INFO L225 Difference]: With dead ends: 21 [2020-07-28 17:42:49,389 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:42:49,390 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2020-07-28 17:42:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:42:49,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:42:49,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:49,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:49,390 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:49,390 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:49,391 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:42:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:42:49,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:49,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:49,391 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:49,392 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:49,392 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:42:49,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:42:49,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:49,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:49,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:49,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:42:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:42:49,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2020-07-28 17:42:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:49,393 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:42:49,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-28 17:42:49,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:42:49,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:49,594 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 17:42:49,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:42:49,853 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2020-07-28 17:42:50,037 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2020-07-28 17:42:50,305 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-07-28 17:42:50,313 INFO L268 CegarLoopResult]: For program point L27(lines 27 46) no Hoare annotation was computed. [2020-07-28 17:42:50,313 INFO L268 CegarLoopResult]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2020-07-28 17:42:50,313 INFO L264 CegarLoopResult]: At program point L19-2(lines 19 24) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) (= (_ +zero 11 53) ULTIMATE.start_floor_double_~x) (= currentRoundingMode roundNearestTiesToEven)) [2020-07-28 17:42:50,313 INFO L268 CegarLoopResult]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2020-07-28 17:42:50,314 INFO L268 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2020-07-28 17:42:50,314 INFO L268 CegarLoopResult]: For program point L102-2(lines 102 105) no Hoare annotation was computed. [2020-07-28 17:42:50,314 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:42:50,314 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:42:50,314 INFO L268 CegarLoopResult]: For program point L28(lines 28 35) no Hoare annotation was computed. [2020-07-28 17:42:50,314 INFO L268 CegarLoopResult]: For program point L103(line 103) no Hoare annotation was computed. [2020-07-28 17:42:50,314 INFO L268 CegarLoopResult]: For program point L70(lines 70 75) no Hoare annotation was computed. [2020-07-28 17:42:50,314 INFO L268 CegarLoopResult]: For program point L70-1(lines 16 77) no Hoare annotation was computed. [2020-07-28 17:42:50,314 INFO L268 CegarLoopResult]: For program point L70-2(lines 70 75) no Hoare annotation was computed. [2020-07-28 17:42:50,315 INFO L268 CegarLoopResult]: For program point L62(lines 62 63) no Hoare annotation was computed. [2020-07-28 17:42:50,315 INFO L268 CegarLoopResult]: For program point L29(lines 29 34) no Hoare annotation was computed. [2020-07-28 17:42:50,315 INFO L268 CegarLoopResult]: For program point L62-2(lines 62 63) no Hoare annotation was computed. [2020-07-28 17:42:50,315 INFO L268 CegarLoopResult]: For program point L54(lines 54 55) no Hoare annotation was computed. [2020-07-28 17:42:50,315 INFO L268 CegarLoopResult]: For program point L38(lines 38 39) no Hoare annotation was computed. [2020-07-28 17:42:50,315 INFO L264 CegarLoopResult]: At program point L88(lines 79 89) the Hoare annotation is: (let ((.cse0 (let ((.cse2 (concat (_ bv0 32) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (and (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= (bvadd ULTIMATE.start_floor_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32)))))) (= ULTIMATE.start_floor_double_~i0~0 ULTIMATE.start_floor_double_~i1~0) (= .cse0 ULTIMATE.start_floor_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_3_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (let ((.cse1 (concat (_ bv0 32) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (= .cse0 ULTIMATE.start___signbit_double_~x) |ULTIMATE.start_main_#t~short10| (= ~huge_floor~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) (= ULTIMATE.start_floor_double_~i1~0 (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start_floor_double_#res| .cse0))) [2020-07-28 17:42:50,316 INFO L268 CegarLoopResult]: For program point L47(lines 47 69) no Hoare annotation was computed. [2020-07-28 17:42:50,316 INFO L268 CegarLoopResult]: For program point L31(lines 31 34) no Hoare annotation was computed. [2020-07-28 17:42:50,316 INFO L268 CegarLoopResult]: For program point L56(lines 56 68) no Hoare annotation was computed. [2020-07-28 17:42:50,316 INFO L268 CegarLoopResult]: For program point L48(lines 48 51) no Hoare annotation was computed. [2020-07-28 17:42:50,316 INFO L268 CegarLoopResult]: For program point L40(lines 40 45) no Hoare annotation was computed. [2020-07-28 17:42:50,316 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:42:50,316 INFO L268 CegarLoopResult]: For program point L57(lines 57 66) no Hoare annotation was computed. [2020-07-28 17:42:50,316 INFO L268 CegarLoopResult]: For program point L57-1(lines 57 66) no Hoare annotation was computed. [2020-07-28 17:42:50,316 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 103) no Hoare annotation was computed. [2020-07-28 17:42:50,318 INFO L268 CegarLoopResult]: For program point L82-1(lines 82 86) no Hoare annotation was computed. [2020-07-28 17:42:50,318 INFO L264 CegarLoopResult]: At program point L82-2(lines 82 86) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (concat (_ bv0 32) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= (bvadd ULTIMATE.start_floor_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32)))))) (= .cse0 ULTIMATE.start_floor_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (= .cse0 ULTIMATE.start___signbit_double_~x) |ULTIMATE.start_main_#t~short10| (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_floor_double_~i0~0))) (= ULTIMATE.start_floor_double_~i1~0 (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start_floor_double_#res| .cse0) (= ~huge_floor~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2020-07-28 17:42:50,318 INFO L268 CegarLoopResult]: For program point L82-3(lines 82 86) no Hoare annotation was computed. [2020-07-28 17:42:50,318 INFO L271 CegarLoopResult]: At program point L107(lines 91 108) the Hoare annotation is: true [2020-07-28 17:42:50,319 INFO L268 CegarLoopResult]: For program point L41(lines 41 42) no Hoare annotation was computed. [2020-07-28 17:42:50,319 INFO L268 CegarLoopResult]: For program point L41-2(lines 41 42) no Hoare annotation was computed. [2020-07-28 17:42:50,319 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:42:50,319 INFO L268 CegarLoopResult]: For program point L58(lines 58 65) no Hoare annotation was computed. [2020-07-28 17:42:50,319 INFO L268 CegarLoopResult]: For program point L26(lines 26 69) no Hoare annotation was computed. [2020-07-28 17:42:50,319 INFO L264 CegarLoopResult]: At program point L76(lines 16 77) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (concat (_ bv0 32) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (and (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= (bvadd ULTIMATE.start_floor_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32)))))) (= ~huge_floor~0 ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)) (= .cse0 ULTIMATE.start_floor_double_~x) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (_ +zero 11 53)) (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start_floor_double_~i0~0))) (= ULTIMATE.start_floor_double_~i1~0 (_ bv0 32)) (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start_floor_double_#res| .cse0))) [2020-07-28 17:42:50,324 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:42:50,324 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:42:50,324 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 17:42:50,324 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-28 17:42:50,324 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 17:42:50,324 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2020-07-28 17:42:50,325 WARN L170 areAnnotationChecker]: L19-3 has no Hoare annotation [2020-07-28 17:42:50,325 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 17:42:50,325 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 17:42:50,325 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-28 17:42:50,325 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-28 17:42:50,325 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:42:50,325 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:42:50,325 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 17:42:50,325 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-28 17:42:50,325 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-28 17:42:50,326 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-28 17:42:50,326 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-28 17:42:50,326 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-28 17:42:50,326 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-28 17:42:50,326 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-28 17:42:50,326 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:42:50,326 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:42:50,326 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2020-07-28 17:42:50,326 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2020-07-28 17:42:50,326 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-28 17:42:50,328 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:42:50,328 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-28 17:42:50,328 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-28 17:42:50,328 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-28 17:42:50,328 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:42:50,328 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:42:50,328 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-28 17:42:50,328 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-28 17:42:50,329 WARN L170 areAnnotationChecker]: L70-2 has no Hoare annotation [2020-07-28 17:42:50,329 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-28 17:42:50,329 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-28 17:42:50,329 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-28 17:42:50,329 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-28 17:42:50,329 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-28 17:42:50,329 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-28 17:42:50,329 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-28 17:42:50,329 WARN L170 areAnnotationChecker]: L82-3 has no Hoare annotation [2020-07-28 17:42:50,329 WARN L170 areAnnotationChecker]: L102-2 has no Hoare annotation [2020-07-28 17:42:50,330 WARN L170 areAnnotationChecker]: L102-2 has no Hoare annotation [2020-07-28 17:42:50,330 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-28 17:42:50,330 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 17:42:50,330 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-28 17:42:50,330 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-28 17:42:50,330 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-28 17:42:50,330 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2020-07-28 17:42:50,330 WARN L170 areAnnotationChecker]: L82-3 has no Hoare annotation [2020-07-28 17:42:50,330 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2020-07-28 17:42:50,330 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2020-07-28 17:42:50,331 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:42:50,331 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-28 17:42:50,331 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-28 17:42:50,331 WARN L170 areAnnotationChecker]: L102-2 has no Hoare annotation [2020-07-28 17:42:50,331 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:42:50,331 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2020-07-28 17:42:50,331 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:42:50,337 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 17:42:50,348 INFO L168 Benchmark]: Toolchain (without parser) took 16923.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 952.2 MB in the beginning and 926.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 239.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:50,348 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:42:50,349 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:50,350 INFO L168 Benchmark]: Boogie Procedure Inliner took 99.93 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:42:50,350 INFO L168 Benchmark]: Boogie Preprocessor took 77.38 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:42:50,351 INFO L168 Benchmark]: RCFGBuilder took 1710.36 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: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:50,359 INFO L168 Benchmark]: TraceAbstraction took 14625.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 926.9 MB in the end (delta: 156.1 MB). Peak memory consumption was 230.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:50,367 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -176.7 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 99.93 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. * Boogie Preprocessor took 77.38 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 1710.36 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: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14625.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.9 MB). Free memory was 1.1 GB in the beginning and 926.9 MB in the end (delta: 156.1 MB). Peak memory consumption was 230.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 103]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...