./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1211b.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_1211b.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 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a ................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_1211b.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 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:43:17,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:43:17,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:43:17,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:43:17,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:43:17,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:43:17,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:43:17,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:43:17,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:43:17,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:43:17,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:43:17,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:43:17,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:43:17,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:43:17,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:43:17,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:43:17,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:43:17,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:43:17,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:43:17,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:43:17,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:43:17,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:43:17,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:43:17,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:43:17,762 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:43:17,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:43:17,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:43:17,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:43:17,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:43:17,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:43:17,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:43:17,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:43:17,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:43:17,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:43:17,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:43:17,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:43:17,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:43:17,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:43:17,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:43:17,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:43:17,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:43:17,774 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:43:17,790 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:43:17,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:43:17,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:43:17,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:43:17,792 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:43:17,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:43:17,793 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:43:17,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:43:17,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:43:17,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:43:17,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:43:17,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:43:17,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:43:17,794 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:43:17,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:43:17,795 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:43:17,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:43:17,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:43:17,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:43:17,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:43:17,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:43:17,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:43:17,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:43:17,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:43:17,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:43:17,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:43:17,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:43:17,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:43:17,798 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:43:17,798 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 -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2020-07-28 17:43:18,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:43:18,119 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:43:18,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:43:18,128 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:43:18,129 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:43:18,130 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2020-07-28 17:43:18,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013130578/fee6e04bf51b4083afd1f7ea8005f9ee/FLAG52e147336 [2020-07-28 17:43:18,643 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:43:18,644 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2020-07-28 17:43:18,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013130578/fee6e04bf51b4083afd1f7ea8005f9ee/FLAG52e147336 [2020-07-28 17:43:18,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/013130578/fee6e04bf51b4083afd1f7ea8005f9ee [2020-07-28 17:43:18,986 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:43:18,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:43:18,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:18,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:43:18,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:43:18,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:18" (1/1) ... [2020-07-28 17:43:19,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b917b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:18, skipping insertion in model container [2020-07-28 17:43:19,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:18" (1/1) ... [2020-07-28 17:43:19,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:43:19,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:43:19,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:19,331 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:43:19,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:19,551 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:43:19,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:19 WrapperNode [2020-07-28 17:43:19,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:19,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:19,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:43:19,554 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:43:19,566 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:43:19" (1/1) ... [2020-07-28 17:43:19,589 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:43:19" (1/1) ... [2020-07-28 17:43:19,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:19,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:43:19,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:43:19,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:43:19,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:19" (1/1) ... [2020-07-28 17:43:19,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:19" (1/1) ... [2020-07-28 17:43:19,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:19" (1/1) ... [2020-07-28 17:43:19,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:19" (1/1) ... [2020-07-28 17:43:19,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:19" (1/1) ... [2020-07-28 17:43:19,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:19" (1/1) ... [2020-07-28 17:43:19,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:19" (1/1) ... [2020-07-28 17:43:19,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:43:19,693 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:43:19,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:43:19,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:43:19,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:19" (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:43:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:43:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 17:43:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:43:19,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:43:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:43:19,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:43:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2020-07-28 17:43:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:43:19,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:43:20,633 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:43:20,633 INFO L295 CfgBuilder]: Removed 34 assume(true) statements. [2020-07-28 17:43:20,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:20 BoogieIcfgContainer [2020-07-28 17:43:20,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:43:20,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:43:20,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:43:20,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:43:20,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:43:18" (1/3) ... [2020-07-28 17:43:20,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb74e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:20, skipping insertion in model container [2020-07-28 17:43:20,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:19" (2/3) ... [2020-07-28 17:43:20,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eb74e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:20, skipping insertion in model container [2020-07-28 17:43:20,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:20" (3/3) ... [2020-07-28 17:43:20,649 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2020-07-28 17:43:20,660 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:43:20,668 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:43:20,683 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:43:20,714 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:43:20,714 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:43:20,714 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:43:20,714 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:43:20,715 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:43:20,715 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:43:20,715 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:43:20,715 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:43:20,735 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-07-28 17:43:20,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:43:20,744 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:20,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:20,746 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:20,753 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2020-07-28 17:43:20,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:20,765 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282951729] [2020-07-28 17:43:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:20,940 INFO L280 TraceCheckUtils]: 0: Hoare triple {55#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {55#true} is VALID [2020-07-28 17:43:20,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#true} havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0);call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(8);call write~init~real(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; {55#true} is VALID [2020-07-28 17:43:20,943 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#true} assume !true; {56#false} is VALID [2020-07-28 17:43:20,943 INFO L280 TraceCheckUtils]: 3: Hoare triple {56#false} modf_double_~j0~0 := ~bitwiseAnd(modf_double_~i0~0 / 1048576, 2047) - 1023; {56#false} is VALID [2020-07-28 17:43:20,944 INFO L280 TraceCheckUtils]: 4: Hoare triple {56#false} assume modf_double_~j0~0 < 20; {56#false} is VALID [2020-07-28 17:43:20,945 INFO L280 TraceCheckUtils]: 5: Hoare triple {56#false} assume modf_double_~j0~0 < 0; {56#false} is VALID [2020-07-28 17:43:20,945 INFO L280 TraceCheckUtils]: 6: Hoare triple {56#false} assume !true; {56#false} is VALID [2020-07-28 17:43:20,945 INFO L280 TraceCheckUtils]: 7: Hoare triple {56#false} modf_double_#res := modf_double_~x; {56#false} is VALID [2020-07-28 17:43:20,946 INFO L280 TraceCheckUtils]: 8: Hoare triple {56#false} main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~real(main_~#iptr~0.base, main_~#iptr~0.offset, 8);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {56#false} is VALID [2020-07-28 17:43:20,946 INFO L280 TraceCheckUtils]: 9: Hoare triple {56#false} assume !true; {56#false} is VALID [2020-07-28 17:43:20,947 INFO L280 TraceCheckUtils]: 10: Hoare triple {56#false} isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647);isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0;isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {56#false} is VALID [2020-07-28 17:43:20,948 INFO L280 TraceCheckUtils]: 11: Hoare triple {56#false} main_#t~ret30 := isinf_double_#res;assume -2147483648 <= main_#t~ret30 && main_#t~ret30 <= 2147483647;main_#t~short33 := 0 != main_#t~ret30; {56#false} is VALID [2020-07-28 17:43:20,949 INFO L280 TraceCheckUtils]: 12: Hoare triple {56#false} assume !main_#t~short33; {56#false} is VALID [2020-07-28 17:43:20,949 INFO L280 TraceCheckUtils]: 13: Hoare triple {56#false} assume main_#t~short33;havoc main_#t~mem29;havoc main_#t~short32;havoc main_#t~short33;havoc main_#t~ret30;havoc main_#t~ret31; {56#false} is VALID [2020-07-28 17:43:20,949 INFO L280 TraceCheckUtils]: 14: Hoare triple {56#false} assume !false; {56#false} is VALID [2020-07-28 17:43:20,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:43:20,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282951729] [2020-07-28 17:43:20,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:20,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:43:20,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330871944] [2020-07-28 17:43:20,966 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-28 17:43:20,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:20,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:43:21,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:21,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:43:21,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:43:21,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:43:21,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:43:21,035 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2020-07-28 17:43:21,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:21,163 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2020-07-28 17:43:21,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:43:21,164 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-28 17:43:21,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:21,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 164 transitions. [2020-07-28 17:43:21,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 164 transitions. [2020-07-28 17:43:21,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 164 transitions. [2020-07-28 17:43:21,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:21,458 INFO L225 Difference]: With dead ends: 102 [2020-07-28 17:43:21,459 INFO L226 Difference]: Without dead ends: 49 [2020-07-28 17:43:21,464 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:43:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-28 17:43:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-28 17:43:21,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:21,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:21,514 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:21,514 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:21,520 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-28 17:43:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-28 17:43:21,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:21,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:21,521 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:21,521 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:21,526 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-28 17:43:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-28 17:43:21,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:21,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:21,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:21,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-28 17:43:21,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2020-07-28 17:43:21,533 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2020-07-28 17:43:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:21,533 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2020-07-28 17:43:21,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:43:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-28 17:43:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 17:43:21,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:21,535 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:21,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:43:21,536 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:21,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:21,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2020-07-28 17:43:21,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:21,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388015734] [2020-07-28 17:43:21,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:21,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {346#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~one_modf~0 := 1.0; {346#true} is VALID [2020-07-28 17:43:21,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {346#true} havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0);call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(8);call write~init~real(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; {346#true} is VALID [2020-07-28 17:43:21,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {346#true} call modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(modf_double_~x, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8);call modf_double_#t~mem0 := read~int(modf_double_~#ew_u~0.base, 4 + modf_double_~#ew_u~0.offset, 4);modf_double_~i0~0 := (if modf_double_#t~mem0 % 4294967296 % 4294967296 <= 2147483647 then modf_double_#t~mem0 % 4294967296 % 4294967296 else modf_double_#t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(modf_double_#t~union1, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8);havoc modf_double_#t~mem0;havoc modf_double_#t~union1;call modf_double_#t~mem2 := read~int(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 4);modf_double_~i1~0 := (if modf_double_#t~mem2 % 4294967296 % 4294967296 <= 2147483647 then modf_double_#t~mem2 % 4294967296 % 4294967296 else modf_double_#t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8);havoc modf_double_#t~union3;havoc modf_double_#t~mem2;call ULTIMATE.dealloc(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset);havoc modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset; {346#true} is VALID [2020-07-28 17:43:21,690 INFO L280 TraceCheckUtils]: 3: Hoare triple {346#true} goto; {346#true} is VALID [2020-07-28 17:43:21,691 INFO L280 TraceCheckUtils]: 4: Hoare triple {346#true} modf_double_~j0~0 := ~bitwiseAnd(modf_double_~i0~0 / 1048576, 2047) - 1023; {346#true} is VALID [2020-07-28 17:43:21,691 INFO L280 TraceCheckUtils]: 5: Hoare triple {346#true} assume modf_double_~j0~0 < 20; {346#true} is VALID [2020-07-28 17:43:21,691 INFO L280 TraceCheckUtils]: 6: Hoare triple {346#true} assume modf_double_~j0~0 < 0; {346#true} is VALID [2020-07-28 17:43:21,692 INFO L280 TraceCheckUtils]: 7: Hoare triple {346#true} call modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8);call write~int(~bitwiseAnd(modf_double_~i0~0, 2147483648), modf_double_~#iw_u~0.base, 4 + modf_double_~#iw_u~0.offset, 4);call write~int(0, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, 4);call modf_double_#t~mem4 := read~real(modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, 8);call write~real(modf_double_#t~mem4, modf_double_~iptr.base, modf_double_~iptr.offset, 8);havoc modf_double_#t~mem4;call ULTIMATE.dealloc(modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset);havoc modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset; {346#true} is VALID [2020-07-28 17:43:21,692 INFO L280 TraceCheckUtils]: 8: Hoare triple {346#true} goto; {346#true} is VALID [2020-07-28 17:43:21,692 INFO L280 TraceCheckUtils]: 9: Hoare triple {346#true} modf_double_#res := modf_double_~x; {346#true} is VALID [2020-07-28 17:43:21,693 INFO L280 TraceCheckUtils]: 10: Hoare triple {346#true} main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~real(main_~#iptr~0.base, main_~#iptr~0.offset, 8);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {346#true} is VALID [2020-07-28 17:43:21,693 INFO L280 TraceCheckUtils]: 11: Hoare triple {346#true} call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.allocOnStack(8);call write~real(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8);call isinf_double_#t~mem21 := read~int(isinf_double_~#ew_u~1.base, 4 + isinf_double_~#ew_u~1.offset, 4);isinf_double_~hx~0 := (if isinf_double_#t~mem21 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem21 % 4294967296 % 4294967296 else isinf_double_#t~mem21 % 4294967296 % 4294967296 - 4294967296);call write~real(isinf_double_#t~union22, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8);havoc isinf_double_#t~union22;havoc isinf_double_#t~mem21;call isinf_double_#t~mem23 := read~int(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4);isinf_double_~lx~0 := (if isinf_double_#t~mem23 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem23 % 4294967296 % 4294967296 else isinf_double_#t~mem23 % 4294967296 % 4294967296 - 4294967296);call write~real(isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8);havoc isinf_double_#t~mem23;havoc isinf_double_#t~union24;call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset);havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; {346#true} is VALID [2020-07-28 17:43:21,699 INFO L280 TraceCheckUtils]: 12: Hoare triple {346#true} goto; {346#true} is VALID [2020-07-28 17:43:21,699 INFO L280 TraceCheckUtils]: 13: Hoare triple {346#true} isinf_double_~hx~0 := ~bitwiseAnd(isinf_double_~hx~0, 2147483647);isinf_double_~hx~0 := (if ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, ~bitwiseOr(isinf_double_~lx~0, -isinf_double_~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);isinf_double_~hx~0 := 2146435072 - isinf_double_~hx~0;isinf_double_#res := 1 - (if ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(isinf_double_~hx~0, -isinf_double_~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); {346#true} is VALID [2020-07-28 17:43:21,699 INFO L280 TraceCheckUtils]: 14: Hoare triple {346#true} main_#t~ret30 := isinf_double_#res;assume -2147483648 <= main_#t~ret30 && main_#t~ret30 <= 2147483647;main_#t~short33 := 0 != main_#t~ret30; {346#true} is VALID [2020-07-28 17:43:21,704 INFO L280 TraceCheckUtils]: 15: Hoare triple {346#true} assume !main_#t~short33; {348#(not |ULTIMATE.start_main_#t~short33|)} is VALID [2020-07-28 17:43:21,711 INFO L280 TraceCheckUtils]: 16: Hoare triple {348#(not |ULTIMATE.start_main_#t~short33|)} assume main_#t~short33;havoc main_#t~mem29;havoc main_#t~short32;havoc main_#t~short33;havoc main_#t~ret30;havoc main_#t~ret31; {347#false} is VALID [2020-07-28 17:43:21,711 INFO L280 TraceCheckUtils]: 17: Hoare triple {347#false} assume !false; {347#false} is VALID [2020-07-28 17:43:21,714 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:43:21,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388015734] [2020-07-28 17:43:21,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:21,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:43:21,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25638359] [2020-07-28 17:43:21,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-28 17:43:21,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:21,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:43:21,752 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:43:21,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:43:21,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:43:21,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:43:21,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:43:21,753 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 3 states. [2020-07-28 17:43:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:21,899 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2020-07-28 17:43:21,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:43:21,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-28 17:43:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:43:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2020-07-28 17:43:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:43:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2020-07-28 17:43:21,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2020-07-28 17:43:21,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:21,992 INFO L225 Difference]: With dead ends: 52 [2020-07-28 17:43:21,992 INFO L226 Difference]: Without dead ends: 49 [2020-07-28 17:43:21,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:43:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-28 17:43:22,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-28 17:43:22,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:22,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:22,006 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:22,006 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:22,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:22,010 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-28 17:43:22,010 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-07-28 17:43:22,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:22,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:22,012 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:22,012 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:22,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:22,016 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2020-07-28 17:43:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-07-28 17:43:22,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:22,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:22,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:22,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-28 17:43:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2020-07-28 17:43:22,021 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2020-07-28 17:43:22,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:22,021 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2020-07-28 17:43:22,022 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:43:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2020-07-28 17:43:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 17:43:22,023 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:22,023 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:43:22,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:43:22,023 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash 581418946, now seen corresponding path program 1 times [2020-07-28 17:43:22,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:22,025 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011511069] [2020-07-28 17:43:22,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:22,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:43:22,202 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:43:22,209 INFO L168 Benchmark]: Toolchain (without parser) took 3219.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 960.2 MB in the beginning and 961.0 MB in the end (delta: -812.9 kB). Peak memory consumption was 168.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:22,210 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:43:22,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 562.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -197.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:22,213 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.02 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:43:22,213 INFO L168 Benchmark]: Boogie Preprocessor took 51.87 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:43:22,215 INFO L168 Benchmark]: RCFGBuilder took 945.69 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:22,216 INFO L168 Benchmark]: TraceAbstraction took 1564.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 961.0 MB in the end (delta: 125.9 MB). Peak memory consumption was 125.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:22,227 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.73 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 562.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -197.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.02 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. * Boogie Preprocessor took 51.87 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. * RCFGBuilder took 945.69 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1564.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 961.0 MB in the end (delta: 125.9 MB). Peak memory consumption was 125.9 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:43:24,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:43:24,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:43:24,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:43:24,201 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:43:24,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:43:24,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:43:24,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:43:24,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:43:24,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:43:24,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:43:24,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:43:24,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:43:24,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:43:24,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:43:24,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:43:24,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:43:24,218 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:43:24,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:43:24,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:43:24,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:43:24,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:43:24,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:43:24,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:43:24,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:43:24,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:43:24,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:43:24,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:43:24,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:43:24,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:43:24,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:43:24,235 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:43:24,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:43:24,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:43:24,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:43:24,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:43:24,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:43:24,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:43:24,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:43:24,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:43:24,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:43:24,243 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:43:24,264 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:43:24,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:43:24,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:43:24,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:43:24,267 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:43:24,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:43:24,268 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:43:24,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:43:24,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:43:24,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:43:24,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:43:24,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:43:24,269 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:43:24,269 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:43:24,270 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:43:24,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:43:24,270 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:43:24,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:43:24,271 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:43:24,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:43:24,271 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:43:24,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:43:24,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:43:24,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:43:24,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:43:24,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:43:24,273 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:43:24,273 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:43:24,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:43:24,274 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:43:24,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:43:24,275 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 -> 74f3a1a5b01d98fb4c2f4ed92e174c29e400a21a [2020-07-28 17:43:24,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:43:24,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:43:24,610 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:43:24,612 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:43:24,613 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:43:24,614 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2020-07-28 17:43:24,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129260fe7/897874a570814bd696f308ea6893f59a/FLAGbfd79be14 [2020-07-28 17:43:25,125 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:43:25,126 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1211b.c [2020-07-28 17:43:25,134 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129260fe7/897874a570814bd696f308ea6893f59a/FLAGbfd79be14 [2020-07-28 17:43:25,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/129260fe7/897874a570814bd696f308ea6893f59a [2020-07-28 17:43:25,538 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:43:25,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:43:25,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:25,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:43:25,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:43:25,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:25" (1/1) ... [2020-07-28 17:43:25,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ac7a739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:25, skipping insertion in model container [2020-07-28 17:43:25,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:25" (1/1) ... [2020-07-28 17:43:25,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:43:25,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:43:25,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:25,907 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:43:25,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:26,001 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:43:26,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26 WrapperNode [2020-07-28 17:43:26,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:26,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:26,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:43:26,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:43:26,011 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:43:26" (1/1) ... [2020-07-28 17:43:26,026 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:43:26" (1/1) ... [2020-07-28 17:43:26,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:26,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:43:26,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:43:26,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:43:26,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26" (1/1) ... [2020-07-28 17:43:26,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26" (1/1) ... [2020-07-28 17:43:26,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26" (1/1) ... [2020-07-28 17:43:26,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26" (1/1) ... [2020-07-28 17:43:26,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26" (1/1) ... [2020-07-28 17:43:26,140 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26" (1/1) ... [2020-07-28 17:43:26,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26" (1/1) ... [2020-07-28 17:43:26,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:43:26,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:43:26,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:43:26,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:43:26,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26" (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:43:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2020-07-28 17:43:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-07-28 17:43:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:43:26,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2020-07-28 17:43:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:43:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:43:26,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:43:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 17:43:26,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:43:27,808 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:43:27,809 INFO L295 CfgBuilder]: Removed 34 assume(true) statements. [2020-07-28 17:43:27,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:27 BoogieIcfgContainer [2020-07-28 17:43:27,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:43:27,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:43:27,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:43:27,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:43:27,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:43:25" (1/3) ... [2020-07-28 17:43:27,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428caf21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:27, skipping insertion in model container [2020-07-28 17:43:27,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26" (2/3) ... [2020-07-28 17:43:27,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428caf21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:27, skipping insertion in model container [2020-07-28 17:43:27,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:27" (3/3) ... [2020-07-28 17:43:27,823 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211b.c [2020-07-28 17:43:27,833 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:43:27,840 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:43:27,854 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:43:27,876 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:43:27,876 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:43:27,876 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:43:27,876 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:43:27,876 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:43:27,877 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:43:27,877 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:43:27,877 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:43:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-07-28 17:43:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:43:27,897 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:27,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:27,899 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:27,905 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2020-07-28 17:43:27,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:27,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946480628] [2020-07-28 17:43:27,920 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:43:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:28,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:43:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:28,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:28,118 INFO L280 TraceCheckUtils]: 0: Hoare triple {55#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {55#true} is VALID [2020-07-28 17:43:28,118 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#true} havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~intFLOATTYPE8(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; {55#true} is VALID [2020-07-28 17:43:28,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#true} assume !true; {56#false} is VALID [2020-07-28 17:43:28,121 INFO L280 TraceCheckUtils]: 3: Hoare triple {56#false} modf_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(modf_double_~i0~0, 20bv32)), 1023bv32); {56#false} is VALID [2020-07-28 17:43:28,121 INFO L280 TraceCheckUtils]: 4: Hoare triple {56#false} assume ~bvslt32(modf_double_~j0~0, 20bv32); {56#false} is VALID [2020-07-28 17:43:28,122 INFO L280 TraceCheckUtils]: 5: Hoare triple {56#false} assume ~bvslt32(modf_double_~j0~0, 0bv32); {56#false} is VALID [2020-07-28 17:43:28,122 INFO L280 TraceCheckUtils]: 6: Hoare triple {56#false} assume !true; {56#false} is VALID [2020-07-28 17:43:28,123 INFO L280 TraceCheckUtils]: 7: Hoare triple {56#false} modf_double_#res := modf_double_~x; {56#false} is VALID [2020-07-28 17:43:28,123 INFO L280 TraceCheckUtils]: 8: Hoare triple {56#false} main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~intFLOATTYPE8(main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {56#false} is VALID [2020-07-28 17:43:28,123 INFO L280 TraceCheckUtils]: 9: Hoare triple {56#false} assume !true; {56#false} is VALID [2020-07-28 17:43:28,124 INFO L280 TraceCheckUtils]: 10: Hoare triple {56#false} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {56#false} is VALID [2020-07-28 17:43:28,125 INFO L280 TraceCheckUtils]: 11: Hoare triple {56#false} main_#t~ret30 := isinf_double_#res;main_#t~short33 := 0bv32 != main_#t~ret30; {56#false} is VALID [2020-07-28 17:43:28,125 INFO L280 TraceCheckUtils]: 12: Hoare triple {56#false} assume !main_#t~short33; {56#false} is VALID [2020-07-28 17:43:28,125 INFO L280 TraceCheckUtils]: 13: Hoare triple {56#false} assume main_#t~short33;havoc main_#t~ret30;havoc main_#t~ret31;havoc main_#t~mem29;havoc main_#t~short32;havoc main_#t~short33; {56#false} is VALID [2020-07-28 17:43:28,126 INFO L280 TraceCheckUtils]: 14: Hoare triple {56#false} assume !false; {56#false} is VALID [2020-07-28 17:43:28,130 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:43:28,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:28,157 INFO L280 TraceCheckUtils]: 14: Hoare triple {56#false} assume !false; {56#false} is VALID [2020-07-28 17:43:28,157 INFO L280 TraceCheckUtils]: 13: Hoare triple {56#false} assume main_#t~short33;havoc main_#t~ret30;havoc main_#t~ret31;havoc main_#t~mem29;havoc main_#t~short32;havoc main_#t~short33; {56#false} is VALID [2020-07-28 17:43:28,158 INFO L280 TraceCheckUtils]: 12: Hoare triple {56#false} assume !main_#t~short33; {56#false} is VALID [2020-07-28 17:43:28,158 INFO L280 TraceCheckUtils]: 11: Hoare triple {56#false} main_#t~ret30 := isinf_double_#res;main_#t~short33 := 0bv32 != main_#t~ret30; {56#false} is VALID [2020-07-28 17:43:28,158 INFO L280 TraceCheckUtils]: 10: Hoare triple {56#false} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {56#false} is VALID [2020-07-28 17:43:28,159 INFO L280 TraceCheckUtils]: 9: Hoare triple {56#false} assume !true; {56#false} is VALID [2020-07-28 17:43:28,159 INFO L280 TraceCheckUtils]: 8: Hoare triple {56#false} main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~intFLOATTYPE8(main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {56#false} is VALID [2020-07-28 17:43:28,159 INFO L280 TraceCheckUtils]: 7: Hoare triple {56#false} modf_double_#res := modf_double_~x; {56#false} is VALID [2020-07-28 17:43:28,160 INFO L280 TraceCheckUtils]: 6: Hoare triple {56#false} assume !true; {56#false} is VALID [2020-07-28 17:43:28,160 INFO L280 TraceCheckUtils]: 5: Hoare triple {56#false} assume ~bvslt32(modf_double_~j0~0, 0bv32); {56#false} is VALID [2020-07-28 17:43:28,160 INFO L280 TraceCheckUtils]: 4: Hoare triple {56#false} assume ~bvslt32(modf_double_~j0~0, 20bv32); {56#false} is VALID [2020-07-28 17:43:28,161 INFO L280 TraceCheckUtils]: 3: Hoare triple {56#false} modf_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(modf_double_~i0~0, 20bv32)), 1023bv32); {56#false} is VALID [2020-07-28 17:43:28,162 INFO L280 TraceCheckUtils]: 2: Hoare triple {55#true} assume !true; {56#false} is VALID [2020-07-28 17:43:28,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {55#true} havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~intFLOATTYPE8(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; {55#true} is VALID [2020-07-28 17:43:28,163 INFO L280 TraceCheckUtils]: 0: Hoare triple {55#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {55#true} is VALID [2020-07-28 17:43:28,164 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:43:28,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946480628] [2020-07-28 17:43:28,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:28,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:43:28,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44981410] [2020-07-28 17:43:28,173 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-28 17:43:28,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:28,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:43:28,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:28,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:43:28,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:28,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:43:28,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:43:28,237 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2020-07-28 17:43:29,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:29,043 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2020-07-28 17:43:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:43:29,044 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-07-28 17:43:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:29,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 164 transitions. [2020-07-28 17:43:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 164 transitions. [2020-07-28 17:43:29,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 164 transitions. [2020-07-28 17:43:29,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:29,776 INFO L225 Difference]: With dead ends: 102 [2020-07-28 17:43:29,777 INFO L226 Difference]: Without dead ends: 49 [2020-07-28 17:43:29,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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:43:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-28 17:43:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-28 17:43:29,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:29,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:29,822 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:29,822 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:29,826 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-28 17:43:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-28 17:43:29,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:29,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:29,828 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:29,828 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-28 17:43:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:29,832 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-28 17:43:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-28 17:43:29,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:29,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:29,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:29,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-28 17:43:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2020-07-28 17:43:29,838 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2020-07-28 17:43:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:29,838 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2020-07-28 17:43:29,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:43:29,839 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2020-07-28 17:43:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 17:43:29,840 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:29,840 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:30,049 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:43:30,049 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:30,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:30,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2020-07-28 17:43:30,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:30,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918539046] [2020-07-28 17:43:30,054 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:43:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:30,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 17:43:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:30,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:30,506 INFO L280 TraceCheckUtils]: 0: Hoare triple {430#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {430#true} is VALID [2020-07-28 17:43:30,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {430#true} havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~intFLOATTYPE8(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; {438#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:30,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {438#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} call modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);call modf_double_#t~mem0 := read~intINTTYPE4(modf_double_~#ew_u~0.base, ~bvadd32(4bv32, modf_double_~#ew_u~0.offset), 4bv32);modf_double_~i0~0 := modf_double_#t~mem0;call write~intFLOATTYPE8(modf_double_#t~union1, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem0;havoc modf_double_#t~union1;call modf_double_#t~mem2 := read~intINTTYPE4(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 4bv32);modf_double_~i1~0 := modf_double_#t~mem2;call write~intFLOATTYPE8(modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem2;havoc modf_double_#t~union3;call ULTIMATE.dealloc(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset);havoc modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset; {442#(exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))))} is VALID [2020-07-28 17:43:30,521 INFO L280 TraceCheckUtils]: 3: Hoare triple {442#(exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))))} goto; {442#(exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))))} is VALID [2020-07-28 17:43:30,527 INFO L280 TraceCheckUtils]: 4: Hoare triple {442#(exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))))} modf_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(modf_double_~i0~0, 20bv32)), 1023bv32); {449#(exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))))))} is VALID [2020-07-28 17:43:30,533 INFO L280 TraceCheckUtils]: 5: Hoare triple {449#(exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))))))} assume ~bvslt32(modf_double_~j0~0, 20bv32); {431#false} is VALID [2020-07-28 17:43:30,533 INFO L280 TraceCheckUtils]: 6: Hoare triple {431#false} assume ~bvslt32(modf_double_~j0~0, 0bv32); {431#false} is VALID [2020-07-28 17:43:30,534 INFO L280 TraceCheckUtils]: 7: Hoare triple {431#false} call modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_double_~i0~0), modf_double_~#iw_u~0.base, ~bvadd32(4bv32, modf_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(0bv32, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, 4bv32);call modf_double_#t~mem4 := read~intFLOATTYPE8(modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, 8bv32);call write~intFLOATTYPE8(modf_double_#t~mem4, modf_double_~iptr.base, modf_double_~iptr.offset, 8bv32);havoc modf_double_#t~mem4;call ULTIMATE.dealloc(modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset);havoc modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset; {431#false} is VALID [2020-07-28 17:43:30,534 INFO L280 TraceCheckUtils]: 8: Hoare triple {431#false} goto; {431#false} is VALID [2020-07-28 17:43:30,534 INFO L280 TraceCheckUtils]: 9: Hoare triple {431#false} modf_double_#res := modf_double_~x; {431#false} is VALID [2020-07-28 17:43:30,535 INFO L280 TraceCheckUtils]: 10: Hoare triple {431#false} main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~intFLOATTYPE8(main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {431#false} is VALID [2020-07-28 17:43:30,535 INFO L280 TraceCheckUtils]: 11: Hoare triple {431#false} call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);call isinf_double_#t~mem21 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, ~bvadd32(4bv32, isinf_double_~#ew_u~1.offset), 4bv32);isinf_double_~hx~0 := isinf_double_#t~mem21;call write~intFLOATTYPE8(isinf_double_#t~union22, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union22;havoc isinf_double_#t~mem21;call isinf_double_#t~mem23 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4bv32);isinf_double_~lx~0 := isinf_double_#t~mem23;call write~intFLOATTYPE8(isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union24;havoc isinf_double_#t~mem23;call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset);havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; {431#false} is VALID [2020-07-28 17:43:30,535 INFO L280 TraceCheckUtils]: 12: Hoare triple {431#false} goto; {431#false} is VALID [2020-07-28 17:43:30,536 INFO L280 TraceCheckUtils]: 13: Hoare triple {431#false} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {431#false} is VALID [2020-07-28 17:43:30,536 INFO L280 TraceCheckUtils]: 14: Hoare triple {431#false} main_#t~ret30 := isinf_double_#res;main_#t~short33 := 0bv32 != main_#t~ret30; {431#false} is VALID [2020-07-28 17:43:30,536 INFO L280 TraceCheckUtils]: 15: Hoare triple {431#false} assume !main_#t~short33; {431#false} is VALID [2020-07-28 17:43:30,537 INFO L280 TraceCheckUtils]: 16: Hoare triple {431#false} assume main_#t~short33;havoc main_#t~ret30;havoc main_#t~ret31;havoc main_#t~mem29;havoc main_#t~short32;havoc main_#t~short33; {431#false} is VALID [2020-07-28 17:43:30,537 INFO L280 TraceCheckUtils]: 17: Hoare triple {431#false} assume !false; {431#false} is VALID [2020-07-28 17:43:30,540 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:43:30,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:30,762 INFO L280 TraceCheckUtils]: 17: Hoare triple {431#false} assume !false; {431#false} is VALID [2020-07-28 17:43:30,762 INFO L280 TraceCheckUtils]: 16: Hoare triple {431#false} assume main_#t~short33;havoc main_#t~ret30;havoc main_#t~ret31;havoc main_#t~mem29;havoc main_#t~short32;havoc main_#t~short33; {431#false} is VALID [2020-07-28 17:43:30,763 INFO L280 TraceCheckUtils]: 15: Hoare triple {431#false} assume !main_#t~short33; {431#false} is VALID [2020-07-28 17:43:30,763 INFO L280 TraceCheckUtils]: 14: Hoare triple {431#false} main_#t~ret30 := isinf_double_#res;main_#t~short33 := 0bv32 != main_#t~ret30; {431#false} is VALID [2020-07-28 17:43:30,763 INFO L280 TraceCheckUtils]: 13: Hoare triple {431#false} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {431#false} is VALID [2020-07-28 17:43:30,763 INFO L280 TraceCheckUtils]: 12: Hoare triple {431#false} goto; {431#false} is VALID [2020-07-28 17:43:30,764 INFO L280 TraceCheckUtils]: 11: Hoare triple {431#false} call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);call isinf_double_#t~mem21 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, ~bvadd32(4bv32, isinf_double_~#ew_u~1.offset), 4bv32);isinf_double_~hx~0 := isinf_double_#t~mem21;call write~intFLOATTYPE8(isinf_double_#t~union22, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union22;havoc isinf_double_#t~mem21;call isinf_double_#t~mem23 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4bv32);isinf_double_~lx~0 := isinf_double_#t~mem23;call write~intFLOATTYPE8(isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union24;havoc isinf_double_#t~mem23;call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset);havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; {431#false} is VALID [2020-07-28 17:43:30,764 INFO L280 TraceCheckUtils]: 10: Hoare triple {431#false} main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~intFLOATTYPE8(main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {431#false} is VALID [2020-07-28 17:43:30,764 INFO L280 TraceCheckUtils]: 9: Hoare triple {431#false} modf_double_#res := modf_double_~x; {431#false} is VALID [2020-07-28 17:43:30,764 INFO L280 TraceCheckUtils]: 8: Hoare triple {431#false} goto; {431#false} is VALID [2020-07-28 17:43:30,765 INFO L280 TraceCheckUtils]: 7: Hoare triple {431#false} call modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_double_~i0~0), modf_double_~#iw_u~0.base, ~bvadd32(4bv32, modf_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(0bv32, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, 4bv32);call modf_double_#t~mem4 := read~intFLOATTYPE8(modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, 8bv32);call write~intFLOATTYPE8(modf_double_#t~mem4, modf_double_~iptr.base, modf_double_~iptr.offset, 8bv32);havoc modf_double_#t~mem4;call ULTIMATE.dealloc(modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset);havoc modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset; {431#false} is VALID [2020-07-28 17:43:30,765 INFO L280 TraceCheckUtils]: 6: Hoare triple {431#false} assume ~bvslt32(modf_double_~j0~0, 0bv32); {431#false} is VALID [2020-07-28 17:43:30,769 INFO L280 TraceCheckUtils]: 5: Hoare triple {525#(not (bvslt ULTIMATE.start_modf_double_~j0~0 (_ bv20 32)))} assume ~bvslt32(modf_double_~j0~0, 20bv32); {431#false} is VALID [2020-07-28 17:43:30,771 INFO L280 TraceCheckUtils]: 4: Hoare triple {529#(not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_modf_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))} modf_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(modf_double_~i0~0, 20bv32)), 1023bv32); {525#(not (bvslt ULTIMATE.start_modf_double_~j0~0 (_ bv20 32)))} is VALID [2020-07-28 17:43:30,772 INFO L280 TraceCheckUtils]: 3: Hoare triple {529#(not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_modf_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))} goto; {529#(not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_modf_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))} is VALID [2020-07-28 17:43:30,781 INFO L280 TraceCheckUtils]: 2: Hoare triple {536#(forall ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) ULTIMATE.start_modf_double_~x)) (not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))))} call modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);call modf_double_#t~mem0 := read~intINTTYPE4(modf_double_~#ew_u~0.base, ~bvadd32(4bv32, modf_double_~#ew_u~0.offset), 4bv32);modf_double_~i0~0 := modf_double_#t~mem0;call write~intFLOATTYPE8(modf_double_#t~union1, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem0;havoc modf_double_#t~union1;call modf_double_#t~mem2 := read~intINTTYPE4(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 4bv32);modf_double_~i1~0 := modf_double_#t~mem2;call write~intFLOATTYPE8(modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem2;havoc modf_double_#t~union3;call ULTIMATE.dealloc(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset);havoc modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset; {529#(not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ULTIMATE.start_modf_double_~i0~0 (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))} is VALID [2020-07-28 17:43:30,787 INFO L280 TraceCheckUtils]: 1: Hoare triple {430#true} havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~intFLOATTYPE8(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; {536#(forall ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) ULTIMATE.start_modf_double_~x)) (not (bvslt (bvadd (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (_ bv4294966273 32)) (_ bv20 32)))))} is VALID [2020-07-28 17:43:30,787 INFO L280 TraceCheckUtils]: 0: Hoare triple {430#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {430#true} is VALID [2020-07-28 17:43:30,788 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:43:30,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918539046] [2020-07-28 17:43:30,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:30,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-07-28 17:43:30,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159281181] [2020-07-28 17:43:30,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-28 17:43:30,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:30,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 17:43:30,874 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:43:30,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 17:43:30,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:30,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 17:43:30,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:43:30,875 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2020-07-28 17:43:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:33,449 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2020-07-28 17:43:33,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:43:33,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-28 17:43:33,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:43:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2020-07-28 17:43:33,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:43:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2020-07-28 17:43:33,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2020-07-28 17:43:34,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:34,035 INFO L225 Difference]: With dead ends: 64 [2020-07-28 17:43:34,035 INFO L226 Difference]: Without dead ends: 27 [2020-07-28 17:43:34,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-28 17:43:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-28 17:43:34,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-28 17:43:34,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:34,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:34,059 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:34,060 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:34,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:34,062 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-28 17:43:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-28 17:43:34,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:34,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:34,063 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:34,063 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:34,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:34,065 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-07-28 17:43:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-28 17:43:34,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:34,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:34,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:34,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:34,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-28 17:43:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-28 17:43:34,068 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2020-07-28 17:43:34,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:34,068 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-28 17:43:34,068 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 17:43:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-28 17:43:34,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 17:43:34,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:34,070 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:43:34,282 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:43:34,282 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:34,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:34,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1408426499, now seen corresponding path program 1 times [2020-07-28 17:43:34,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:34,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781885924] [2020-07-28 17:43:34,286 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:43:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:34,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 17:43:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:34,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:34,665 INFO L280 TraceCheckUtils]: 0: Hoare triple {717#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {717#true} is VALID [2020-07-28 17:43:34,666 INFO L280 TraceCheckUtils]: 1: Hoare triple {717#true} havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~intFLOATTYPE8(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; {717#true} is VALID [2020-07-28 17:43:34,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {717#true} call modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);call modf_double_#t~mem0 := read~intINTTYPE4(modf_double_~#ew_u~0.base, ~bvadd32(4bv32, modf_double_~#ew_u~0.offset), 4bv32);modf_double_~i0~0 := modf_double_#t~mem0;call write~intFLOATTYPE8(modf_double_#t~union1, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem0;havoc modf_double_#t~union1;call modf_double_#t~mem2 := read~intINTTYPE4(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 4bv32);modf_double_~i1~0 := modf_double_#t~mem2;call write~intFLOATTYPE8(modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem2;havoc modf_double_#t~union3;call ULTIMATE.dealloc(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset);havoc modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset; {717#true} is VALID [2020-07-28 17:43:34,667 INFO L280 TraceCheckUtils]: 3: Hoare triple {717#true} goto; {717#true} is VALID [2020-07-28 17:43:34,667 INFO L280 TraceCheckUtils]: 4: Hoare triple {717#true} modf_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(modf_double_~i0~0, 20bv32)), 1023bv32); {717#true} is VALID [2020-07-28 17:43:34,668 INFO L280 TraceCheckUtils]: 5: Hoare triple {717#true} assume !~bvslt32(modf_double_~j0~0, 20bv32); {717#true} is VALID [2020-07-28 17:43:34,668 INFO L280 TraceCheckUtils]: 6: Hoare triple {717#true} assume ~bvsgt32(modf_double_~j0~0, 51bv32);havoc modf_double_~high~1;call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, modf_double_~x, ~one_modf~0), modf_double_~iptr.base, modf_double_~iptr.offset, 8bv32); {717#true} is VALID [2020-07-28 17:43:34,668 INFO L280 TraceCheckUtils]: 7: Hoare triple {717#true} call modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, 8bv32);call modf_double_#t~mem11 := read~intINTTYPE4(modf_double_~#gh_u~1.base, ~bvadd32(4bv32, modf_double_~#gh_u~1.offset), 4bv32);modf_double_~high~1 := modf_double_#t~mem11;call write~intFLOATTYPE8(modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, 8bv32);havoc modf_double_#t~union12;havoc modf_double_#t~mem11;call ULTIMATE.dealloc(modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset);havoc modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset; {717#true} is VALID [2020-07-28 17:43:34,669 INFO L280 TraceCheckUtils]: 8: Hoare triple {717#true} goto; {717#true} is VALID [2020-07-28 17:43:34,669 INFO L280 TraceCheckUtils]: 9: Hoare triple {717#true} call modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_double_~high~1), modf_double_~#iw_u~3.base, ~bvadd32(4bv32, modf_double_~#iw_u~3.offset), 4bv32);call write~intINTTYPE4(0bv32, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 4bv32);call modf_double_#t~mem13 := read~intFLOATTYPE8(modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 8bv32);modf_double_~x := modf_double_#t~mem13;call write~intINTTYPE4(modf_double_#t~union14.lsw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 4bv32);call write~intINTTYPE4(modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, ~bvadd32(4bv32, modf_double_~#iw_u~3.offset), 4bv32);havoc modf_double_#t~union14.lsw, modf_double_#t~union14.msw;havoc modf_double_#t~mem13;call ULTIMATE.dealloc(modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset);havoc modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset; {717#true} is VALID [2020-07-28 17:43:34,669 INFO L280 TraceCheckUtils]: 10: Hoare triple {717#true} goto; {717#true} is VALID [2020-07-28 17:43:34,670 INFO L280 TraceCheckUtils]: 11: Hoare triple {717#true} modf_double_#res := modf_double_~x; {717#true} is VALID [2020-07-28 17:43:34,670 INFO L280 TraceCheckUtils]: 12: Hoare triple {717#true} main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~intFLOATTYPE8(main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {717#true} is VALID [2020-07-28 17:43:34,670 INFO L280 TraceCheckUtils]: 13: Hoare triple {717#true} call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);call isinf_double_#t~mem21 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, ~bvadd32(4bv32, isinf_double_~#ew_u~1.offset), 4bv32);isinf_double_~hx~0 := isinf_double_#t~mem21;call write~intFLOATTYPE8(isinf_double_#t~union22, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union22;havoc isinf_double_#t~mem21;call isinf_double_#t~mem23 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4bv32);isinf_double_~lx~0 := isinf_double_#t~mem23;call write~intFLOATTYPE8(isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union24;havoc isinf_double_#t~mem23;call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset);havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; {717#true} is VALID [2020-07-28 17:43:34,671 INFO L280 TraceCheckUtils]: 14: Hoare triple {717#true} goto; {717#true} is VALID [2020-07-28 17:43:34,671 INFO L280 TraceCheckUtils]: 15: Hoare triple {717#true} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {717#true} is VALID [2020-07-28 17:43:34,671 INFO L280 TraceCheckUtils]: 16: Hoare triple {717#true} main_#t~ret30 := isinf_double_#res;main_#t~short33 := 0bv32 != main_#t~ret30; {717#true} is VALID [2020-07-28 17:43:34,674 INFO L280 TraceCheckUtils]: 17: Hoare triple {717#true} assume !main_#t~short33; {773#(not |ULTIMATE.start_main_#t~short33|)} is VALID [2020-07-28 17:43:34,675 INFO L280 TraceCheckUtils]: 18: Hoare triple {773#(not |ULTIMATE.start_main_#t~short33|)} assume main_#t~short33;havoc main_#t~ret30;havoc main_#t~ret31;havoc main_#t~mem29;havoc main_#t~short32;havoc main_#t~short33; {718#false} is VALID [2020-07-28 17:43:34,675 INFO L280 TraceCheckUtils]: 19: Hoare triple {718#false} assume !false; {718#false} is VALID [2020-07-28 17:43:34,676 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:43:34,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:34,727 INFO L280 TraceCheckUtils]: 19: Hoare triple {718#false} assume !false; {718#false} is VALID [2020-07-28 17:43:34,728 INFO L280 TraceCheckUtils]: 18: Hoare triple {773#(not |ULTIMATE.start_main_#t~short33|)} assume main_#t~short33;havoc main_#t~ret30;havoc main_#t~ret31;havoc main_#t~mem29;havoc main_#t~short32;havoc main_#t~short33; {718#false} is VALID [2020-07-28 17:43:34,728 INFO L280 TraceCheckUtils]: 17: Hoare triple {717#true} assume !main_#t~short33; {773#(not |ULTIMATE.start_main_#t~short33|)} is VALID [2020-07-28 17:43:34,729 INFO L280 TraceCheckUtils]: 16: Hoare triple {717#true} main_#t~ret30 := isinf_double_#res;main_#t~short33 := 0bv32 != main_#t~ret30; {717#true} is VALID [2020-07-28 17:43:34,729 INFO L280 TraceCheckUtils]: 15: Hoare triple {717#true} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {717#true} is VALID [2020-07-28 17:43:34,729 INFO L280 TraceCheckUtils]: 14: Hoare triple {717#true} goto; {717#true} is VALID [2020-07-28 17:43:34,729 INFO L280 TraceCheckUtils]: 13: Hoare triple {717#true} call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);call isinf_double_#t~mem21 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, ~bvadd32(4bv32, isinf_double_~#ew_u~1.offset), 4bv32);isinf_double_~hx~0 := isinf_double_#t~mem21;call write~intFLOATTYPE8(isinf_double_#t~union22, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union22;havoc isinf_double_#t~mem21;call isinf_double_#t~mem23 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4bv32);isinf_double_~lx~0 := isinf_double_#t~mem23;call write~intFLOATTYPE8(isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union24;havoc isinf_double_#t~mem23;call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset);havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; {717#true} is VALID [2020-07-28 17:43:34,730 INFO L280 TraceCheckUtils]: 12: Hoare triple {717#true} main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~intFLOATTYPE8(main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {717#true} is VALID [2020-07-28 17:43:34,730 INFO L280 TraceCheckUtils]: 11: Hoare triple {717#true} modf_double_#res := modf_double_~x; {717#true} is VALID [2020-07-28 17:43:34,730 INFO L280 TraceCheckUtils]: 10: Hoare triple {717#true} goto; {717#true} is VALID [2020-07-28 17:43:34,731 INFO L280 TraceCheckUtils]: 9: Hoare triple {717#true} call modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_double_~high~1), modf_double_~#iw_u~3.base, ~bvadd32(4bv32, modf_double_~#iw_u~3.offset), 4bv32);call write~intINTTYPE4(0bv32, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 4bv32);call modf_double_#t~mem13 := read~intFLOATTYPE8(modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 8bv32);modf_double_~x := modf_double_#t~mem13;call write~intINTTYPE4(modf_double_#t~union14.lsw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 4bv32);call write~intINTTYPE4(modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, ~bvadd32(4bv32, modf_double_~#iw_u~3.offset), 4bv32);havoc modf_double_#t~union14.lsw, modf_double_#t~union14.msw;havoc modf_double_#t~mem13;call ULTIMATE.dealloc(modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset);havoc modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset; {717#true} is VALID [2020-07-28 17:43:34,731 INFO L280 TraceCheckUtils]: 8: Hoare triple {717#true} goto; {717#true} is VALID [2020-07-28 17:43:34,731 INFO L280 TraceCheckUtils]: 7: Hoare triple {717#true} call modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, 8bv32);call modf_double_#t~mem11 := read~intINTTYPE4(modf_double_~#gh_u~1.base, ~bvadd32(4bv32, modf_double_~#gh_u~1.offset), 4bv32);modf_double_~high~1 := modf_double_#t~mem11;call write~intFLOATTYPE8(modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, 8bv32);havoc modf_double_#t~union12;havoc modf_double_#t~mem11;call ULTIMATE.dealloc(modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset);havoc modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset; {717#true} is VALID [2020-07-28 17:43:34,732 INFO L280 TraceCheckUtils]: 6: Hoare triple {717#true} assume ~bvsgt32(modf_double_~j0~0, 51bv32);havoc modf_double_~high~1;call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, modf_double_~x, ~one_modf~0), modf_double_~iptr.base, modf_double_~iptr.offset, 8bv32); {717#true} is VALID [2020-07-28 17:43:34,733 INFO L280 TraceCheckUtils]: 5: Hoare triple {717#true} assume !~bvslt32(modf_double_~j0~0, 20bv32); {717#true} is VALID [2020-07-28 17:43:34,733 INFO L280 TraceCheckUtils]: 4: Hoare triple {717#true} modf_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(modf_double_~i0~0, 20bv32)), 1023bv32); {717#true} is VALID [2020-07-28 17:43:34,733 INFO L280 TraceCheckUtils]: 3: Hoare triple {717#true} goto; {717#true} is VALID [2020-07-28 17:43:34,733 INFO L280 TraceCheckUtils]: 2: Hoare triple {717#true} call modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);call modf_double_#t~mem0 := read~intINTTYPE4(modf_double_~#ew_u~0.base, ~bvadd32(4bv32, modf_double_~#ew_u~0.offset), 4bv32);modf_double_~i0~0 := modf_double_#t~mem0;call write~intFLOATTYPE8(modf_double_#t~union1, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem0;havoc modf_double_#t~union1;call modf_double_#t~mem2 := read~intINTTYPE4(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 4bv32);modf_double_~i1~0 := modf_double_#t~mem2;call write~intFLOATTYPE8(modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem2;havoc modf_double_#t~union3;call ULTIMATE.dealloc(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset);havoc modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset; {717#true} is VALID [2020-07-28 17:43:34,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {717#true} havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~intFLOATTYPE8(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; {717#true} is VALID [2020-07-28 17:43:34,734 INFO L280 TraceCheckUtils]: 0: Hoare triple {717#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {717#true} is VALID [2020-07-28 17:43:34,736 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:43:34,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781885924] [2020-07-28 17:43:34,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:34,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-07-28 17:43:34,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76075091] [2020-07-28 17:43:34,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-28 17:43:34,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:34,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:43:34,873 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:43:34,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:43:34,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:34,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:43:34,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:43:34,874 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2020-07-28 17:43:35,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:35,784 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2020-07-28 17:43:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:43:35,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-28 17:43:35,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:43:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2020-07-28 17:43:35,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:43:35,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2020-07-28 17:43:35,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions. [2020-07-28 17:43:35,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:35,956 INFO L225 Difference]: With dead ends: 30 [2020-07-28 17:43:35,957 INFO L226 Difference]: Without dead ends: 27 [2020-07-28 17:43:35,957 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:43:35,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-28 17:43:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-28 17:43:35,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:35,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:35,985 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:35,985 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:35,987 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-28 17:43:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-28 17:43:35,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:35,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:35,989 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:35,989 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:35,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:35,993 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-28 17:43:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-28 17:43:35,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:35,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:35,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:35,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:35,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-28 17:43:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-28 17:43:35,999 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2020-07-28 17:43:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:36,000 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-28 17:43:36,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:43:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-28 17:43:36,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-28 17:43:36,004 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:36,004 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, 1, 1] [2020-07-28 17:43:36,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:43:36,218 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:36,219 INFO L82 PathProgramCache]: Analyzing trace with hash -605570489, now seen corresponding path program 1 times [2020-07-28 17:43:36,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:36,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478660274] [2020-07-28 17:43:36,221 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:43:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:36,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 17:43:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:36,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:36,747 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 51 treesize of output 45 [2020-07-28 17:43:36,755 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:43:36,760 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:43:36,760 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:43:36,766 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:43:36,767 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:43:36,767 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2020-07-28 17:43:36,871 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:43:36,891 INFO L280 TraceCheckUtils]: 0: Hoare triple {961#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {961#true} is VALID [2020-07-28 17:43:36,892 INFO L280 TraceCheckUtils]: 1: Hoare triple {961#true} havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~intFLOATTYPE8(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; {961#true} is VALID [2020-07-28 17:43:36,892 INFO L280 TraceCheckUtils]: 2: Hoare triple {961#true} call modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);call modf_double_#t~mem0 := read~intINTTYPE4(modf_double_~#ew_u~0.base, ~bvadd32(4bv32, modf_double_~#ew_u~0.offset), 4bv32);modf_double_~i0~0 := modf_double_#t~mem0;call write~intFLOATTYPE8(modf_double_#t~union1, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem0;havoc modf_double_#t~union1;call modf_double_#t~mem2 := read~intINTTYPE4(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 4bv32);modf_double_~i1~0 := modf_double_#t~mem2;call write~intFLOATTYPE8(modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem2;havoc modf_double_#t~union3;call ULTIMATE.dealloc(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset);havoc modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset; {961#true} is VALID [2020-07-28 17:43:36,893 INFO L280 TraceCheckUtils]: 3: Hoare triple {961#true} goto; {961#true} is VALID [2020-07-28 17:43:36,894 INFO L280 TraceCheckUtils]: 4: Hoare triple {961#true} modf_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(modf_double_~i0~0, 20bv32)), 1023bv32); {961#true} is VALID [2020-07-28 17:43:36,894 INFO L280 TraceCheckUtils]: 5: Hoare triple {961#true} assume !~bvslt32(modf_double_~j0~0, 20bv32); {961#true} is VALID [2020-07-28 17:43:36,894 INFO L280 TraceCheckUtils]: 6: Hoare triple {961#true} assume ~bvsgt32(modf_double_~j0~0, 51bv32);havoc modf_double_~high~1;call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, modf_double_~x, ~one_modf~0), modf_double_~iptr.base, modf_double_~iptr.offset, 8bv32); {961#true} is VALID [2020-07-28 17:43:36,895 INFO L280 TraceCheckUtils]: 7: Hoare triple {961#true} call modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, 8bv32);call modf_double_#t~mem11 := read~intINTTYPE4(modf_double_~#gh_u~1.base, ~bvadd32(4bv32, modf_double_~#gh_u~1.offset), 4bv32);modf_double_~high~1 := modf_double_#t~mem11;call write~intFLOATTYPE8(modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, 8bv32);havoc modf_double_#t~union12;havoc modf_double_#t~mem11;call ULTIMATE.dealloc(modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset);havoc modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset; {961#true} is VALID [2020-07-28 17:43:36,895 INFO L280 TraceCheckUtils]: 8: Hoare triple {961#true} goto; {961#true} is VALID [2020-07-28 17:43:36,898 INFO L280 TraceCheckUtils]: 9: Hoare triple {961#true} call modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_double_~high~1), modf_double_~#iw_u~3.base, ~bvadd32(4bv32, modf_double_~#iw_u~3.offset), 4bv32);call write~intINTTYPE4(0bv32, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 4bv32);call modf_double_#t~mem13 := read~intFLOATTYPE8(modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 8bv32);modf_double_~x := modf_double_#t~mem13;call write~intINTTYPE4(modf_double_#t~union14.lsw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 4bv32);call write~intINTTYPE4(modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, ~bvadd32(4bv32, modf_double_~#iw_u~3.offset), 4bv32);havoc modf_double_#t~union14.lsw, modf_double_#t~union14.msw;havoc modf_double_#t~mem13;call ULTIMATE.dealloc(modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset);havoc modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset; {993#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32)))) ULTIMATE.start_modf_double_~x))} is VALID [2020-07-28 17:43:36,899 INFO L280 TraceCheckUtils]: 10: Hoare triple {993#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32)))) ULTIMATE.start_modf_double_~x))} goto; {993#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32)))) ULTIMATE.start_modf_double_~x))} is VALID [2020-07-28 17:43:36,900 INFO L280 TraceCheckUtils]: 11: Hoare triple {993#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32)))) ULTIMATE.start_modf_double_~x))} modf_double_#res := modf_double_~x; {1000#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32)))) |ULTIMATE.start_modf_double_#res|))} is VALID [2020-07-28 17:43:36,903 INFO L280 TraceCheckUtils]: 12: Hoare triple {1000#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32)))) |ULTIMATE.start_modf_double_#res|))} main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~intFLOATTYPE8(main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {1004#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))))))} is VALID [2020-07-28 17:43:36,904 INFO L280 TraceCheckUtils]: 13: Hoare triple {1004#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))))))} call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);call isinf_double_#t~mem21 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, ~bvadd32(4bv32, isinf_double_~#ew_u~1.offset), 4bv32);isinf_double_~hx~0 := isinf_double_#t~mem21;call write~intFLOATTYPE8(isinf_double_#t~union22, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union22;havoc isinf_double_#t~mem21;call isinf_double_#t~mem23 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4bv32);isinf_double_~lx~0 := isinf_double_#t~mem23;call write~intFLOATTYPE8(isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union24;havoc isinf_double_#t~mem23;call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset);havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; {1004#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))))))} is VALID [2020-07-28 17:43:36,907 INFO L280 TraceCheckUtils]: 14: Hoare triple {1004#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))))))} goto; {1004#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))))))} is VALID [2020-07-28 17:43:36,911 INFO L280 TraceCheckUtils]: 15: Hoare triple {1004#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))))))} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {1004#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))))))} is VALID [2020-07-28 17:43:36,913 INFO L280 TraceCheckUtils]: 16: Hoare triple {1004#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))))))} main_#t~ret30 := isinf_double_#res;main_#t~short33 := 0bv32 != main_#t~ret30; {1004#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))))))} is VALID [2020-07-28 17:43:36,915 INFO L280 TraceCheckUtils]: 17: Hoare triple {1004#(exists ((ULTIMATE.start_modf_double_~high~1 (_ BitVec 32))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))))))} assume main_#t~short33;main_#t~short32 := ~fp.eq~DOUBLE(main_~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); {1020#|ULTIMATE.start_main_#t~short32|} is VALID [2020-07-28 17:43:36,915 INFO L280 TraceCheckUtils]: 18: Hoare triple {1020#|ULTIMATE.start_main_#t~short32|} assume !main_#t~short32; {962#false} is VALID [2020-07-28 17:43:36,916 INFO L280 TraceCheckUtils]: 19: Hoare triple {962#false} main_#t~short33 := !main_#t~short32; {962#false} is VALID [2020-07-28 17:43:36,916 INFO L280 TraceCheckUtils]: 20: Hoare triple {962#false} assume main_#t~short33;havoc main_#t~ret30;havoc main_#t~ret31;havoc main_#t~mem29;havoc main_#t~short32;havoc main_#t~short33; {962#false} is VALID [2020-07-28 17:43:36,916 INFO L280 TraceCheckUtils]: 21: Hoare triple {962#false} assume !false; {962#false} is VALID [2020-07-28 17:43:36,918 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:43:36,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:37,012 INFO L280 TraceCheckUtils]: 21: Hoare triple {962#false} assume !false; {962#false} is VALID [2020-07-28 17:43:37,012 INFO L280 TraceCheckUtils]: 20: Hoare triple {962#false} assume main_#t~short33;havoc main_#t~ret30;havoc main_#t~ret31;havoc main_#t~mem29;havoc main_#t~short32;havoc main_#t~short33; {962#false} is VALID [2020-07-28 17:43:37,013 INFO L280 TraceCheckUtils]: 19: Hoare triple {962#false} main_#t~short33 := !main_#t~short32; {962#false} is VALID [2020-07-28 17:43:37,014 INFO L280 TraceCheckUtils]: 18: Hoare triple {1020#|ULTIMATE.start_main_#t~short32|} assume !main_#t~short32; {962#false} is VALID [2020-07-28 17:43:37,014 INFO L280 TraceCheckUtils]: 17: Hoare triple {1045#(fp.eq ULTIMATE.start_main_~res~0 (fp.neg (_ +zero 11 53)))} assume main_#t~short33;main_#t~short32 := ~fp.eq~DOUBLE(main_~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); {1020#|ULTIMATE.start_main_#t~short32|} is VALID [2020-07-28 17:43:37,015 INFO L280 TraceCheckUtils]: 16: Hoare triple {1045#(fp.eq ULTIMATE.start_main_~res~0 (fp.neg (_ +zero 11 53)))} main_#t~ret30 := isinf_double_#res;main_#t~short33 := 0bv32 != main_#t~ret30; {1045#(fp.eq ULTIMATE.start_main_~res~0 (fp.neg (_ +zero 11 53)))} is VALID [2020-07-28 17:43:37,016 INFO L280 TraceCheckUtils]: 15: Hoare triple {1045#(fp.eq ULTIMATE.start_main_~res~0 (fp.neg (_ +zero 11 53)))} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {1045#(fp.eq ULTIMATE.start_main_~res~0 (fp.neg (_ +zero 11 53)))} is VALID [2020-07-28 17:43:37,016 INFO L280 TraceCheckUtils]: 14: Hoare triple {1045#(fp.eq ULTIMATE.start_main_~res~0 (fp.neg (_ +zero 11 53)))} goto; {1045#(fp.eq ULTIMATE.start_main_~res~0 (fp.neg (_ +zero 11 53)))} is VALID [2020-07-28 17:43:37,017 INFO L280 TraceCheckUtils]: 13: Hoare triple {1045#(fp.eq ULTIMATE.start_main_~res~0 (fp.neg (_ +zero 11 53)))} call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);call isinf_double_#t~mem21 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, ~bvadd32(4bv32, isinf_double_~#ew_u~1.offset), 4bv32);isinf_double_~hx~0 := isinf_double_#t~mem21;call write~intFLOATTYPE8(isinf_double_#t~union22, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union22;havoc isinf_double_#t~mem21;call isinf_double_#t~mem23 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4bv32);isinf_double_~lx~0 := isinf_double_#t~mem23;call write~intFLOATTYPE8(isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union24;havoc isinf_double_#t~mem23;call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset);havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; {1045#(fp.eq ULTIMATE.start_main_~res~0 (fp.neg (_ +zero 11 53)))} is VALID [2020-07-28 17:43:37,018 INFO L280 TraceCheckUtils]: 12: Hoare triple {1061#(fp.eq |ULTIMATE.start_modf_double_#res| (fp.neg (_ +zero 11 53)))} main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~intFLOATTYPE8(main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {1045#(fp.eq ULTIMATE.start_main_~res~0 (fp.neg (_ +zero 11 53)))} is VALID [2020-07-28 17:43:37,019 INFO L280 TraceCheckUtils]: 11: Hoare triple {1065#(fp.eq ULTIMATE.start_modf_double_~x (fp.neg (_ +zero 11 53)))} modf_double_#res := modf_double_~x; {1061#(fp.eq |ULTIMATE.start_modf_double_#res| (fp.neg (_ +zero 11 53)))} is VALID [2020-07-28 17:43:37,020 INFO L280 TraceCheckUtils]: 10: Hoare triple {1065#(fp.eq ULTIMATE.start_modf_double_~x (fp.neg (_ +zero 11 53)))} goto; {1065#(fp.eq ULTIMATE.start_modf_double_~x (fp.neg (_ +zero 11 53)))} is VALID [2020-07-28 17:43:37,023 INFO L280 TraceCheckUtils]: 9: Hoare triple {961#true} call modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_double_~high~1), modf_double_~#iw_u~3.base, ~bvadd32(4bv32, modf_double_~#iw_u~3.offset), 4bv32);call write~intINTTYPE4(0bv32, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 4bv32);call modf_double_#t~mem13 := read~intFLOATTYPE8(modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 8bv32);modf_double_~x := modf_double_#t~mem13;call write~intINTTYPE4(modf_double_#t~union14.lsw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 4bv32);call write~intINTTYPE4(modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, ~bvadd32(4bv32, modf_double_~#iw_u~3.offset), 4bv32);havoc modf_double_#t~union14.lsw, modf_double_#t~union14.msw;havoc modf_double_#t~mem13;call ULTIMATE.dealloc(modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset);havoc modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset; {1065#(fp.eq ULTIMATE.start_modf_double_~x (fp.neg (_ +zero 11 53)))} is VALID [2020-07-28 17:43:37,023 INFO L280 TraceCheckUtils]: 8: Hoare triple {961#true} goto; {961#true} is VALID [2020-07-28 17:43:37,023 INFO L280 TraceCheckUtils]: 7: Hoare triple {961#true} call modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, 8bv32);call modf_double_#t~mem11 := read~intINTTYPE4(modf_double_~#gh_u~1.base, ~bvadd32(4bv32, modf_double_~#gh_u~1.offset), 4bv32);modf_double_~high~1 := modf_double_#t~mem11;call write~intFLOATTYPE8(modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, 8bv32);havoc modf_double_#t~union12;havoc modf_double_#t~mem11;call ULTIMATE.dealloc(modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset);havoc modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset; {961#true} is VALID [2020-07-28 17:43:37,024 INFO L280 TraceCheckUtils]: 6: Hoare triple {961#true} assume ~bvsgt32(modf_double_~j0~0, 51bv32);havoc modf_double_~high~1;call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, modf_double_~x, ~one_modf~0), modf_double_~iptr.base, modf_double_~iptr.offset, 8bv32); {961#true} is VALID [2020-07-28 17:43:37,024 INFO L280 TraceCheckUtils]: 5: Hoare triple {961#true} assume !~bvslt32(modf_double_~j0~0, 20bv32); {961#true} is VALID [2020-07-28 17:43:37,024 INFO L280 TraceCheckUtils]: 4: Hoare triple {961#true} modf_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(modf_double_~i0~0, 20bv32)), 1023bv32); {961#true} is VALID [2020-07-28 17:43:37,025 INFO L280 TraceCheckUtils]: 3: Hoare triple {961#true} goto; {961#true} is VALID [2020-07-28 17:43:37,025 INFO L280 TraceCheckUtils]: 2: Hoare triple {961#true} call modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);call modf_double_#t~mem0 := read~intINTTYPE4(modf_double_~#ew_u~0.base, ~bvadd32(4bv32, modf_double_~#ew_u~0.offset), 4bv32);modf_double_~i0~0 := modf_double_#t~mem0;call write~intFLOATTYPE8(modf_double_#t~union1, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem0;havoc modf_double_#t~union1;call modf_double_#t~mem2 := read~intINTTYPE4(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 4bv32);modf_double_~i1~0 := modf_double_#t~mem2;call write~intFLOATTYPE8(modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem2;havoc modf_double_#t~union3;call ULTIMATE.dealloc(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset);havoc modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset; {961#true} is VALID [2020-07-28 17:43:37,025 INFO L280 TraceCheckUtils]: 1: Hoare triple {961#true} havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~intFLOATTYPE8(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; {961#true} is VALID [2020-07-28 17:43:37,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {961#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {961#true} is VALID [2020-07-28 17:43:37,027 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:43:37,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478660274] [2020-07-28 17:43:37,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:37,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-07-28 17:43:37,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084092596] [2020-07-28 17:43:37,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-28 17:43:37,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:37,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 17:43:37,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:37,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 17:43:37,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:37,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 17:43:37,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-28 17:43:37,185 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2020-07-28 17:43:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:40,538 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2020-07-28 17:43:40,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:43:40,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2020-07-28 17:43:40,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:43:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2020-07-28 17:43:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:43:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2020-07-28 17:43:40,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2020-07-28 17:43:40,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:40,752 INFO L225 Difference]: With dead ends: 31 [2020-07-28 17:43:40,752 INFO L226 Difference]: Without dead ends: 27 [2020-07-28 17:43:40,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-28 17:43:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-28 17:43:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-28 17:43:40,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:40,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:40,779 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:40,779 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:40,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:40,781 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2020-07-28 17:43:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2020-07-28 17:43:40,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:40,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:40,782 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:40,782 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-28 17:43:40,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:40,784 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2020-07-28 17:43:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2020-07-28 17:43:40,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:40,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:40,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:40,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:40,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-28 17:43:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2020-07-28 17:43:40,787 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2020-07-28 17:43:40,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:40,787 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2020-07-28 17:43:40,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 17:43:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2020-07-28 17:43:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-28 17:43:40,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:40,789 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, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:40,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 17:43:41,000 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:41,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:41,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1265561966, now seen corresponding path program 1 times [2020-07-28 17:43:41,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:41,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474556466] [2020-07-28 17:43:41,002 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:43:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:41,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-28 17:43:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:41,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:41,577 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 54 treesize of output 48 [2020-07-28 17:43:41,591 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:43:41,596 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:43:41,596 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:43:41,625 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:43:41,626 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-28 17:43:41,626 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:40 [2020-07-28 17:43:42,190 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:43:42,419 INFO L280 TraceCheckUtils]: 0: Hoare triple {1231#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {1231#true} is VALID [2020-07-28 17:43:42,425 INFO L280 TraceCheckUtils]: 1: Hoare triple {1231#true} havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~intFLOATTYPE8(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; {1239#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:42,425 INFO L280 TraceCheckUtils]: 2: Hoare triple {1239#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} call modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);call modf_double_#t~mem0 := read~intINTTYPE4(modf_double_~#ew_u~0.base, ~bvadd32(4bv32, modf_double_~#ew_u~0.offset), 4bv32);modf_double_~i0~0 := modf_double_#t~mem0;call write~intFLOATTYPE8(modf_double_#t~union1, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem0;havoc modf_double_#t~union1;call modf_double_#t~mem2 := read~intINTTYPE4(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 4bv32);modf_double_~i1~0 := modf_double_#t~mem2;call write~intFLOATTYPE8(modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem2;havoc modf_double_#t~union3;call ULTIMATE.dealloc(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset);havoc modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset; {1239#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:42,426 INFO L280 TraceCheckUtils]: 3: Hoare triple {1239#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} goto; {1239#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:42,426 INFO L280 TraceCheckUtils]: 4: Hoare triple {1239#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} modf_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(modf_double_~i0~0, 20bv32)), 1023bv32); {1239#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:42,427 INFO L280 TraceCheckUtils]: 5: Hoare triple {1239#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} assume !~bvslt32(modf_double_~j0~0, 20bv32); {1239#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:42,428 INFO L280 TraceCheckUtils]: 6: Hoare triple {1239#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} assume ~bvsgt32(modf_double_~j0~0, 51bv32);havoc modf_double_~high~1;call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, modf_double_~x, ~one_modf~0), modf_double_~iptr.base, modf_double_~iptr.offset, 8bv32); {1239#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} is VALID [2020-07-28 17:43:42,435 INFO L280 TraceCheckUtils]: 7: Hoare triple {1239#(exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} call modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, 8bv32);call modf_double_#t~mem11 := read~intINTTYPE4(modf_double_~#gh_u~1.base, ~bvadd32(4bv32, modf_double_~#gh_u~1.offset), 4bv32);modf_double_~high~1 := modf_double_#t~mem11;call write~intFLOATTYPE8(modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, 8bv32);havoc modf_double_#t~union12;havoc modf_double_#t~mem11;call ULTIMATE.dealloc(modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset);havoc modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset; {1258#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1)))} is VALID [2020-07-28 17:43:42,436 INFO L280 TraceCheckUtils]: 8: Hoare triple {1258#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1)))} goto; {1258#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1)))} is VALID [2020-07-28 17:43:42,442 INFO L280 TraceCheckUtils]: 9: Hoare triple {1258#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1)))} call modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_double_~high~1), modf_double_~#iw_u~3.base, ~bvadd32(4bv32, modf_double_~#iw_u~3.offset), 4bv32);call write~intINTTYPE4(0bv32, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 4bv32);call modf_double_#t~mem13 := read~intFLOATTYPE8(modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 8bv32);modf_double_~x := modf_double_#t~mem13;call write~intINTTYPE4(modf_double_#t~union14.lsw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 4bv32);call write~intINTTYPE4(modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, ~bvadd32(4bv32, modf_double_~#iw_u~3.offset), 4bv32);havoc modf_double_#t~union14.lsw, modf_double_#t~union14.msw;havoc modf_double_#t~mem13;call ULTIMATE.dealloc(modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset);havoc modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset; {1265#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} is VALID [2020-07-28 17:43:42,442 INFO L280 TraceCheckUtils]: 10: Hoare triple {1265#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} goto; {1265#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} is VALID [2020-07-28 17:43:42,447 INFO L280 TraceCheckUtils]: 11: Hoare triple {1265#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} modf_double_#res := modf_double_~x; {1272#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) |ULTIMATE.start_modf_double_#res|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))))} is VALID [2020-07-28 17:43:42,453 INFO L280 TraceCheckUtils]: 12: Hoare triple {1272#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) |ULTIMATE.start_modf_double_#res|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))))} main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~intFLOATTYPE8(main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {1276#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} is VALID [2020-07-28 17:43:42,453 INFO L280 TraceCheckUtils]: 13: Hoare triple {1276#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);call isinf_double_#t~mem21 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, ~bvadd32(4bv32, isinf_double_~#ew_u~1.offset), 4bv32);isinf_double_~hx~0 := isinf_double_#t~mem21;call write~intFLOATTYPE8(isinf_double_#t~union22, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union22;havoc isinf_double_#t~mem21;call isinf_double_#t~mem23 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4bv32);isinf_double_~lx~0 := isinf_double_#t~mem23;call write~intFLOATTYPE8(isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union24;havoc isinf_double_#t~mem23;call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset);havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; {1276#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} is VALID [2020-07-28 17:43:42,454 INFO L280 TraceCheckUtils]: 14: Hoare triple {1276#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} goto; {1276#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} is VALID [2020-07-28 17:43:42,454 INFO L280 TraceCheckUtils]: 15: Hoare triple {1276#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {1276#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} is VALID [2020-07-28 17:43:42,455 INFO L280 TraceCheckUtils]: 16: Hoare triple {1276#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} main_#t~ret30 := isinf_double_#res;main_#t~short33 := 0bv32 != main_#t~ret30; {1276#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} is VALID [2020-07-28 17:43:42,455 INFO L280 TraceCheckUtils]: 17: Hoare triple {1276#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} assume main_#t~short33;main_#t~short32 := ~fp.eq~DOUBLE(main_~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); {1276#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} is VALID [2020-07-28 17:43:42,458 INFO L280 TraceCheckUtils]: 18: Hoare triple {1276#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} assume main_#t~short32;__signbit_double_#in~x := main_~res~0;havoc __signbit_double_#res;havoc __signbit_double_#t~mem25, __signbit_double_#t~union26, __signbit_double_~#gh_u~3.base, __signbit_double_~#gh_u~3.offset, __signbit_double_~x, __signbit_double_~msw~0;__signbit_double_~x := __signbit_double_#in~x;havoc __signbit_double_~msw~0; {1295#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~x (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} is VALID [2020-07-28 17:43:42,465 INFO L280 TraceCheckUtils]: 19: Hoare triple {1295#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~x (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} call __signbit_double_~#gh_u~3.base, __signbit_double_~#gh_u~3.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__signbit_double_~x, __signbit_double_~#gh_u~3.base, __signbit_double_~#gh_u~3.offset, 8bv32);call __signbit_double_#t~mem25 := read~intINTTYPE4(__signbit_double_~#gh_u~3.base, ~bvadd32(4bv32, __signbit_double_~#gh_u~3.offset), 4bv32);__signbit_double_~msw~0 := __signbit_double_#t~mem25;call write~intFLOATTYPE8(__signbit_double_#t~union26, __signbit_double_~#gh_u~3.base, __signbit_double_~#gh_u~3.offset, 8bv32);havoc __signbit_double_#t~union26;havoc __signbit_double_#t~mem25;call ULTIMATE.dealloc(__signbit_double_~#gh_u~3.base, __signbit_double_~#gh_u~3.offset);havoc __signbit_double_~#gh_u~3.base, __signbit_double_~#gh_u~3.offset; {1299#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode) (v_skolemized_v_prenex_6_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_6_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} is VALID [2020-07-28 17:43:42,468 INFO L280 TraceCheckUtils]: 20: Hoare triple {1299#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode) (v_skolemized_v_prenex_6_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_6_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} goto; {1299#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode) (v_skolemized_v_prenex_6_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_6_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} is VALID [2020-07-28 17:43:42,473 INFO L280 TraceCheckUtils]: 21: Hoare triple {1299#(exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode) (v_skolemized_v_prenex_6_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_6_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))))))} __signbit_double_#res := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_double_~msw~0) then 1bv32 else 0bv32); {1306#(= (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 17:43:42,481 INFO L280 TraceCheckUtils]: 22: Hoare triple {1306#(= (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32)) (_ bv0 32))} main_#t~ret31 := __signbit_double_#res;main_#t~short32 := 1bv32 == main_#t~ret31; {1310#|ULTIMATE.start_main_#t~short32|} is VALID [2020-07-28 17:43:42,482 INFO L280 TraceCheckUtils]: 23: Hoare triple {1310#|ULTIMATE.start_main_#t~short32|} main_#t~short33 := !main_#t~short32; {1314#(not |ULTIMATE.start_main_#t~short33|)} is VALID [2020-07-28 17:43:42,482 INFO L280 TraceCheckUtils]: 24: Hoare triple {1314#(not |ULTIMATE.start_main_#t~short33|)} assume main_#t~short33;havoc main_#t~ret30;havoc main_#t~ret31;havoc main_#t~mem29;havoc main_#t~short32;havoc main_#t~short33; {1232#false} is VALID [2020-07-28 17:43:42,483 INFO L280 TraceCheckUtils]: 25: Hoare triple {1232#false} assume !false; {1232#false} is VALID [2020-07-28 17:43:42,487 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:43:42,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:43,264 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 58 treesize of output 52 [2020-07-28 17:43:43,270 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:43:43,274 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:43:43,274 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:43:43,282 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:43:43,283 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:43:43,283 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:36 [2020-07-28 17:43:43,704 INFO L280 TraceCheckUtils]: 25: Hoare triple {1232#false} assume !false; {1232#false} is VALID [2020-07-28 17:43:43,704 INFO L280 TraceCheckUtils]: 24: Hoare triple {1314#(not |ULTIMATE.start_main_#t~short33|)} assume main_#t~short33;havoc main_#t~ret30;havoc main_#t~ret31;havoc main_#t~mem29;havoc main_#t~short32;havoc main_#t~short33; {1232#false} is VALID [2020-07-28 17:43:43,705 INFO L280 TraceCheckUtils]: 23: Hoare triple {1310#|ULTIMATE.start_main_#t~short32|} main_#t~short33 := !main_#t~short32; {1314#(not |ULTIMATE.start_main_#t~short33|)} is VALID [2020-07-28 17:43:43,705 INFO L280 TraceCheckUtils]: 22: Hoare triple {1306#(= (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32)) (_ bv0 32))} main_#t~ret31 := __signbit_double_#res;main_#t~short32 := 1bv32 == main_#t~ret31; {1310#|ULTIMATE.start_main_#t~short32|} is VALID [2020-07-28 17:43:43,706 INFO L280 TraceCheckUtils]: 21: Hoare triple {1333#(not (= (_ 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); {1306#(= (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 17:43:43,707 INFO L280 TraceCheckUtils]: 20: Hoare triple {1333#(not (= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0)))} goto; {1333#(not (= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0)))} is VALID [2020-07-28 17:43:43,710 INFO L280 TraceCheckUtils]: 19: Hoare triple {1340#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3)))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start___signbit_double_~x))))} call __signbit_double_~#gh_u~3.base, __signbit_double_~#gh_u~3.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__signbit_double_~x, __signbit_double_~#gh_u~3.base, __signbit_double_~#gh_u~3.offset, 8bv32);call __signbit_double_#t~mem25 := read~intINTTYPE4(__signbit_double_~#gh_u~3.base, ~bvadd32(4bv32, __signbit_double_~#gh_u~3.offset), 4bv32);__signbit_double_~msw~0 := __signbit_double_#t~mem25;call write~intFLOATTYPE8(__signbit_double_#t~union26, __signbit_double_~#gh_u~3.base, __signbit_double_~#gh_u~3.offset, 8bv32);havoc __signbit_double_#t~union26;havoc __signbit_double_#t~mem25;call ULTIMATE.dealloc(__signbit_double_~#gh_u~3.base, __signbit_double_~#gh_u~3.offset);havoc __signbit_double_~#gh_u~3.base, __signbit_double_~#gh_u~3.offset; {1333#(not (= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0)))} is VALID [2020-07-28 17:43:43,712 INFO L280 TraceCheckUtils]: 18: Hoare triple {1344#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} assume main_#t~short32;__signbit_double_#in~x := main_~res~0;havoc __signbit_double_#res;havoc __signbit_double_#t~mem25, __signbit_double_#t~union26, __signbit_double_~#gh_u~3.base, __signbit_double_~#gh_u~3.offset, __signbit_double_~x, __signbit_double_~msw~0;__signbit_double_~x := __signbit_double_#in~x;havoc __signbit_double_~msw~0; {1340#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3)))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start___signbit_double_~x))))} is VALID [2020-07-28 17:43:43,713 INFO L280 TraceCheckUtils]: 17: Hoare triple {1344#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} assume main_#t~short33;main_#t~short32 := ~fp.eq~DOUBLE(main_~res~0, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())); {1344#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,714 INFO L280 TraceCheckUtils]: 16: Hoare triple {1344#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} main_#t~ret30 := isinf_double_#res;main_#t~short33 := 0bv32 != main_#t~ret30; {1344#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,714 INFO L280 TraceCheckUtils]: 15: Hoare triple {1344#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} isinf_double_~hx~0 := ~bvand32(2147483647bv32, isinf_double_~hx~0);isinf_double_~hx~0 := ~bvor32(isinf_double_~hx~0, ~bvlshr32(~bvor32(isinf_double_~lx~0, ~bvneg32(isinf_double_~lx~0)), 31bv32));isinf_double_~hx~0 := ~bvsub32(2146435072bv32, isinf_double_~hx~0);isinf_double_#res := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0, ~bvneg32(isinf_double_~hx~0)), 31bv32)); {1344#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,715 INFO L280 TraceCheckUtils]: 14: Hoare triple {1344#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} goto; {1344#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,715 INFO L280 TraceCheckUtils]: 13: Hoare triple {1344#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} call isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);call isinf_double_#t~mem21 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, ~bvadd32(4bv32, isinf_double_~#ew_u~1.offset), 4bv32);isinf_double_~hx~0 := isinf_double_#t~mem21;call write~intFLOATTYPE8(isinf_double_#t~union22, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union22;havoc isinf_double_#t~mem21;call isinf_double_#t~mem23 := read~intINTTYPE4(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 4bv32);isinf_double_~lx~0 := isinf_double_#t~mem23;call write~intFLOATTYPE8(isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, 8bv32);havoc isinf_double_#t~union24;havoc isinf_double_#t~mem23;call ULTIMATE.dealloc(isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset);havoc isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset; {1344#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,718 INFO L280 TraceCheckUtils]: 12: Hoare triple {1363#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) |ULTIMATE.start_modf_double_#res|)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} main_#t~ret28 := modf_double_#res;main_~res~0 := main_#t~ret28;havoc main_#t~ret28;call main_#t~mem29 := read~intFLOATTYPE8(main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);isinf_double_#in~x := main_#t~mem29;havoc isinf_double_#res;havoc isinf_double_#t~mem21, isinf_double_#t~union22, isinf_double_#t~mem23, isinf_double_#t~union24, isinf_double_~#ew_u~1.base, isinf_double_~#ew_u~1.offset, isinf_double_~x, isinf_double_~hx~0, isinf_double_~lx~0;isinf_double_~x := isinf_double_#in~x;havoc isinf_double_~hx~0;havoc isinf_double_~lx~0; {1344#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,720 INFO L280 TraceCheckUtils]: 11: Hoare triple {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} modf_double_#res := modf_double_~x; {1363#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) |ULTIMATE.start_modf_double_#res|)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,720 INFO L280 TraceCheckUtils]: 10: Hoare triple {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} goto; {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,724 INFO L280 TraceCheckUtils]: 9: Hoare triple {1374#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32)))))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} call modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_double_~high~1), modf_double_~#iw_u~3.base, ~bvadd32(4bv32, modf_double_~#iw_u~3.offset), 4bv32);call write~intINTTYPE4(0bv32, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 4bv32);call modf_double_#t~mem13 := read~intFLOATTYPE8(modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 8bv32);modf_double_~x := modf_double_#t~mem13;call write~intINTTYPE4(modf_double_#t~union14.lsw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, 4bv32);call write~intINTTYPE4(modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, ~bvadd32(4bv32, modf_double_~#iw_u~3.offset), 4bv32);havoc modf_double_#t~union14.lsw, modf_double_#t~union14.msw;havoc modf_double_#t~mem13;call ULTIMATE.dealloc(modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset);havoc modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset; {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,725 INFO L280 TraceCheckUtils]: 8: Hoare triple {1374#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32)))))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} goto; {1374#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32)))))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,729 INFO L280 TraceCheckUtils]: 7: Hoare triple {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} call modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, 8bv32);call modf_double_#t~mem11 := read~intINTTYPE4(modf_double_~#gh_u~1.base, ~bvadd32(4bv32, modf_double_~#gh_u~1.offset), 4bv32);modf_double_~high~1 := modf_double_#t~mem11;call write~intFLOATTYPE8(modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, 8bv32);havoc modf_double_#t~union12;havoc modf_double_#t~mem11;call ULTIMATE.dealloc(modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset);havoc modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset; {1374#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_modf_double_~high~1) (_ bv0 32)))))) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,730 INFO L280 TraceCheckUtils]: 6: Hoare triple {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} assume ~bvsgt32(modf_double_~j0~0, 51bv32);havoc modf_double_~high~1;call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, modf_double_~x, ~one_modf~0), modf_double_~iptr.base, modf_double_~iptr.offset, 8bv32); {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,730 INFO L280 TraceCheckUtils]: 5: Hoare triple {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} assume !~bvslt32(modf_double_~j0~0, 20bv32); {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,731 INFO L280 TraceCheckUtils]: 4: Hoare triple {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} modf_double_~j0~0 := ~bvsub32(~bvand32(2047bv32, ~bvashr32(modf_double_~i0~0, 20bv32)), 1023bv32); {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,731 INFO L280 TraceCheckUtils]: 3: Hoare triple {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} goto; {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} call modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(modf_double_~x, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);call modf_double_#t~mem0 := read~intINTTYPE4(modf_double_~#ew_u~0.base, ~bvadd32(4bv32, modf_double_~#ew_u~0.offset), 4bv32);modf_double_~i0~0 := modf_double_#t~mem0;call write~intFLOATTYPE8(modf_double_#t~union1, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem0;havoc modf_double_#t~union1;call modf_double_#t~mem2 := read~intINTTYPE4(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 4bv32);modf_double_~i1~0 := modf_double_#t~mem2;call write~intFLOATTYPE8(modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, 8bv32);havoc modf_double_#t~mem2;havoc modf_double_#t~union3;call ULTIMATE.dealloc(modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset);havoc modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset; {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,738 INFO L280 TraceCheckUtils]: 1: Hoare triple {1231#true} havoc main_#res;havoc main_#t~nondet27, main_#t~ret28, main_#t~mem29, main_#t~ret30, main_#t~ret31, main_#t~short32, main_#t~short33, main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());call main_~#iptr~0.base, main_~#iptr~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~intFLOATTYPE8(main_#t~nondet27, main_~#iptr~0.base, main_~#iptr~0.offset, 8bv32);havoc main_#t~nondet27;modf_double_#in~x, modf_double_#in~iptr.base, modf_double_#in~iptr.offset := main_~x~0, main_~#iptr~0.base, main_~#iptr~0.offset;havoc modf_double_#res;havoc modf_double_#t~mem0, modf_double_#t~union1, modf_double_#t~mem2, modf_double_#t~union3, modf_double_~#ew_u~0.base, modf_double_~#ew_u~0.offset, modf_double_#t~mem4, modf_double_~#iw_u~0.base, modf_double_~#iw_u~0.offset, modf_double_#t~mem5, modf_double_#t~union6, modf_double_~#gh_u~0.base, modf_double_~#gh_u~0.offset, modf_double_#t~mem7, modf_double_#t~union8.lsw, modf_double_#t~union8.msw, modf_double_~#iw_u~1.base, modf_double_~#iw_u~1.offset, modf_double_~high~0, modf_double_#t~mem9, modf_double_~#iw_u~2.base, modf_double_~#iw_u~2.offset, modf_double_#t~mem10, modf_double_#t~mem11, modf_double_#t~union12, modf_double_~#gh_u~1.base, modf_double_~#gh_u~1.offset, modf_double_#t~mem13, modf_double_#t~union14.lsw, modf_double_#t~union14.msw, modf_double_~#iw_u~3.base, modf_double_~#iw_u~3.offset, modf_double_~high~1, modf_double_#t~mem15, modf_double_#t~union16, modf_double_~#gh_u~2.base, modf_double_~#gh_u~2.offset, modf_double_#t~mem17, modf_double_#t~union18.lsw, modf_double_#t~union18.msw, modf_double_~#iw_u~4.base, modf_double_~#iw_u~4.offset, modf_double_~high~2, modf_double_#t~mem19, modf_double_~#iw_u~5.base, modf_double_~#iw_u~5.offset, modf_double_#t~mem20, modf_double_~x, modf_double_~iptr.base, modf_double_~iptr.offset, modf_double_~i0~0, modf_double_~i1~0, modf_double_~j0~0, modf_double_~i~0;modf_double_~x := modf_double_#in~x;modf_double_~iptr.base, modf_double_~iptr.offset := modf_double_#in~iptr.base, modf_double_#in~iptr.offset;havoc modf_double_~i0~0;havoc modf_double_~i1~0;havoc modf_double_~j0~0;havoc modf_double_~i~0; {1367#(forall ((v_skolemized_v_prenex_6_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) ULTIMATE.start_modf_double_~x)) (not (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_6_3))))))} is VALID [2020-07-28 17:43:43,738 INFO L280 TraceCheckUtils]: 0: Hoare triple {1231#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~one_modf~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {1231#true} is VALID [2020-07-28 17:43:43,742 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:43:43,742 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474556466] [2020-07-28 17:43:43,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:43,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 18 [2020-07-28 17:43:43,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308504556] [2020-07-28 17:43:43,743 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-07-28 17:43:43,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:43,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-28 17:43:44,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:44,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-28 17:43:44,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:44,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-28 17:43:44,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-07-28 17:43:44,134 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 18 states. [2020-07-28 17:44:00,358 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2020-07-28 17:44:00,847 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-07-28 17:44:01,360 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-07-28 17:44:02,095 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-07-28 17:44:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:44:02,103 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2020-07-28 17:44:02,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-28 17:44:02,103 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-07-28 17:44:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:44:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:44:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2020-07-28 17:44:02,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:44:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2020-07-28 17:44:02,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2020-07-28 17:44:02,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:44:02,512 INFO L225 Difference]: With dead ends: 27 [2020-07-28 17:44:02,512 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:44:02,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2020-07-28 17:44:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:44:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:44:02,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:44:02,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:44:02,514 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:44:02,514 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:44:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:44:02,514 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:44:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:44:02,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:44:02,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:44:02,515 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:44:02,515 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:44:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:44:02,517 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:44:02,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:44:02,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:44:02,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:44:02,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:44:02,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:44:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:44:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:44:02,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2020-07-28 17:44:02,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:44:02,520 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:44:02,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-28 17:44:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:44:02,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:44:02,721 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 17:44:02,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:44:03,211 WARN L193 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2020-07-28 17:44:03,571 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2020-07-28 17:44:04,165 WARN L193 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2020-07-28 17:44:04,790 WARN L193 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2020-07-28 17:44:05,080 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2020-07-28 17:44:05,156 INFO L268 CegarLoopResult]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2020-07-28 17:44:05,156 INFO L264 CegarLoopResult]: At program point L44-2(lines 44 48) the Hoare annotation is: false [2020-07-28 17:44:05,156 INFO L268 CegarLoopResult]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2020-07-28 17:44:05,156 INFO L264 CegarLoopResult]: At program point L69-2(lines 69 73) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32)))))) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) [2020-07-28 17:44:05,156 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:44:05,156 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:44:05,157 INFO L268 CegarLoopResult]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2020-07-28 17:44:05,157 INFO L264 CegarLoopResult]: At program point L86-2(lines 86 90) the Hoare annotation is: false [2020-07-28 17:44:05,157 INFO L268 CegarLoopResult]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2020-07-28 17:44:05,157 INFO L264 CegarLoopResult]: At program point L128-2(lines 128 132) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~x (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse3 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) |ULTIMATE.start_modf_double_#res|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) |ULTIMATE.start_main_#t~short32|) [2020-07-28 17:44:05,157 INFO L268 CegarLoopResult]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2020-07-28 17:44:05,157 INFO L268 CegarLoopResult]: For program point L30(lines 30 107) no Hoare annotation was computed. [2020-07-28 17:44:05,157 INFO L271 CegarLoopResult]: At program point L154(lines 137 155) the Hoare annotation is: true [2020-07-28 17:44:05,158 INFO L268 CegarLoopResult]: For program point L113-1(lines 113 118) no Hoare annotation was computed. [2020-07-28 17:44:05,158 INFO L264 CegarLoopResult]: At program point L113-2(lines 113 118) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_modf_double_#res|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))))) [2020-07-28 17:44:05,158 INFO L268 CegarLoopResult]: For program point L113-3(lines 113 118) no Hoare annotation was computed. [2020-07-28 17:44:05,158 INFO L264 CegarLoopResult]: At program point L105(lines 20 108) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_modf_double_#res|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))))) [2020-07-28 17:44:05,158 INFO L268 CegarLoopResult]: For program point L31(lines 31 65) no Hoare annotation was computed. [2020-07-28 17:44:05,159 INFO L264 CegarLoopResult]: At program point L122(lines 111 123) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_modf_double_#res|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))))) [2020-07-28 17:44:05,159 INFO L268 CegarLoopResult]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2020-07-28 17:44:05,159 INFO L264 CegarLoopResult]: At program point L23-2(lines 23 28) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_modf_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) [2020-07-28 17:44:05,159 INFO L268 CegarLoopResult]: For program point L23-3(lines 23 28) no Hoare annotation was computed. [2020-07-28 17:44:05,159 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:44:05,159 INFO L268 CegarLoopResult]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2020-07-28 17:44:05,159 INFO L264 CegarLoopResult]: At program point L32-2(lines 32 37) the Hoare annotation is: false [2020-07-28 17:44:05,161 INFO L268 CegarLoopResult]: For program point L32-3(lines 32 37) no Hoare annotation was computed. [2020-07-28 17:44:05,161 INFO L268 CegarLoopResult]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2020-07-28 17:44:05,161 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2020-07-28 17:44:05,161 INFO L264 CegarLoopResult]: At program point L57-2(lines 57 62) the Hoare annotation is: false [2020-07-28 17:44:05,161 INFO L268 CegarLoopResult]: For program point L57-3(lines 57 62) no Hoare annotation was computed. [2020-07-28 17:44:05,161 INFO L268 CegarLoopResult]: For program point L49(lines 49 54) no Hoare annotation was computed. [2020-07-28 17:44:05,161 INFO L268 CegarLoopResult]: For program point L49-1(lines 41 56) no Hoare annotation was computed. [2020-07-28 17:44:05,162 INFO L268 CegarLoopResult]: For program point L49-2(lines 49 54) no Hoare annotation was computed. [2020-07-28 17:44:05,162 INFO L268 CegarLoopResult]: For program point L74(lines 74 79) no Hoare annotation was computed. [2020-07-28 17:44:05,162 INFO L268 CegarLoopResult]: For program point L41(lines 41 64) no Hoare annotation was computed. [2020-07-28 17:44:05,162 INFO L268 CegarLoopResult]: For program point L74-1(lines 66 81) no Hoare annotation was computed. [2020-07-28 17:44:05,162 INFO L268 CegarLoopResult]: For program point L74-2(lines 74 79) no Hoare annotation was computed. [2020-07-28 17:44:05,162 INFO L268 CegarLoopResult]: For program point L66(lines 66 107) no Hoare annotation was computed. [2020-07-28 17:44:05,163 INFO L268 CegarLoopResult]: For program point L99-1(lines 99 104) no Hoare annotation was computed. [2020-07-28 17:44:05,163 INFO L264 CegarLoopResult]: At program point L99-2(lines 99 104) the Hoare annotation is: false [2020-07-28 17:44:05,163 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:44:05,163 INFO L268 CegarLoopResult]: For program point L99-3(lines 99 104) no Hoare annotation was computed. [2020-07-28 17:44:05,164 INFO L268 CegarLoopResult]: For program point L91(lines 91 96) no Hoare annotation was computed. [2020-07-28 17:44:05,164 INFO L268 CegarLoopResult]: For program point L91-1(lines 83 98) no Hoare annotation was computed. [2020-07-28 17:44:05,164 INFO L268 CegarLoopResult]: For program point L91-2(lines 91 96) no Hoare annotation was computed. [2020-07-28 17:44:05,164 INFO L268 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-07-28 17:44:05,164 INFO L268 CegarLoopResult]: For program point L149-1(line 149) no Hoare annotation was computed. [2020-07-28 17:44:05,164 INFO L268 CegarLoopResult]: For program point L83(lines 83 106) no Hoare annotation was computed. [2020-07-28 17:44:05,164 INFO L268 CegarLoopResult]: For program point L149-3(line 149) no Hoare annotation was computed. [2020-07-28 17:44:05,164 INFO L268 CegarLoopResult]: For program point L149-5(lines 149 152) no Hoare annotation was computed. [2020-07-28 17:44:05,164 INFO L268 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2020-07-28 17:44:05,165 INFO L264 CegarLoopResult]: At program point L134(lines 125 135) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_2_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode) (v_skolemized_v_prenex_6_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_6_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_6_3) ((_ extract 62 52) v_skolemized_v_prenex_6_3) ((_ extract 51 0) v_skolemized_v_prenex_6_3)) (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~x (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~x (let ((.cse3 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse4 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) |ULTIMATE.start_modf_double_#res|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|) ULTIMATE.start_modf_double_~high~1))) (= (_ bv0 32) (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32))) (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_2_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) |ULTIMATE.start_main_#t~short32|) [2020-07-28 17:44:05,168 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:44:05,168 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:44:05,168 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-28 17:44:05,169 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-28 17:44:05,169 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-28 17:44:05,169 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-28 17:44:05,169 WARN L170 areAnnotationChecker]: L23-3 has no Hoare annotation [2020-07-28 17:44:05,169 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:44:05,169 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:44:05,169 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:44:05,169 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:44:05,169 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-28 17:44:05,169 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-28 17:44:05,169 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:44:05,170 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-28 17:44:05,170 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-28 17:44:05,170 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-28 17:44:05,170 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2020-07-28 17:44:05,170 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-28 17:44:05,170 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-28 17:44:05,170 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-28 17:44:05,171 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:44:05,171 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:44:05,171 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2020-07-28 17:44:05,172 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-28 17:44:05,172 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-28 17:44:05,172 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-28 17:44:05,172 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-28 17:44:05,172 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2020-07-28 17:44:05,172 WARN L170 areAnnotationChecker]: L69-1 has no Hoare annotation [2020-07-28 17:44:05,172 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-28 17:44:05,172 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2020-07-28 17:44:05,172 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-28 17:44:05,172 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2020-07-28 17:44:05,172 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2020-07-28 17:44:05,172 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2020-07-28 17:44:05,186 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-28 17:44:05,186 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-28 17:44:05,186 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-28 17:44:05,186 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-28 17:44:05,186 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-28 17:44:05,187 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2020-07-28 17:44:05,187 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-28 17:44:05,187 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-28 17:44:05,187 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-28 17:44:05,187 WARN L170 areAnnotationChecker]: L74-2 has no Hoare annotation [2020-07-28 17:44:05,187 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-28 17:44:05,187 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2020-07-28 17:44:05,187 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2020-07-28 17:44:05,187 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2020-07-28 17:44:05,187 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2020-07-28 17:44:05,187 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2020-07-28 17:44:05,188 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2020-07-28 17:44:05,188 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2020-07-28 17:44:05,188 WARN L170 areAnnotationChecker]: L113-3 has no Hoare annotation [2020-07-28 17:44:05,188 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-28 17:44:05,188 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-28 17:44:05,188 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2020-07-28 17:44:05,188 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-28 17:44:05,188 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-28 17:44:05,188 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2020-07-28 17:44:05,188 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2020-07-28 17:44:05,188 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2020-07-28 17:44:05,188 WARN L170 areAnnotationChecker]: L113-3 has no Hoare annotation [2020-07-28 17:44:05,189 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-28 17:44:05,189 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-28 17:44:05,189 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2020-07-28 17:44:05,189 WARN L170 areAnnotationChecker]: L149-1 has no Hoare annotation [2020-07-28 17:44:05,189 WARN L170 areAnnotationChecker]: L149-1 has no Hoare annotation [2020-07-28 17:44:05,189 WARN L170 areAnnotationChecker]: L149-5 has no Hoare annotation [2020-07-28 17:44:05,189 WARN L170 areAnnotationChecker]: L149-5 has no Hoare annotation [2020-07-28 17:44:05,189 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2020-07-28 17:44:05,189 WARN L170 areAnnotationChecker]: L128-3 has no Hoare annotation [2020-07-28 17:44:05,189 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2020-07-28 17:44:05,189 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2020-07-28 17:44:05,190 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2020-07-28 17:44:05,190 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:44:05,190 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2020-07-28 17:44:05,190 WARN L170 areAnnotationChecker]: L128-1 has no Hoare annotation [2020-07-28 17:44:05,190 WARN L170 areAnnotationChecker]: L128-3 has no Hoare annotation [2020-07-28 17:44:05,190 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:44:05,190 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2020-07-28 17:44:05,190 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:44:05,194 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.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) 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:44:05,201 INFO L168 Benchmark]: Toolchain (without parser) took 39660.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 255.9 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -104.7 MB). Peak memory consumption was 151.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:44:05,201 INFO L168 Benchmark]: CDTParser took 0.29 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:44:05,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:44:05,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:44:05,203 INFO L168 Benchmark]: Boogie Preprocessor took 67.09 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:44:05,204 INFO L168 Benchmark]: RCFGBuilder took 1659.72 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: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:44:05,205 INFO L168 Benchmark]: TraceAbstraction took 37383.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 113.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.9 MB). Peak memory consumption was 119.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:44:05,209 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.29 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 460.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.09 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 1659.72 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: 56.9 MB). Peak memory consumption was 56.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37383.34 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 113.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.9 MB). Peak memory consumption was 119.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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...