./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0960b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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_0960b.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 78c6d2d68aa498895f40ed0a4a24644b21119801 .................................................................................................................................................................................................................................................................................................................. 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 -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_0960b.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 78c6d2d68aa498895f40ed0a4a24644b21119801 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:12:04,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:12:04,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:12:04,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:12:04,813 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:12:04,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:12:04,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:12:04,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:12:04,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:12:04,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:12:04,823 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:12:04,824 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:12:04,824 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:12:04,826 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:12:04,827 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:12:04,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:12:04,829 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:12:04,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:12:04,832 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:12:04,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:12:04,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:12:04,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:12:04,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:12:04,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:12:04,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:12:04,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:12:04,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:12:04,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:12:04,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:12:04,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:12:04,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:12:04,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:12:04,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:12:04,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:12:04,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:12:04,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:12:04,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:12:04,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:12:04,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:12:04,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:12:04,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:12:04,865 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:12:04,890 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:12:04,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:12:04,892 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:12:04,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:12:04,893 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:12:04,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:12:04,893 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:12:04,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:12:04,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:12:04,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:12:04,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:12:04,896 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:12:04,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:12:04,897 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:12:04,897 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:12:04,897 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:12:04,897 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:12:04,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:12:04,898 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:12:04,898 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:12:04,899 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:12:04,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:12:04,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:12:04,900 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:12:04,900 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:12:04,900 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:12:04,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:12:04,901 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:12:04,901 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 -> 78c6d2d68aa498895f40ed0a4a24644b21119801 [2019-11-19 21:12:05,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:12:05,234 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:12:05,237 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:12:05,239 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:12:05,239 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:12:05,240 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0960b.c [2019-11-19 21:12:05,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159aaaff2/4278759bbd4f4fce8df978f9a0e463b5/FLAGf3e1b8e6b [2019-11-19 21:12:05,743 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:12:05,744 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0960b.c [2019-11-19 21:12:05,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159aaaff2/4278759bbd4f4fce8df978f9a0e463b5/FLAGf3e1b8e6b [2019-11-19 21:12:05,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159aaaff2/4278759bbd4f4fce8df978f9a0e463b5 [2019-11-19 21:12:05,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:12:05,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:12:05,783 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:05,783 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:12:05,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:12:05,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:05" (1/1) ... [2019-11-19 21:12:05,791 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d58c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:05, skipping insertion in model container [2019-11-19 21:12:05,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:05" (1/1) ... [2019-11-19 21:12:05,800 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:12:05,850 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:12:06,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:06,074 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:12:06,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:06,221 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:12:06,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:06 WrapperNode [2019-11-19 21:12:06,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:06,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:06,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:12:06,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:12:06,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:06" (1/1) ... [2019-11-19 21:12:06,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:06" (1/1) ... [2019-11-19 21:12:06,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:06,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:12:06,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:12:06,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:12:06,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:06" (1/1) ... [2019-11-19 21:12:06,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:06" (1/1) ... [2019-11-19 21:12:06,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:06" (1/1) ... [2019-11-19 21:12:06,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:06" (1/1) ... [2019-11-19 21:12:06,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:06" (1/1) ... [2019-11-19 21:12:06,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:06" (1/1) ... [2019-11-19 21:12:06,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:06" (1/1) ... [2019-11-19 21:12:06,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:12:06,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:12:06,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:12:06,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:12:06,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:06" (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 [2019-11-19 21:12:06,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:12:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-19 21:12:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 21:12:06,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-19 21:12:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:12:06,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:12:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 21:12:06,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:12:07,106 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:12:07,106 INFO L285 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-19 21:12:07,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:07 BoogieIcfgContainer [2019-11-19 21:12:07,108 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:12:07,109 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:12:07,109 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:12:07,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:12:07,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:12:05" (1/3) ... [2019-11-19 21:12:07,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554c7318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:07, skipping insertion in model container [2019-11-19 21:12:07,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:06" (2/3) ... [2019-11-19 21:12:07,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@554c7318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:07, skipping insertion in model container [2019-11-19 21:12:07,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:07" (3/3) ... [2019-11-19 21:12:07,119 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0960b.c [2019-11-19 21:12:07,131 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:12:07,140 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:12:07,155 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:12:07,185 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:12:07,186 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:12:07,186 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:12:07,186 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:12:07,186 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:12:07,186 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:12:07,187 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:12:07,187 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:12:07,219 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-19 21:12:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:12:07,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:07,234 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:07,235 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:07,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:07,243 INFO L82 PathProgramCache]: Analyzing trace with hash -306140874, now seen corresponding path program 1 times [2019-11-19 21:12:07,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:12:07,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585523463] [2019-11-19 21:12:07,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:12:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:07,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585523463] [2019-11-19 21:12:07,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:07,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:12:07,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865385415] [2019-11-19 21:12:07,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:12:07,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:12:07,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:12:07,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:12:07,497 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-11-19 21:12:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:07,530 INFO L93 Difference]: Finished difference Result 88 states and 146 transitions. [2019-11-19 21:12:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:12:07,531 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-19 21:12:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:07,541 INFO L225 Difference]: With dead ends: 88 [2019-11-19 21:12:07,542 INFO L226 Difference]: Without dead ends: 42 [2019-11-19 21:12:07,545 INFO L630 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 [2019-11-19 21:12:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-19 21:12:07,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-19 21:12:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-19 21:12:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2019-11-19 21:12:07,587 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 12 [2019-11-19 21:12:07,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:07,587 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2019-11-19 21:12:07,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:12:07,588 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2019-11-19 21:12:07,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 21:12:07,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:07,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:07,590 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:07,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:07,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1933005595, now seen corresponding path program 1 times [2019-11-19 21:12:07,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:12:07,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782110874] [2019-11-19 21:12:07,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:12:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:12:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:12:07,911 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:12:07,911 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:12:07,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:12:07 BoogieIcfgContainer [2019-11-19 21:12:07,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:12:07,999 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:12:07,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:12:08,000 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:12:08,001 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:07" (3/4) ... [2019-11-19 21:12:08,006 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 21:12:08,006 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:12:08,010 INFO L168 Benchmark]: Toolchain (without parser) took 2226.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 956.3 MB in the beginning and 1.0 GB in the end (delta: -85.9 MB). Peak memory consumption was 42.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:08,011 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:12:08,013 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:08,015 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:08,016 INFO L168 Benchmark]: Boogie Preprocessor took 49.00 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:08,017 INFO L168 Benchmark]: RCFGBuilder took 722.92 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: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:08,018 INFO L168 Benchmark]: TraceAbstraction took 889.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:08,019 INFO L168 Benchmark]: Witness Printer took 7.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:12:08,035 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 441.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.00 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 722.92 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: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 889.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 34.2 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Witness Printer took 7.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 186]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 27, overapproximation of someUnaryDOUBLEoperation at line 181, overapproximation of someBinaryArithmeticDOUBLEoperation at line 148, overapproximation of bitwiseAnd at line 26. Possible FailurePath: [L32-L41] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L43] static const double zero = 0.0; [L126-L129] static const double two54_log10 = 1.80143985094819840000e+16, ivln10_log10 = 4.34294481903251816668e-01, log10_2hi_log10 = 3.01029995663611771306e-01, log10_2lo_log10 = 3.69423907715893078616e-13; [L131] static const double zero_log10 = 0.0; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L181] double x = -0.0; [L134] double y, z; [L135] __int32_t i, k, hx; [L136] __uint32_t lx; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L139] ieee_double_shape_type ew_u; [L140] ew_u.value = (x) [L141] EXPR ew_u.parts.msw [L141] (hx) = ew_u.parts.msw [L142] EXPR ew_u.parts.lsw [L142] (lx) = ew_u.parts.lsw [L145] k = 0 VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L146] COND TRUE hx < 0x00100000 VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L147] COND TRUE ((hx & 0x7fffffff) | lx) == 0 [L148] return -two54_log10 / zero_log10; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L182] double res = __ieee754_log10(x); [L19] __int32_t hx, lx; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (hx) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lx) = ew_u.parts.lsw [L26] hx &= 0x7fffffff [L27] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L28] hx = 0x7ff00000 - hx [L29] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L185] COND TRUE !isinf_double(res) [L186] __VERIFIER_error() VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 59 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 21:12:10,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:12:10,191 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:12:10,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:12:10,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:12:10,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:12:10,215 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:12:10,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:12:10,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:12:10,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:12:10,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:12:10,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:12:10,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:12:10,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:12:10,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:12:10,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:12:10,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:12:10,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:12:10,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:12:10,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:12:10,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:12:10,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:12:10,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:12:10,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:12:10,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:12:10,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:12:10,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:12:10,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:12:10,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:12:10,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:12:10,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:12:10,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:12:10,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:12:10,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:12:10,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:12:10,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:12:10,284 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:12:10,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:12:10,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:12:10,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:12:10,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:12:10,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 21:12:10,324 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:12:10,325 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:12:10,329 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:12:10,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:12:10,330 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:12:10,330 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:12:10,330 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:12:10,331 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:12:10,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:12:10,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:12:10,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:12:10,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:12:10,333 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 21:12:10,334 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 21:12:10,334 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:12:10,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:12:10,335 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:12:10,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:12:10,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:12:10,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:12:10,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:12:10,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:12:10,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:12:10,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:12:10,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:12:10,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:12:10,338 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 21:12:10,338 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 21:12:10,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:12:10,338 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 21:12:10,339 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 -> 78c6d2d68aa498895f40ed0a4a24644b21119801 [2019-11-19 21:12:10,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:12:10,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:12:10,701 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:12:10,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:12:10,703 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:12:10,704 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0960b.c [2019-11-19 21:12:10,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b988fab6a/900135abb5dd40ebbbde4279e42943dd/FLAG0a007a9bd [2019-11-19 21:12:11,299 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:12:11,301 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0960b.c [2019-11-19 21:12:11,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b988fab6a/900135abb5dd40ebbbde4279e42943dd/FLAG0a007a9bd [2019-11-19 21:12:11,650 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b988fab6a/900135abb5dd40ebbbde4279e42943dd [2019-11-19 21:12:11,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:12:11,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:12:11,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:11,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:12:11,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:12:11,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:11" (1/1) ... [2019-11-19 21:12:11,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@224ac61e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:11, skipping insertion in model container [2019-11-19 21:12:11,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:11" (1/1) ... [2019-11-19 21:12:11,673 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:12:11,702 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:12:11,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:11,976 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:12:12,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:12,140 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:12:12,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:12 WrapperNode [2019-11-19 21:12:12,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:12,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:12,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:12:12,142 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:12:12,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:12" (1/1) ... [2019-11-19 21:12:12,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:12" (1/1) ... [2019-11-19 21:12:12,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:12,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:12:12,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:12:12,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:12:12,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:12" (1/1) ... [2019-11-19 21:12:12,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:12" (1/1) ... [2019-11-19 21:12:12,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:12" (1/1) ... [2019-11-19 21:12:12,222 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:12" (1/1) ... [2019-11-19 21:12:12,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:12" (1/1) ... [2019-11-19 21:12:12,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:12" (1/1) ... [2019-11-19 21:12:12,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:12" (1/1) ... [2019-11-19 21:12:12,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:12:12,258 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:12:12,258 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:12:12,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:12:12,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:12" (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 [2019-11-19 21:12:12,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-19 21:12:12,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-19 21:12:12,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:12:12,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 21:12:12,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:12:12,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:12:12,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 21:12:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:12:43,706 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:12:43,706 INFO L285 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-19 21:12:43,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:43 BoogieIcfgContainer [2019-11-19 21:12:43,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:12:43,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:12:43,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:12:43,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:12:43,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:12:11" (1/3) ... [2019-11-19 21:12:43,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbe46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:43, skipping insertion in model container [2019-11-19 21:12:43,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:12" (2/3) ... [2019-11-19 21:12:43,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbe46a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:43, skipping insertion in model container [2019-11-19 21:12:43,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:43" (3/3) ... [2019-11-19 21:12:43,715 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0960b.c [2019-11-19 21:12:43,724 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:12:43,732 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:12:43,742 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:12:43,767 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:12:43,767 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:12:43,767 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:12:43,767 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:12:43,767 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:12:43,768 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:12:43,768 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:12:43,768 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:12:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-11-19 21:12:43,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:12:43,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:43,790 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:43,790 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:43,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:43,797 INFO L82 PathProgramCache]: Analyzing trace with hash -306140874, now seen corresponding path program 1 times [2019-11-19 21:12:43,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:43,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317925087] [2019-11-19 21:12:43,810 INFO L94 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 [2019-11-19 21:12:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:44,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 21:12:44,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:44,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:44,813 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:44,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:44,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317925087] [2019-11-19 21:12:44,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:44,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 21:12:44,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881702482] [2019-11-19 21:12:44,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:12:44,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:44,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:12:44,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:12:44,836 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-11-19 21:12:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:44,857 INFO L93 Difference]: Finished difference Result 88 states and 146 transitions. [2019-11-19 21:12:44,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:12:44,858 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-19 21:12:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:44,869 INFO L225 Difference]: With dead ends: 88 [2019-11-19 21:12:44,869 INFO L226 Difference]: Without dead ends: 42 [2019-11-19 21:12:44,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:12:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-19 21:12:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-19 21:12:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-19 21:12:44,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2019-11-19 21:12:44,911 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 12 [2019-11-19 21:12:44,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:44,912 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2019-11-19 21:12:44,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:12:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2019-11-19 21:12:44,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 21:12:44,914 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:44,914 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:45,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-19 21:12:45,129 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:45,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:45,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1933005595, now seen corresponding path program 1 times [2019-11-19 21:12:45,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:45,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706028400] [2019-11-19 21:12:45,134 INFO L94 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 [2019-11-19 21:12:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:46,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 21:12:46,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:46,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2019-11-19 21:12:46,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 21:12:46,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2019-11-19 21:12:46,427 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:46,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:46,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-19 21:12:46,489 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:46,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:46,530 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:46,531 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2019-11-19 21:12:46,532 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:46,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:46,552 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:46,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:46,580 INFO L496 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. [2019-11-19 21:12:46,580 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:88, output treesize:33 [2019-11-19 21:12:46,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:46,825 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:47,074 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:47,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 149 treesize of output 141 [2019-11-19 21:12:47,145 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:47,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 89 treesize of output 102 [2019-11-19 21:12:47,149 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:47,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:47,220 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-19 21:12:47,222 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:47,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:47,267 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:47,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 54 [2019-11-19 21:12:47,271 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:47,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:47,297 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:47,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:47,329 INFO L496 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. [2019-11-19 21:12:47,330 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:159, output treesize:65 [2019-11-19 21:12:50,263 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_4_3 (_ BitVec 64)) (v_skolemized_v_prenex_5_3 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) v_skolemized_v_prenex_4_3)) (.cse1 ((_ extract 63 32) v_skolemized_v_prenex_5_3))) (or (not (= (bvadd (bvneg (bvlshr (let ((.cse0 (bvadd (bvneg (bvor (bvand (_ bv2147483647 32) .cse1) (bvlshr (bvor .cse2 (bvneg .cse2)) (_ bv31 32)))) (_ bv2146435072 32)))) (bvor .cse0 (bvneg .cse0))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32))) (not (= (fp.div roundNearestTiesToEven (fp.neg c_~two54_log10~0) c_~zero_log10~0) (fp ((_ extract 63 63) v_skolemized_v_prenex_4_3) ((_ extract 62 52) v_skolemized_v_prenex_4_3) ((_ extract 51 0) v_skolemized_v_prenex_4_3)))) (not (= ((_ extract 31 0) v_skolemized_v_prenex_5_3) .cse2)) (not (= .cse1 ((_ extract 63 32) v_skolemized_v_prenex_4_3)))))) is different from false [2019-11-19 21:12:52,672 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_4_3 (_ BitVec 64)) (v_skolemized_v_prenex_5_3 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) v_skolemized_v_prenex_4_3)) (.cse1 ((_ extract 63 32) v_skolemized_v_prenex_5_3))) (or (not (= (bvadd (bvneg (bvlshr (let ((.cse0 (bvadd (bvneg (bvor (bvand (_ bv2147483647 32) .cse1) (bvlshr (bvor .cse2 (bvneg .cse2)) (_ bv31 32)))) (_ bv2146435072 32)))) (bvor .cse0 (bvneg .cse0))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32))) (not (= (fp.div roundNearestTiesToEven (fp.neg c_~two54_log10~0) c_~zero_log10~0) (fp ((_ extract 63 63) v_skolemized_v_prenex_4_3) ((_ extract 62 52) v_skolemized_v_prenex_4_3) ((_ extract 51 0) v_skolemized_v_prenex_4_3)))) (not (= ((_ extract 31 0) v_skolemized_v_prenex_5_3) .cse2)) (not (= .cse1 ((_ extract 63 32) v_skolemized_v_prenex_4_3)))))) is different from true [2019-11-19 21:12:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:12:52,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706028400] [2019-11-19 21:12:52,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:52,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-19 21:12:52,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114403179] [2019-11-19 21:12:52,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 21:12:52,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:52,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 21:12:52,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=128, Unknown=2, NotChecked=22, Total=182 [2019-11-19 21:12:52,702 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand 14 states. [2019-11-19 21:13:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:13:03,079 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-11-19 21:13:03,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 21:13:03,220 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-11-19 21:13:03,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:13:03,221 INFO L225 Difference]: With dead ends: 50 [2019-11-19 21:13:03,221 INFO L226 Difference]: Without dead ends: 42 [2019-11-19 21:13:03,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=79, Invalid=229, Unknown=2, NotChecked=32, Total=342 [2019-11-19 21:13:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-19 21:13:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-19 21:13:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-19 21:13:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2019-11-19 21:13:03,229 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 14 [2019-11-19 21:13:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:13:03,230 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-11-19 21:13:03,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 21:13:03,230 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2019-11-19 21:13:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-19 21:13:03,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:13:03,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:13:03,446 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-19 21:13:03,447 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:13:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:13:03,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2124356858, now seen corresponding path program 1 times [2019-11-19 21:13:03,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:13:03,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774640928] [2019-11-19 21:13:03,451 INFO L94 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 [2019-11-19 21:13:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:13:03,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 21:13:03,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:13:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:13:03,659 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:13:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:13:03,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774640928] [2019-11-19 21:13:03,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:13:03,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 21:13:03,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619439107] [2019-11-19 21:13:03,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:13:03,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:13:03,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:13:03,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:13:03,705 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 6 states. [2019-11-19 21:13:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:13:05,797 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2019-11-19 21:13:05,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:13:05,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-19 21:13:05,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:13:05,836 INFO L225 Difference]: With dead ends: 50 [2019-11-19 21:13:05,836 INFO L226 Difference]: Without dead ends: 16 [2019-11-19 21:13:05,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:13:05,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-19 21:13:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-19 21:13:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-19 21:13:05,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2019-11-19 21:13:05,841 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 14 [2019-11-19 21:13:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:13:05,842 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2019-11-19 21:13:05,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:13:05,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2019-11-19 21:13:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 21:13:05,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:13:05,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:13:06,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-19 21:13:06,054 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:13:06,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:13:06,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1233905145, now seen corresponding path program 1 times [2019-11-19 21:13:06,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:13:06,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530005846] [2019-11-19 21:13:06,057 INFO L94 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 [2019-11-19 21:13:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:13:07,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 21:13:07,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:13:07,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2019-11-19 21:13:07,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 21:13:07,279 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2019-11-19 21:13:07,281 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:07,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:07,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-19 21:13:07,327 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:07,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:07,375 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:07,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2019-11-19 21:13:07,377 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:07,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:07,403 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:13:07,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:07,422 INFO L496 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. [2019-11-19 21:13:07,422 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:28 [2019-11-19 21:13:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:13:07,455 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:13:07,538 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:07,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 54 [2019-11-19 21:13:07,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-11-19 21:13:07,554 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:07,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:07,577 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:07,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2019-11-19 21:13:07,578 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:07,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:07,582 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:13:07,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:07,594 INFO L496 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. [2019-11-19 21:13:07,595 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:68, output treesize:26 [2019-11-19 21:13:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:13:07,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530005846] [2019-11-19 21:13:07,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:13:07,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 2] imperfect sequences [] total 5 [2019-11-19 21:13:07,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389669923] [2019-11-19 21:13:07,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:13:07,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:13:07,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:13:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:13:07,636 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 5 states. [2019-11-19 21:13:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:13:07,638 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2019-11-19 21:13:07,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:13:07,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-19 21:13:07,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:13:07,639 INFO L225 Difference]: With dead ends: 16 [2019-11-19 21:13:07,639 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:13:07,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:13:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:13:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:13:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:13:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:13:07,641 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-11-19 21:13:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:13:07,641 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:13:07,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:13:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:13:07,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:13:07,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-19 21:13:07,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:13:08,027 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 92) no Hoare annotation was computed. [2019-11-19 21:13:08,027 INFO L444 ceAbstractionStarter]: For program point L94(lines 94 99) no Hoare annotation was computed. [2019-11-19 21:13:08,028 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:13:08,028 INFO L444 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2019-11-19 21:13:08,028 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:13:08,028 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 188) no Hoare annotation was computed. [2019-11-19 21:13:08,028 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 122) no Hoare annotation was computed. [2019-11-19 21:13:08,028 INFO L444 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-11-19 21:13:08,028 INFO L444 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2019-11-19 21:13:08,029 INFO L440 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg .cse1) (_ +zero 11 53)))) (and (= (_ +zero 11 53) ~zero_log10~0) (= |ULTIMATE.start___ieee754_log10_#res| .cse0) (= .cse1 ~two54_log10~0) (= .cse0 ULTIMATE.start_isinf_double_~x)))) [2019-11-19 21:13:08,029 INFO L444 ceAbstractionStarter]: For program point L20-3(lines 20 25) no Hoare annotation was computed. [2019-11-19 21:13:08,029 INFO L444 ceAbstractionStarter]: For program point L111(lines 111 123) no Hoare annotation was computed. [2019-11-19 21:13:08,030 INFO L440 ceAbstractionStarter]: At program point L29(lines 18 30) the Hoare annotation is: (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg .cse1) (_ +zero 11 53)))) (and (= (_ +zero 11 53) ~zero_log10~0) (= |ULTIMATE.start___ieee754_log10_#res| .cse0) (= .cse1 ~two54_log10~0) (exists ((v_skolemized_v_prenex_4_3 (_ BitVec 64)) (v_skolemized_v_prenex_5_3 (_ BitVec 64))) (let ((.cse4 ((_ extract 31 0) v_skolemized_v_prenex_4_3)) (.cse3 ((_ extract 63 32) v_skolemized_v_prenex_4_3))) (and (= (bvadd (bvneg (bvlshr (let ((.cse2 (bvadd (bvneg (bvor (bvand (_ bv2147483647 32) .cse3) (bvlshr (bvor .cse4 (bvneg .cse4)) (_ bv31 32)))) (_ bv2146435072 32)))) (bvor .cse2 (bvneg .cse2))) (_ bv31 32))) (_ bv1 32)) |ULTIMATE.start_isinf_double_#res|) (= ((_ extract 31 0) v_skolemized_v_prenex_5_3) .cse4) (= ((_ extract 63 32) v_skolemized_v_prenex_5_3) .cse3) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_skolemized_v_prenex_4_3) ((_ extract 62 52) v_skolemized_v_prenex_4_3) ((_ extract 51 0) v_skolemized_v_prenex_4_3)))))) (= .cse0 ULTIMATE.start_isinf_double_~x)))) [2019-11-19 21:13:08,030 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-19 21:13:08,030 INFO L444 ceAbstractionStarter]: For program point L153-1(lines 153 157) no Hoare annotation was computed. [2019-11-19 21:13:08,030 INFO L440 ceAbstractionStarter]: At program point L153-2(lines 153 157) the Hoare annotation is: false [2019-11-19 21:13:08,030 INFO L444 ceAbstractionStarter]: For program point L146(lines 146 158) no Hoare annotation was computed. [2019-11-19 21:13:08,031 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 133 173) no Hoare annotation was computed. [2019-11-19 21:13:08,031 INFO L444 ceAbstractionStarter]: For program point L113(lines 113 117) no Hoare annotation was computed. [2019-11-19 21:13:08,032 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 138 143) no Hoare annotation was computed. [2019-11-19 21:13:08,032 INFO L440 ceAbstractionStarter]: At program point L138-2(lines 138 143) the Hoare annotation is: false [2019-11-19 21:13:08,032 INFO L444 ceAbstractionStarter]: For program point L138-3(lines 138 143) no Hoare annotation was computed. [2019-11-19 21:13:08,032 INFO L440 ceAbstractionStarter]: At program point L122(lines 45 124) the Hoare annotation is: false [2019-11-19 21:13:08,033 INFO L444 ceAbstractionStarter]: For program point L147(lines 147 148) no Hoare annotation was computed. [2019-11-19 21:13:08,033 INFO L440 ceAbstractionStarter]: At program point L172(lines 133 173) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0))) (and (= (_ +zero 11 53) ~zero_log10~0) (= |ULTIMATE.start___ieee754_log10_#res| (fp.div roundNearestTiesToEven (fp.neg .cse0) (_ +zero 11 53))) (= .cse0 ~two54_log10~0))) [2019-11-19 21:13:08,033 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2019-11-19 21:13:08,033 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:13:08,033 INFO L440 ceAbstractionStarter]: At program point L65-2(lines 65 69) the Hoare annotation is: false [2019-11-19 21:13:08,034 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 186) no Hoare annotation was computed. [2019-11-19 21:13:08,034 INFO L444 ceAbstractionStarter]: For program point L165-1(lines 165 170) no Hoare annotation was computed. [2019-11-19 21:13:08,034 INFO L440 ceAbstractionStarter]: At program point L165-2(lines 165 170) the Hoare annotation is: false [2019-11-19 21:13:08,034 INFO L444 ceAbstractionStarter]: For program point L165-3(lines 165 170) no Hoare annotation was computed. [2019-11-19 21:13:08,035 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:13:08,035 INFO L447 ceAbstractionStarter]: At program point L190(lines 175 191) the Hoare annotation is: true [2019-11-19 21:13:08,035 INFO L444 ceAbstractionStarter]: For program point L58(lines 58 70) no Hoare annotation was computed. [2019-11-19 21:13:08,035 INFO L444 ceAbstractionStarter]: For program point L58-1(lines 45 124) no Hoare annotation was computed. [2019-11-19 21:13:08,035 INFO L444 ceAbstractionStarter]: For program point L149(lines 149 150) no Hoare annotation was computed. [2019-11-19 21:13:08,036 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 50 55) no Hoare annotation was computed. [2019-11-19 21:13:08,036 INFO L440 ceAbstractionStarter]: At program point L50-2(lines 50 55) the Hoare annotation is: false [2019-11-19 21:13:08,036 INFO L444 ceAbstractionStarter]: For program point L50-3(lines 50 55) no Hoare annotation was computed. [2019-11-19 21:13:08,036 INFO L444 ceAbstractionStarter]: For program point L59(lines 59 60) no Hoare annotation was computed. [2019-11-19 21:13:08,037 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 100) no Hoare annotation was computed. [2019-11-19 21:13:08,037 INFO L444 ceAbstractionStarter]: For program point L76-1(lines 76 81) no Hoare annotation was computed. [2019-11-19 21:13:08,037 INFO L440 ceAbstractionStarter]: At program point L76-2(lines 76 81) the Hoare annotation is: false [2019-11-19 21:13:08,037 INFO L444 ceAbstractionStarter]: For program point L76-3(lines 76 81) no Hoare annotation was computed. [2019-11-19 21:13:08,048 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,049 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,049 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,053 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,053 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,053 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,054 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,055 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,055 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,056 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,056 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,057 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,057 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,058 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,058 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,058 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,060 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,061 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,061 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:13:08,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:13:08,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,065 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,066 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,067 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,067 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,068 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,069 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,069 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,071 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:13:08,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:13:08,072 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,072 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,073 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,073 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,074 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,074 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:13:08 BoogieIcfgContainer [2019-11-19 21:13:08,077 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:13:08,078 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:13:08,078 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:13:08,078 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:13:08,079 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:43" (3/4) ... [2019-11-19 21:13:08,082 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:13:08,096 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-19 21:13:08,097 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-11-19 21:13:08,097 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 21:13:08,126 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~Pluszero~LONGDOUBLE() == zero_log10 && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10 [2019-11-19 21:13:08,127 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~Pluszero~LONGDOUBLE() == zero_log10 && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) == x [2019-11-19 21:13:08,128 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~Pluszero~LONGDOUBLE() == zero_log10 && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && (\exists v_skolemized_v_prenex_4_3 : bv64, v_skolemized_v_prenex_5_3 : bv64 :: ((~bvadd64(~bvneg32(~bvlshr32(~bvor32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_skolemized_v_prenex_4_3[63:32]), ~bvlshr32(~bvor32(v_skolemized_v_prenex_4_3[31:0], ~bvneg32(v_skolemized_v_prenex_4_3[31:0])), 31bv32))), 2146435072bv32), ~bvneg32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_skolemized_v_prenex_4_3[63:32]), ~bvlshr32(~bvor32(v_skolemized_v_prenex_4_3[31:0], ~bvneg32(v_skolemized_v_prenex_4_3[31:0])), 31bv32))), 2146435072bv32))), 31bv32)), 1bv32) == \result && v_skolemized_v_prenex_5_3[31:0] == v_skolemized_v_prenex_4_3[31:0]) && v_skolemized_v_prenex_5_3[63:32] == v_skolemized_v_prenex_4_3[63:32]) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_v_prenex_4_3[63:63], v_skolemized_v_prenex_4_3[62:52], v_skolemized_v_prenex_4_3[51:0]))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) == x [2019-11-19 21:13:08,201 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:13:08,202 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:13:08,203 INFO L168 Benchmark]: Toolchain (without parser) took 56547.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 961.7 MB in the beginning and 779.5 MB in the end (delta: 182.2 MB). Peak memory consumption was 271.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:13:08,204 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:13:08,204 INFO L168 Benchmark]: CACSL2BoogieTranslator took 483.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -114.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:13:08,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:13:08,205 INFO L168 Benchmark]: Boogie Preprocessor took 52.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:13:08,206 INFO L168 Benchmark]: RCFGBuilder took 31449.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. [2019-11-19 21:13:08,206 INFO L168 Benchmark]: TraceAbstraction took 24369.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 786.5 MB in the end (delta: 240.7 MB). Peak memory consumption was 240.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:13:08,207 INFO L168 Benchmark]: Witness Printer took 123.98 ms. Allocated memory is still 1.1 GB. Free memory was 786.5 MB in the beginning and 779.5 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:13:08,210 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 483.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -114.4 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 31449.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24369.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 786.5 MB in the end (delta: 240.7 MB). Peak memory consumption was 240.7 MB. Max. memory is 11.5 GB. * Witness Printer took 123.98 ms. Allocated memory is still 1.1 GB. Free memory was 786.5 MB in the beginning and 779.5 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 186]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 133]: Loop Invariant [2019-11-19 21:13:08,226 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,227 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,228 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,228 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,228 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~Pluszero~LONGDOUBLE() == zero_log10 && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant [2019-11-19 21:13:08,229 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,229 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,230 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,231 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,232 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,232 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,232 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~Pluszero~LONGDOUBLE() == zero_log10 && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 18]: Loop Invariant [2019-11-19 21:13:08,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,233 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,234 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,234 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,235 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,236 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:13:08,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:13:08,237 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,237 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,238 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,238 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,239 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,239 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,240 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,241 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,241 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,241 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,242 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,243 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:13:08,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-19 21:13:08,244 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,244 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,245 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,245 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,246 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-19 21:13:08,246 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:08,246 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((~Pluszero~LONGDOUBLE() == zero_log10 && \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && (\exists v_skolemized_v_prenex_4_3 : bv64, v_skolemized_v_prenex_5_3 : bv64 :: ((~bvadd64(~bvneg32(~bvlshr32(~bvor32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_skolemized_v_prenex_4_3[63:32]), ~bvlshr32(~bvor32(v_skolemized_v_prenex_4_3[31:0], ~bvneg32(v_skolemized_v_prenex_4_3[31:0])), 31bv32))), 2146435072bv32), ~bvneg32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_skolemized_v_prenex_4_3[63:32]), ~bvlshr32(~bvor32(v_skolemized_v_prenex_4_3[31:0], ~bvneg32(v_skolemized_v_prenex_4_3[31:0])), 31bv32))), 2146435072bv32))), 31bv32)), 1bv32) == \result && v_skolemized_v_prenex_5_3[31:0] == v_skolemized_v_prenex_4_3[31:0]) && v_skolemized_v_prenex_5_3[63:32] == v_skolemized_v_prenex_4_3[63:32]) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_v_prenex_4_3[63:63], v_skolemized_v_prenex_4_3[62:52], v_skolemized_v_prenex_4_3[51:0]))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. Result: SAFE, OverallTime: 24.2s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 119 SDtfs, 108 SDslu, 443 SDs, 0 SdLazy, 71 SolverSat, 4 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 15 NumberOfFragments, 148 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 102 ConstructedInterpolants, 20 QuantifiedInterpolants, 15593 SizeOfPredicates, 21 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...