./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0876.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0876.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer --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 8bfdae4edc85300c20dcba60dd2bfdca9c4b845a ............................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0876.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer --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 8bfdae4edc85300c20dcba60dd2bfdca9c4b845a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:26:20,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:26:20,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:26:20,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:26:20,792 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:26:20,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:26:20,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:26:20,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:26:20,799 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:26:20,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:26:20,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:26:20,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:26:20,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:26:20,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:26:20,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:26:20,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:26:20,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:26:20,806 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:26:20,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:26:20,810 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:26:20,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:26:20,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:26:20,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:26:20,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:26:20,816 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:26:20,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:26:20,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:26:20,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:26:20,818 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:26:20,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:26:20,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:26:20,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:26:20,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:26:20,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:26:20,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:26:20,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:26:20,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:26:20,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:26:20,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:26:20,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:26:20,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:26:20,826 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:26:20,838 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:26:20,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:26:20,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:26:20,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:26:20,842 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:26:20,842 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:26:20,842 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:26:20,843 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:26:20,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:26:20,843 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:26:20,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:26:20,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:26:20,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:26:20,845 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:26:20,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:26:20,845 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:26:20,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:26:20,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:26:20,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:26:20,846 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:26:20,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:26:20,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:26:20,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:26:20,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:26:20,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:26:20,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:26:20,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:26:20,848 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:26:20,848 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer 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 -> 8bfdae4edc85300c20dcba60dd2bfdca9c4b845a [2019-11-15 23:26:20,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:26:20,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:26:20,919 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:26:20,923 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:26:20,923 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:26:20,924 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0876.c [2019-11-15 23:26:20,984 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/data/26c40ebc6/10a4cd0383634c6c9b1136979a883c5c/FLAGaa2eebdb1 [2019-11-15 23:26:21,476 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:26:21,477 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/sv-benchmarks/c/float-newlib/double_req_bl_0876.c [2019-11-15 23:26:21,491 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/data/26c40ebc6/10a4cd0383634c6c9b1136979a883c5c/FLAGaa2eebdb1 [2019-11-15 23:26:21,768 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/data/26c40ebc6/10a4cd0383634c6c9b1136979a883c5c [2019-11-15 23:26:21,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:26:21,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:26:21,773 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:21,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:26:21,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:26:21,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:21" (1/1) ... [2019-11-15 23:26:21,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b7dd61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:21, skipping insertion in model container [2019-11-15 23:26:21,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:21" (1/1) ... [2019-11-15 23:26:21,786 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:26:21,819 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:26:22,090 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:835) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.handleNaNOrInfinity(StandardFunctionHandler.java:1593) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.lambda$35(StandardFunctionHandler.java:317) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:210) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1262) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleReturnStatement(FunctionHandler.java:540) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1832) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1455) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:906) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1432) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:906) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1284) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2176) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:540) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:187) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:114) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:92) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 23:26:22,096 INFO L168 Benchmark]: Toolchain (without parser) took 323.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -222.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:22,097 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:26:22,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -222.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:26:22,099 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -222.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: createNanOrInfinity is unsupported in non-bitprecise translation: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.createNanOrInfinity(IntegerTranslation.java:835) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:26:23,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:26:23,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:26:23,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:26:23,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:26:23,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:26:23,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:26:23,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:26:23,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:26:23,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:26:23,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:26:23,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:26:23,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:26:23,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:26:23,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:26:23,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:26:23,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:26:23,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:26:23,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:26:23,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:26:23,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:26:23,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:26:23,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:26:23,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:26:23,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:26:23,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:26:23,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:26:23,906 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:26:23,907 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:26:23,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:26:23,908 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:26:23,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:26:23,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:26:23,911 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:26:23,912 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:26:23,912 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:26:23,913 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:26:23,913 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:26:23,913 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:26:23,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:26:23,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:26:23,915 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:26:23,928 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:26:23,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:26:23,931 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:26:23,931 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:26:23,931 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:26:23,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:26:23,932 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:26:23,932 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:26:23,932 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:26:23,932 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:26:23,932 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:26:23,932 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:26:23,933 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:26:23,933 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:26:23,933 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:26:23,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:26:23,933 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:26:23,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:26:23,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:26:23,934 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:26:23,934 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:26:23,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:26:23,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:26:23,935 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:26:23,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:26:23,935 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:26:23,935 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:26:23,935 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:26:23,936 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:26:23,936 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:26:23,936 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer 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 -> 8bfdae4edc85300c20dcba60dd2bfdca9c4b845a [2019-11-15 23:26:23,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:26:23,984 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:26:23,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:26:23,989 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:26:23,990 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:26:23,990 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0876.c [2019-11-15 23:26:24,039 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/data/084a80992/80d02fe6565d4dcd847bbe8efda5832a/FLAGd1b9fc67e [2019-11-15 23:26:24,484 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:26:24,485 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/sv-benchmarks/c/float-newlib/double_req_bl_0876.c [2019-11-15 23:26:24,497 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/data/084a80992/80d02fe6565d4dcd847bbe8efda5832a/FLAGd1b9fc67e [2019-11-15 23:26:24,507 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/data/084a80992/80d02fe6565d4dcd847bbe8efda5832a [2019-11-15 23:26:24,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:26:24,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:26:24,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:24,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:26:24,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:26:24,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:24" (1/1) ... [2019-11-15 23:26:24,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f23fcad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:24, skipping insertion in model container [2019-11-15 23:26:24,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:26:24" (1/1) ... [2019-11-15 23:26:24,525 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:26:24,560 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:26:24,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:24,924 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:26:25,056 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:26:25,084 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:26:25,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:25 WrapperNode [2019-11-15 23:26:25,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:26:25,086 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:25,086 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:26:25,086 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:26:25,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:25" (1/1) ... [2019-11-15 23:26:25,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:25" (1/1) ... [2019-11-15 23:26:25,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:26:25,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:26:25,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:26:25,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:26:25,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:25" (1/1) ... [2019-11-15 23:26:25,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:25" (1/1) ... [2019-11-15 23:26:25,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:25" (1/1) ... [2019-11-15 23:26:25,261 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:25" (1/1) ... [2019-11-15 23:26:25,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:25" (1/1) ... [2019-11-15 23:26:25,351 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:25" (1/1) ... [2019-11-15 23:26:25,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:25" (1/1) ... [2019-11-15 23:26:25,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:26:25,392 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:26:25,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:26:25,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:26:25,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/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-15 23:26:25,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-15 23:26:25,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-15 23:26:25,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:26:25,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-15 23:26:25,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:26:25,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:26:25,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:26:25,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:26:25,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:27:12,907 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:27:12,907 INFO L284 CfgBuilder]: Removed 98 assume(true) statements. [2019-11-15 23:27:12,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:27:12 BoogieIcfgContainer [2019-11-15 23:27:12,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:27:12,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:27:12,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:27:12,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:27:12,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:26:24" (1/3) ... [2019-11-15 23:27:12,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a55cb5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:27:12, skipping insertion in model container [2019-11-15 23:27:12,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:26:25" (2/3) ... [2019-11-15 23:27:12,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a55cb5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:27:12, skipping insertion in model container [2019-11-15 23:27:12,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:27:12" (3/3) ... [2019-11-15 23:27:12,915 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0876.c [2019-11-15 23:27:12,922 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:27:12,930 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:27:12,940 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:27:12,966 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:27:12,966 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:27:12,966 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:27:12,967 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:27:12,967 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:27:12,967 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:27:12,967 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:27:12,968 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:27:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states. [2019-11-15 23:27:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:27:12,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:12,994 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:12,996 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:13,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:13,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1484062990, now seen corresponding path program 1 times [2019-11-15 23:27:13,012 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:13,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383137243] [2019-11-15 23:27:13,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/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-15 23:27:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:13,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 23:27:13,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:13,308 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-15 23:27:13,308 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:13,317 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-15 23:27:13,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383137243] [2019-11-15 23:27:13,321 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:13,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 23:27:13,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305987338] [2019-11-15 23:27:13,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:27:13,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:27:13,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:27:13,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:27:13,352 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 2 states. [2019-11-15 23:27:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:13,432 INFO L93 Difference]: Finished difference Result 444 states and 758 transitions. [2019-11-15 23:27:13,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:27:13,434 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-15 23:27:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:13,458 INFO L225 Difference]: With dead ends: 444 [2019-11-15 23:27:13,459 INFO L226 Difference]: Without dead ends: 219 [2019-11-15 23:27:13,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:27:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-11-15 23:27:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2019-11-15 23:27:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-15 23:27:13,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 298 transitions. [2019-11-15 23:27:13,524 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 298 transitions. Word has length 15 [2019-11-15 23:27:13,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:13,525 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 298 transitions. [2019-11-15 23:27:13,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:27:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 298 transitions. [2019-11-15 23:27:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:27:13,527 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:13,527 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:13,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 23:27:13,741 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:13,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:13,741 INFO L82 PathProgramCache]: Analyzing trace with hash 441555186, now seen corresponding path program 1 times [2019-11-15 23:27:13,742 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:13,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749640532] [2019-11-15 23:27:13,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/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-15 23:27:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:14,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:27:14,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:14,157 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-15 23:27:14,157 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:14,371 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-15 23:27:14,372 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749640532] [2019-11-15 23:27:14,372 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:14,372 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-15 23:27:14,372 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120630022] [2019-11-15 23:27:14,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:27:14,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:27:14,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:27:14,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:27:14,376 INFO L87 Difference]: Start difference. First operand 219 states and 298 transitions. Second operand 10 states. [2019-11-15 23:27:20,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:20,410 INFO L93 Difference]: Finished difference Result 354 states and 474 transitions. [2019-11-15 23:27:20,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:27:20,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-15 23:27:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:20,564 INFO L225 Difference]: With dead ends: 354 [2019-11-15 23:27:20,564 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 23:27:20,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:27:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 23:27:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 145. [2019-11-15 23:27:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-15 23:27:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 179 transitions. [2019-11-15 23:27:20,580 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 179 transitions. Word has length 19 [2019-11-15 23:27:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:20,581 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 179 transitions. [2019-11-15 23:27:20,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:27:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2019-11-15 23:27:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:27:20,582 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:20,582 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:20,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 23:27:20,797 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:20,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:20,797 INFO L82 PathProgramCache]: Analyzing trace with hash 654842519, now seen corresponding path program 1 times [2019-11-15 23:27:20,798 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:20,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706680143] [2019-11-15 23:27:20,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/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-15 23:27:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:21,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 23:27:21,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:21,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-15 23:27:21,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-15 23:27:21,164 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:21,170 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:21,170 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:21,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:21,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:21,194 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2019-11-15 23:27:23,524 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_74|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_73|))) (= c_ULTIMATE.start___ieee754_pow_~hx~2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|)) (fp.lt (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|)) v_arrayElimCell_2))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) is different from true [2019-11-15 23:27:23,916 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-15 23:27:23,916 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:28,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2019-11-15 23:27:28,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-15 23:27:28,688 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:28,697 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:28,697 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:28,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:28,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:28,722 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:73, output treesize:46 [2019-11-15 23:27:28,993 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-15 23:27:28,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706680143] [2019-11-15 23:27:28,994 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:28,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 18 [2019-11-15 23:27:28,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277588362] [2019-11-15 23:27:28,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:27:28,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:27:28,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:27:28,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=233, Unknown=1, NotChecked=30, Total=306 [2019-11-15 23:27:28,995 INFO L87 Difference]: Start difference. First operand 145 states and 179 transitions. Second operand 18 states. [2019-11-15 23:27:37,369 WARN L191 SmtUtils]: Spent 4.29 s on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-11-15 23:27:39,632 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-15 23:27:40,069 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 23:27:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:44,220 INFO L93 Difference]: Finished difference Result 164 states and 198 transitions. [2019-11-15 23:27:44,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:27:44,232 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-11-15 23:27:44,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:44,233 INFO L225 Difference]: With dead ends: 164 [2019-11-15 23:27:44,233 INFO L226 Difference]: Without dead ends: 63 [2019-11-15 23:27:44,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=135, Invalid=467, Unknown=2, NotChecked=46, Total=650 [2019-11-15 23:27:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-15 23:27:44,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2019-11-15 23:27:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-15 23:27:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2019-11-15 23:27:44,242 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 21 [2019-11-15 23:27:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:44,242 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-11-15 23:27:44,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:27:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2019-11-15 23:27:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:27:44,244 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:44,244 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:44,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 23:27:44,455 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash 656689561, now seen corresponding path program 1 times [2019-11-15 23:27:44,455 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:44,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419322875] [2019-11-15 23:27:44,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/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-15 23:27:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:44,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-15 23:27:44,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:44,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-15 23:27:44,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-15 23:27:44,875 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:44,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:44,880 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:44,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:44,904 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:44,905 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:42 [2019-11-15 23:27:45,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-15 23:27:45,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:27:45,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 24 treesize of output 27 [2019-11-15 23:27:45,538 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:45,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:45,561 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:45,561 INFO L375 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 24 treesize of output 12 [2019-11-15 23:27:45,562 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:45,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:45,564 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:27:45,609 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:45,610 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:45,610 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:96, output treesize:68 [2019-11-15 23:27:45,866 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-15 23:27:45,866 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:46,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 23:27:46,048 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:46,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2019-11-15 23:27:46,063 INFO L375 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 19 treesize of output 11 [2019-11-15 23:27:46,063 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:46,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:46,071 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:27:46,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:46,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2019-11-15 23:27:46,108 INFO L375 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 19 treesize of output 11 [2019-11-15 23:27:46,108 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:46,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:46,117 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:27:46,165 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:46,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 51 [2019-11-15 23:27:46,207 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:46,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 30 [2019-11-15 23:27:46,208 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:46,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:46,251 INFO L375 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 26 treesize of output 14 [2019-11-15 23:27:46,252 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:46,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:46,264 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:27:46,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:46,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2019-11-15 23:27:46,296 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:46,296 INFO L375 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-15 23:27:46,297 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-15 23:27:46,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:46,308 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:27:46,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:46,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-11-15 23:27:46,372 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:170, output treesize:75 [2019-11-15 23:27:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:27:47,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2019-11-15 23:27:47,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-15 23:27:47,161 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:47,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:47,186 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:47,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:47,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2019-11-15 23:27:47,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-15 23:27:47,290 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:47,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:47,319 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:27:47,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:27:47,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-15 23:27:47,380 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:147, output treesize:93 [2019-11-15 23:27:47,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:47,990 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-15 23:27:47,990 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419322875] [2019-11-15 23:27:47,991 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:47,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2019-11-15 23:27:47,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527181428] [2019-11-15 23:27:47,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 23:27:47,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:27:47,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 23:27:47,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:27:47,992 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 20 states. [2019-11-15 23:27:51,250 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 63 [2019-11-15 23:27:51,804 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-11-15 23:27:52,593 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2019-11-15 23:27:53,366 WARN L191 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-11-15 23:27:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:53,614 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2019-11-15 23:27:53,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:27:53,616 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 21 [2019-11-15 23:27:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:53,617 INFO L225 Difference]: With dead ends: 63 [2019-11-15 23:27:53,617 INFO L226 Difference]: Without dead ends: 33 [2019-11-15 23:27:53,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:27:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-15 23:27:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-15 23:27:53,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:27:53,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-11-15 23:27:53,625 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 21 [2019-11-15 23:27:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:53,625 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-11-15 23:27:53,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 23:27:53,625 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-11-15 23:27:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:27:53,627 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:53,627 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:53,841 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-15 23:27:53,841 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash 443442860, now seen corresponding path program 1 times [2019-11-15 23:27:53,842 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:53,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079202382] [2019-11-15 23:27:53,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-15 23:27:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:54,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:27:54,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:54,104 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-15 23:27:54,104 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:54,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:54,143 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-15 23:27:54,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079202382] [2019-11-15 23:27:54,144 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:54,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-15 23:27:54,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094266105] [2019-11-15 23:27:54,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:27:54,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:27:54,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:27:54,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:27:54,145 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 9 states. [2019-11-15 23:27:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:54,273 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-11-15 23:27:54,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:27:54,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-11-15 23:27:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:54,274 INFO L225 Difference]: With dead ends: 36 [2019-11-15 23:27:54,274 INFO L226 Difference]: Without dead ends: 33 [2019-11-15 23:27:54,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:27:54,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-15 23:27:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-15 23:27:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 23:27:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-11-15 23:27:54,280 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 27 [2019-11-15 23:27:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:54,280 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-11-15 23:27:54,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:27:54,280 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-11-15 23:27:54,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:27:54,281 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:27:54,282 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:27:54,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-15 23:27:54,491 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:27:54,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:27:54,491 INFO L82 PathProgramCache]: Analyzing trace with hash 989074945, now seen corresponding path program 1 times [2019-11-15 23:27:54,491 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:27:54,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560706769] [2019-11-15 23:27:54,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3b457a0d-2cc0-4f28-98d3-17e0e079aaf5/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-15 23:27:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:27:54,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:27:54,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:27:54,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:54,860 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-15 23:27:54,860 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:27:54,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:27:55,093 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-15 23:27:55,094 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560706769] [2019-11-15 23:27:55,094 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:27:55,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-15 23:27:55,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213814523] [2019-11-15 23:27:55,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:27:55,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:27:55,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:27:55,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:27:55,096 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 16 states. [2019-11-15 23:27:55,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:27:55,348 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-11-15 23:27:55,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:27:55,349 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-11-15 23:27:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:27:55,349 INFO L225 Difference]: With dead ends: 33 [2019-11-15 23:27:55,349 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:27:55,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:27:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:27:55,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:27:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:27:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:27:55,350 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-11-15 23:27:55,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:27:55,351 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:27:55,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:27:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:27:55,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:27:55,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-15 23:27:55,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:27:58,946 WARN L191 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 158 DAG size of output: 131 [2019-11-15 23:27:59,299 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 97 [2019-11-15 23:28:02,316 WARN L191 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 140 DAG size of output: 113 [2019-11-15 23:28:05,694 WARN L191 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 145 DAG size of output: 118 [2019-11-15 23:28:05,714 INFO L439 ceAbstractionStarter]: At program point L35-2(lines 17 36) the Hoare annotation is: false [2019-11-15 23:28:05,714 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 499) no Hoare annotation was computed. [2019-11-15 23:28:05,714 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 302) no Hoare annotation was computed. [2019-11-15 23:28:05,714 INFO L443 ceAbstractionStarter]: For program point L501(lines 501 508) no Hoare annotation was computed. [2019-11-15 23:28:05,714 INFO L443 ceAbstractionStarter]: For program point L501-2(lines 494 508) no Hoare annotation was computed. [2019-11-15 23:28:05,714 INFO L443 ceAbstractionStarter]: For program point L303(lines 303 307) no Hoare annotation was computed. [2019-11-15 23:28:05,714 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 507) no Hoare annotation was computed. [2019-11-15 23:28:05,714 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 306) no Hoare annotation was computed. [2019-11-15 23:28:05,714 INFO L443 ceAbstractionStarter]: For program point L372-1(lines 372 377) no Hoare annotation was computed. [2019-11-15 23:28:05,715 INFO L439 ceAbstractionStarter]: At program point L372-2(lines 372 377) the Hoare annotation is: false [2019-11-15 23:28:05,715 INFO L443 ceAbstractionStarter]: For program point L372-3(lines 372 377) no Hoare annotation was computed. [2019-11-15 23:28:05,715 INFO L443 ceAbstractionStarter]: For program point L505(lines 505 506) no Hoare annotation was computed. [2019-11-15 23:28:05,715 INFO L443 ceAbstractionStarter]: For program point L176(lines 176 190) no Hoare annotation was computed. [2019-11-15 23:28:05,715 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 44 49) no Hoare annotation was computed. [2019-11-15 23:28:05,715 INFO L439 ceAbstractionStarter]: At program point L44-2(lines 44 49) the Hoare annotation is: false [2019-11-15 23:28:05,715 INFO L443 ceAbstractionStarter]: For program point L44-3(lines 44 49) no Hoare annotation was computed. [2019-11-15 23:28:05,715 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 441 446) no Hoare annotation was computed. [2019-11-15 23:28:05,715 INFO L439 ceAbstractionStarter]: At program point L441-2(lines 441 446) the Hoare annotation is: false [2019-11-15 23:28:05,715 INFO L443 ceAbstractionStarter]: For program point L441-3(lines 441 446) no Hoare annotation was computed. [2019-11-15 23:28:05,715 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-11-15 23:28:05,716 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 117) no Hoare annotation was computed. [2019-11-15 23:28:05,716 INFO L443 ceAbstractionStarter]: For program point L112-2(lines 112 117) no Hoare annotation was computed. [2019-11-15 23:28:05,716 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 332) no Hoare annotation was computed. [2019-11-15 23:28:05,716 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 116) no Hoare annotation was computed. [2019-11-15 23:28:05,716 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 319) no Hoare annotation was computed. [2019-11-15 23:28:05,716 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 188) no Hoare annotation was computed. [2019-11-15 23:28:05,716 INFO L443 ceAbstractionStarter]: For program point L313(lines 313 318) no Hoare annotation was computed. [2019-11-15 23:28:05,716 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 116) no Hoare annotation was computed. [2019-11-15 23:28:05,716 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 527) no Hoare annotation was computed. [2019-11-15 23:28:05,716 INFO L443 ceAbstractionStarter]: For program point L513-2(lines 513 527) no Hoare annotation was computed. [2019-11-15 23:28:05,716 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 318) no Hoare annotation was computed. [2019-11-15 23:28:05,717 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 188) no Hoare annotation was computed. [2019-11-15 23:28:05,717 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 63) no Hoare annotation was computed. [2019-11-15 23:28:05,717 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 42 92) no Hoare annotation was computed. [2019-11-15 23:28:05,717 INFO L443 ceAbstractionStarter]: For program point L580-1(lines 580 584) no Hoare annotation was computed. [2019-11-15 23:28:05,717 INFO L439 ceAbstractionStarter]: At program point L580-2(lines 580 584) the Hoare annotation is: (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse7 (_ +zero 11 53))) (.cse3 (not (fp.lt |ULTIMATE.start_main_#t~ret90| .cse7)))) (and (= (_ +zero 11 53) |ULTIMATE.start___ieee754_pow_#res|) (exists ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (fp.lt (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start___ieee754_pow_~hx~2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)))) (= ULTIMATE.start_main_~y~0 .cse1) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) (or .cse3 (forall ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64)) (ULTIMATE.start___ieee754_pow_~lx~1 (_ BitVec 32))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_74|)) ULTIMATE.start_main_~x~0)) (not (= (bvor (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|)) (_ bv3222274048 32)) ULTIMATE.start___ieee754_pow_~lx~1) (_ bv0 32)))))) (= ULTIMATE.start___ieee754_pow_~y .cse1) |ULTIMATE.start_main_#t~short93| (exists ((v_skolemized_v_prenex_9_4 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~hy~1) (= ((_ extract 31 0) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~ly~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_9_4) ((_ extract 62 52) v_skolemized_v_prenex_9_4) ((_ extract 51 0) v_skolemized_v_prenex_9_4)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (fp.lt (let ((.cse5 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) (exists ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (fp.lt (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ~zero_pow~0 (_ +zero 11 53)) (or .cse3 (forall ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64))) (or (not (= (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)) (_ bv2148532224 32)) (_ bv0 32))) (not (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|))))))) (exists ((v_skolemized_v_prenex_9_4 (_ BitVec 64))) (and (= ((_ extract 31 0) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~ly~0) (= ULTIMATE.start___ieee754_pow_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_9_4))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_9_4) ((_ extract 62 52) v_skolemized_v_prenex_9_4) ((_ extract 51 0) v_skolemized_v_prenex_9_4)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53)))))))) [2019-11-15 23:28:05,718 INFO L443 ceAbstractionStarter]: For program point L580-3(lines 580 584) no Hoare annotation was computed. [2019-11-15 23:28:05,718 INFO L443 ceAbstractionStarter]: For program point L316(line 316) no Hoare annotation was computed. [2019-11-15 23:28:05,718 INFO L443 ceAbstractionStarter]: For program point L316-2(line 316) no Hoare annotation was computed. [2019-11-15 23:28:05,718 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 185) no Hoare annotation was computed. [2019-11-15 23:28:05,718 INFO L443 ceAbstractionStarter]: For program point L184-2(lines 184 185) no Hoare annotation was computed. [2019-11-15 23:28:05,718 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 53) no Hoare annotation was computed. [2019-11-15 23:28:05,718 INFO L443 ceAbstractionStarter]: For program point L383(lines 383 391) no Hoare annotation was computed. [2019-11-15 23:28:05,718 INFO L443 ceAbstractionStarter]: For program point L383-1(lines 383 391) no Hoare annotation was computed. [2019-11-15 23:28:05,718 INFO L443 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2019-11-15 23:28:05,718 INFO L443 ceAbstractionStarter]: For program point L318-2(line 318) no Hoare annotation was computed. [2019-11-15 23:28:05,718 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 131) no Hoare annotation was computed. [2019-11-15 23:28:05,719 INFO L443 ceAbstractionStarter]: For program point L120-2(lines 120 131) no Hoare annotation was computed. [2019-11-15 23:28:05,719 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 517 522) no Hoare annotation was computed. [2019-11-15 23:28:05,719 INFO L439 ceAbstractionStarter]: At program point L517-2(lines 517 522) the Hoare annotation is: false [2019-11-15 23:28:05,719 INFO L443 ceAbstractionStarter]: For program point L517-3(lines 517 522) no Hoare annotation was computed. [2019-11-15 23:28:05,719 INFO L439 ceAbstractionStarter]: At program point L121-2(lines 121 125) the Hoare annotation is: false [2019-11-15 23:28:05,719 INFO L443 ceAbstractionStarter]: For program point L121-3(lines 121 125) no Hoare annotation was computed. [2019-11-15 23:28:05,719 INFO L443 ceAbstractionStarter]: For program point L55-1(lines 55 59) no Hoare annotation was computed. [2019-11-15 23:28:05,719 INFO L439 ceAbstractionStarter]: At program point L55-2(lines 55 59) the Hoare annotation is: false [2019-11-15 23:28:05,719 INFO L443 ceAbstractionStarter]: For program point L55-3(lines 55 59) no Hoare annotation was computed. [2019-11-15 23:28:05,719 INFO L443 ceAbstractionStarter]: For program point L386-1(lines 386 390) no Hoare annotation was computed. [2019-11-15 23:28:05,719 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 325) no Hoare annotation was computed. [2019-11-15 23:28:05,720 INFO L439 ceAbstractionStarter]: At program point L386-2(lines 386 390) the Hoare annotation is: false [2019-11-15 23:28:05,720 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 453 458) no Hoare annotation was computed. [2019-11-15 23:28:05,720 INFO L439 ceAbstractionStarter]: At program point L453-2(lines 453 458) the Hoare annotation is: false [2019-11-15 23:28:05,720 INFO L443 ceAbstractionStarter]: For program point L453-3(lines 453 458) no Hoare annotation was computed. [2019-11-15 23:28:05,720 INFO L443 ceAbstractionStarter]: For program point L321(lines 321 324) no Hoare annotation was computed. [2019-11-15 23:28:05,721 INFO L439 ceAbstractionStarter]: At program point L586(lines 577 587) the Hoare annotation is: (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse7 (_ +zero 11 53))) (.cse3 (not (fp.lt |ULTIMATE.start_main_#t~ret90| .cse7)))) (and (= (_ +zero 11 53) |ULTIMATE.start___ieee754_pow_#res|) (exists ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (fp.lt (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start___ieee754_pow_~hx~2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)))) (= ULTIMATE.start_main_~y~0 .cse1) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_78| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_78|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_78|))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_78|)))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) (or .cse3 (forall ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64)) (ULTIMATE.start___ieee754_pow_~lx~1 (_ BitVec 32))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_74|)) ULTIMATE.start_main_~x~0)) (not (= (bvor (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|)) (_ bv3222274048 32)) ULTIMATE.start___ieee754_pow_~lx~1) (_ bv0 32)))))) (= ULTIMATE.start___ieee754_pow_~y .cse1) (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) |ULTIMATE.start_main_#t~short93| (exists ((v_skolemized_v_prenex_9_4 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~hy~1) (= ((_ extract 31 0) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~ly~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_9_4) ((_ extract 62 52) v_skolemized_v_prenex_9_4) ((_ extract 51 0) v_skolemized_v_prenex_9_4)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (fp.lt (let ((.cse5 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) (exists ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (fp.lt (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ~zero_pow~0 (_ +zero 11 53)) (or .cse3 (forall ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64))) (or (not (= (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)) (_ bv2148532224 32)) (_ bv0 32))) (not (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|))))))) (exists ((v_skolemized_v_prenex_9_4 (_ BitVec 64))) (and (= ((_ extract 31 0) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~ly~0) (= ULTIMATE.start___ieee754_pow_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_9_4))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_9_4) ((_ extract 62 52) v_skolemized_v_prenex_9_4) ((_ extract 51 0) v_skolemized_v_prenex_9_4)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53)))))))) [2019-11-15 23:28:05,721 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:28:05,721 INFO L443 ceAbstractionStarter]: For program point L126-2(lines 126 127) no Hoare annotation was computed. [2019-11-15 23:28:05,721 INFO L439 ceAbstractionStarter]: At program point L126-3(lines 126 127) the Hoare annotation is: false [2019-11-15 23:28:05,721 INFO L443 ceAbstractionStarter]: For program point L126-4(lines 126 127) no Hoare annotation was computed. [2019-11-15 23:28:05,721 INFO L443 ceAbstractionStarter]: For program point L193(lines 193 194) no Hoare annotation was computed. [2019-11-15 23:28:05,721 INFO L443 ceAbstractionStarter]: For program point L193-2(lines 193 194) no Hoare annotation was computed. [2019-11-15 23:28:05,721 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2019-11-15 23:28:05,721 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 525) no Hoare annotation was computed. [2019-11-15 23:28:05,721 INFO L443 ceAbstractionStarter]: For program point L524-2(lines 524 525) no Hoare annotation was computed. [2019-11-15 23:28:05,722 INFO L443 ceAbstractionStarter]: For program point L326(lines 326 327) no Hoare annotation was computed. [2019-11-15 23:28:05,722 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 331) no Hoare annotation was computed. [2019-11-15 23:28:05,722 INFO L443 ceAbstractionStarter]: For program point L196-1(lines 196 201) no Hoare annotation was computed. [2019-11-15 23:28:05,722 INFO L439 ceAbstractionStarter]: At program point L196-2(lines 196 201) the Hoare annotation is: false [2019-11-15 23:28:05,722 INFO L443 ceAbstractionStarter]: For program point L196-3(lines 196 201) no Hoare annotation was computed. [2019-11-15 23:28:05,722 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 330) no Hoare annotation was computed. [2019-11-15 23:28:05,722 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:28:05,722 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 404) no Hoare annotation was computed. [2019-11-15 23:28:05,722 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 529 534) no Hoare annotation was computed. [2019-11-15 23:28:05,722 INFO L439 ceAbstractionStarter]: At program point L529-2(lines 529 534) the Hoare annotation is: false [2019-11-15 23:28:05,722 INFO L443 ceAbstractionStarter]: For program point L529-3(lines 529 534) no Hoare annotation was computed. [2019-11-15 23:28:05,723 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 68) no Hoare annotation was computed. [2019-11-15 23:28:05,723 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 404) no Hoare annotation was computed. [2019-11-15 23:28:05,723 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 137) no Hoare annotation was computed. [2019-11-15 23:28:05,723 INFO L443 ceAbstractionStarter]: For program point L134-2(lines 134 137) no Hoare annotation was computed. [2019-11-15 23:28:05,723 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 465 470) no Hoare annotation was computed. [2019-11-15 23:28:05,723 INFO L439 ceAbstractionStarter]: At program point L465-2(lines 465 470) the Hoare annotation is: false [2019-11-15 23:28:05,723 INFO L443 ceAbstractionStarter]: For program point L465-3(lines 465 470) no Hoare annotation was computed. [2019-11-15 23:28:05,723 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 77) no Hoare annotation was computed. [2019-11-15 23:28:05,723 INFO L443 ceAbstractionStarter]: For program point L268-1(lines 268 273) no Hoare annotation was computed. [2019-11-15 23:28:05,724 INFO L439 ceAbstractionStarter]: At program point L268-2(lines 268 273) the Hoare annotation is: (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (not (fp.lt |ULTIMATE.start_main_#t~ret90| .cse5))) (.cse2 (fp.div roundNearestTiesToEven .cse5 (_ +zero 11 53)))) (and (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (fp.lt (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (= ULTIMATE.start_main_~y~0 .cse2) (= ~zero_pow~0 (_ +zero 11 53)) (or .cse3 (forall ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64))) (or (not (= (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)) (_ bv2148532224 32)) (_ bv0 32))) (not (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|))))))) (or .cse3 (forall ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64)) (ULTIMATE.start___ieee754_pow_~lx~1 (_ BitVec 32))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_74|)) ULTIMATE.start_main_~x~0)) (not (= (bvor (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|)) (_ bv3222274048 32)) ULTIMATE.start___ieee754_pow_~lx~1) (_ bv0 32)))))) (= ULTIMATE.start___ieee754_pow_~y .cse2) (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_73|))) (= (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|)) v_arrayElimCell_2))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) |ULTIMATE.start_fabs_double_#res|)))))) [2019-11-15 23:28:05,724 INFO L439 ceAbstractionStarter]: At program point L202(lines 95 203) the Hoare annotation is: false [2019-11-15 23:28:05,724 INFO L443 ceAbstractionStarter]: For program point L70-1(lines 70 75) no Hoare annotation was computed. [2019-11-15 23:28:05,724 INFO L439 ceAbstractionStarter]: At program point L70-2(lines 70 75) the Hoare annotation is: false [2019-11-15 23:28:05,724 INFO L443 ceAbstractionStarter]: For program point L70-3(lines 70 75) no Hoare annotation was computed. [2019-11-15 23:28:05,724 INFO L443 ceAbstractionStarter]: For program point L600(lines 600 609) no Hoare annotation was computed. [2019-11-15 23:28:05,724 INFO L443 ceAbstractionStarter]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2019-11-15 23:28:05,724 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 349) no Hoare annotation was computed. [2019-11-15 23:28:05,726 INFO L443 ceAbstractionStarter]: For program point L336-2(lines 261 560) no Hoare annotation was computed. [2019-11-15 23:28:05,726 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 348) no Hoare annotation was computed. [2019-11-15 23:28:05,726 INFO L443 ceAbstractionStarter]: For program point L206-1(lines 206 210) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L439 ceAbstractionStarter]: At program point L206-2(lines 206 210) the Hoare annotation is: (and (= ULTIMATE.start_main_~y~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) (= ~zero_pow~0 (_ +zero 11 53)) (= ULTIMATE.start_fabs_double_~x ULTIMATE.start_main_~x~0)) [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L206-5(lines 206 210) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L439 ceAbstractionStarter]: At program point L206-6(lines 206 210) the Hoare annotation is: false [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 410) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L405-1(lines 379 472) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 340) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L405-2(lines 405 410) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L339-2(lines 337 348) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L274(lines 274 279) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L274-1(lines 261 560) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L274-2(lines 274 279) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L605(line 605) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L605-2(lines 605 608) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 346) no Hoare annotation was computed. [2019-11-15 23:28:05,727 INFO L443 ceAbstractionStarter]: For program point L606(line 606) no Hoare annotation was computed. [2019-11-15 23:28:05,728 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 345) no Hoare annotation was computed. [2019-11-15 23:28:05,728 INFO L443 ceAbstractionStarter]: For program point L78(lines 78 83) no Hoare annotation was computed. [2019-11-15 23:28:05,728 INFO L443 ceAbstractionStarter]: For program point L475(lines 475 476) no Hoare annotation was computed. [2019-11-15 23:28:05,728 INFO L443 ceAbstractionStarter]: For program point L475-2(lines 475 476) no Hoare annotation was computed. [2019-11-15 23:28:05,728 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 216) no Hoare annotation was computed. [2019-11-15 23:28:05,728 INFO L443 ceAbstractionStarter]: For program point L211-1(lines 204 218) no Hoare annotation was computed. [2019-11-15 23:28:05,728 INFO L443 ceAbstractionStarter]: For program point L211-2(lines 211 216) no Hoare annotation was computed. [2019-11-15 23:28:05,728 INFO L443 ceAbstractionStarter]: For program point L211-3(lines 211 216) no Hoare annotation was computed. [2019-11-15 23:28:05,728 INFO L439 ceAbstractionStarter]: At program point L145-2(lines 145 155) the Hoare annotation is: false [2019-11-15 23:28:05,728 INFO L443 ceAbstractionStarter]: For program point L211-4(lines 204 218) no Hoare annotation was computed. [2019-11-15 23:28:05,729 INFO L443 ceAbstractionStarter]: For program point L79(lines 79 82) no Hoare annotation was computed. [2019-11-15 23:28:05,729 INFO L443 ceAbstractionStarter]: For program point L145-3(lines 145 155) no Hoare annotation was computed. [2019-11-15 23:28:05,729 INFO L443 ceAbstractionStarter]: For program point L211-5(lines 211 216) no Hoare annotation was computed. [2019-11-15 23:28:05,729 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 345) no Hoare annotation was computed. [2019-11-15 23:28:05,729 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 151) no Hoare annotation was computed. [2019-11-15 23:28:05,729 INFO L443 ceAbstractionStarter]: For program point L147-2(lines 147 151) no Hoare annotation was computed. [2019-11-15 23:28:05,729 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 544 548) no Hoare annotation was computed. [2019-11-15 23:28:05,730 INFO L439 ceAbstractionStarter]: At program point L544-2(lines 544 548) the Hoare annotation is: false [2019-11-15 23:28:05,730 INFO L443 ceAbstractionStarter]: For program point L544-3(lines 544 548) no Hoare annotation was computed. [2019-11-15 23:28:05,730 INFO L446 ceAbstractionStarter]: At program point L611(lines 589 612) the Hoare annotation is: true [2019-11-15 23:28:05,730 INFO L443 ceAbstractionStarter]: For program point L479-1(lines 479 484) no Hoare annotation was computed. [2019-11-15 23:28:05,730 INFO L439 ceAbstractionStarter]: At program point L479-2(lines 479 484) the Hoare annotation is: false [2019-11-15 23:28:05,730 INFO L443 ceAbstractionStarter]: For program point L479-3(lines 479 484) no Hoare annotation was computed. [2019-11-15 23:28:05,730 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 284) no Hoare annotation was computed. [2019-11-15 23:28:05,731 INFO L439 ceAbstractionStarter]: At program point L217(lines 204 218) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))))) (= ULTIMATE.start_main_~y~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) (= ~zero_pow~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|) ULTIMATE.start_fabs_double_~high~0) (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_73|))))) (exists ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_73|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_73|))) (= (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|)) v_arrayElimCell_2))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_fabs_double_#res|)))) [2019-11-15 23:28:05,731 INFO L439 ceAbstractionStarter]: At program point L217-1(lines 204 218) the Hoare annotation is: false [2019-11-15 23:28:05,731 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 85 90) no Hoare annotation was computed. [2019-11-15 23:28:05,731 INFO L439 ceAbstractionStarter]: At program point L85-2(lines 85 90) the Hoare annotation is: false [2019-11-15 23:28:05,731 INFO L443 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-15 23:28:05,732 INFO L443 ceAbstractionStarter]: For program point L85-3(lines 85 90) no Hoare annotation was computed. [2019-11-15 23:28:05,732 INFO L439 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-15 23:28:05,732 INFO L443 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-15 23:28:05,732 INFO L439 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-15 23:28:05,732 INFO L443 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-11-15 23:28:05,732 INFO L439 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-11-15 23:28:05,732 INFO L443 ceAbstractionStarter]: For program point L416-1(lines 416 421) no Hoare annotation was computed. [2019-11-15 23:28:05,733 INFO L439 ceAbstractionStarter]: At program point L416-2(lines 416 421) the Hoare annotation is: false [2019-11-15 23:28:05,733 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:28:05,733 INFO L443 ceAbstractionStarter]: For program point L416-3(lines 416 421) no Hoare annotation was computed. [2019-11-15 23:28:05,733 INFO L443 ceAbstractionStarter]: For program point L550(lines 550 558) no Hoare annotation was computed. [2019-11-15 23:28:05,733 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 292) no Hoare annotation was computed. [2019-11-15 23:28:05,733 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-11-15 23:28:05,733 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 472) no Hoare annotation was computed. [2019-11-15 23:28:05,734 INFO L443 ceAbstractionStarter]: For program point L288(lines 288 291) no Hoare annotation was computed. [2019-11-15 23:28:05,734 INFO L443 ceAbstractionStarter]: For program point L354-2(lines 354 472) no Hoare annotation was computed. [2019-11-15 23:28:05,734 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 28) no Hoare annotation was computed. [2019-11-15 23:28:05,734 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 17 36) no Hoare annotation was computed. [2019-11-15 23:28:05,734 INFO L443 ceAbstractionStarter]: For program point L24-3(lines 24 28) no Hoare annotation was computed. [2019-11-15 23:28:05,734 INFO L443 ceAbstractionStarter]: For program point L24-4(lines 17 36) no Hoare annotation was computed. [2019-11-15 23:28:05,734 INFO L443 ceAbstractionStarter]: For program point L24-6(lines 24 28) no Hoare annotation was computed. [2019-11-15 23:28:05,735 INFO L443 ceAbstractionStarter]: For program point L24-7(lines 17 36) no Hoare annotation was computed. [2019-11-15 23:28:05,735 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 553 558) no Hoare annotation was computed. [2019-11-15 23:28:05,735 INFO L439 ceAbstractionStarter]: At program point L553-2(lines 553 558) the Hoare annotation is: false [2019-11-15 23:28:05,735 INFO L443 ceAbstractionStarter]: For program point L553-3(lines 550 558) no Hoare annotation was computed. [2019-11-15 23:28:05,735 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 360) no Hoare annotation was computed. [2019-11-15 23:28:05,735 INFO L443 ceAbstractionStarter]: For program point L355-2(lines 354 379) no Hoare annotation was computed. [2019-11-15 23:28:05,735 INFO L439 ceAbstractionStarter]: At program point L91(lines 42 92) the Hoare annotation is: false [2019-11-15 23:28:05,736 INFO L443 ceAbstractionStarter]: For program point L488-1(lines 488 493) no Hoare annotation was computed. [2019-11-15 23:28:05,736 INFO L439 ceAbstractionStarter]: At program point L488-2(lines 488 493) the Hoare annotation is: false [2019-11-15 23:28:05,736 INFO L443 ceAbstractionStarter]: For program point L488-3(lines 261 560) no Hoare annotation was computed. [2019-11-15 23:28:05,736 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 357) no Hoare annotation was computed. [2019-11-15 23:28:05,736 INFO L439 ceAbstractionStarter]: At program point L158-2(lines 158 174) the Hoare annotation is: false [2019-11-15 23:28:05,736 INFO L443 ceAbstractionStarter]: For program point L158-3(lines 95 203) no Hoare annotation was computed. [2019-11-15 23:28:05,736 INFO L443 ceAbstractionStarter]: For program point L357(line 357) no Hoare annotation was computed. [2019-11-15 23:28:05,737 INFO L443 ceAbstractionStarter]: For program point L357-2(line 357) no Hoare annotation was computed. [2019-11-15 23:28:05,737 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 424 429) no Hoare annotation was computed. [2019-11-15 23:28:05,737 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 359) no Hoare annotation was computed. [2019-11-15 23:28:05,737 INFO L439 ceAbstractionStarter]: At program point L424-2(lines 424 429) the Hoare annotation is: false [2019-11-15 23:28:05,737 INFO L443 ceAbstractionStarter]: For program point L424-3(lines 424 429) no Hoare annotation was computed. [2019-11-15 23:28:05,737 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:28:05,737 INFO L443 ceAbstractionStarter]: For program point L359(line 359) no Hoare annotation was computed. [2019-11-15 23:28:05,738 INFO L443 ceAbstractionStarter]: For program point L359-2(line 359) no Hoare annotation was computed. [2019-11-15 23:28:05,738 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 170) no Hoare annotation was computed. [2019-11-15 23:28:05,738 INFO L443 ceAbstractionStarter]: For program point L161-2(lines 161 170) no Hoare annotation was computed. [2019-11-15 23:28:05,738 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 34) no Hoare annotation was computed. [2019-11-15 23:28:05,738 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 17 36) no Hoare annotation was computed. [2019-11-15 23:28:05,738 INFO L443 ceAbstractionStarter]: For program point L29-2(lines 29 34) no Hoare annotation was computed. [2019-11-15 23:28:05,738 INFO L443 ceAbstractionStarter]: For program point L29-3(lines 29 34) no Hoare annotation was computed. [2019-11-15 23:28:05,739 INFO L443 ceAbstractionStarter]: For program point L29-4(lines 17 36) no Hoare annotation was computed. [2019-11-15 23:28:05,739 INFO L443 ceAbstractionStarter]: For program point L29-5(lines 29 34) no Hoare annotation was computed. [2019-11-15 23:28:05,739 INFO L443 ceAbstractionStarter]: For program point L29-6(lines 29 34) no Hoare annotation was computed. [2019-11-15 23:28:05,739 INFO L443 ceAbstractionStarter]: For program point L29-7(lines 17 36) no Hoare annotation was computed. [2019-11-15 23:28:05,739 INFO L443 ceAbstractionStarter]: For program point L29-8(lines 29 34) no Hoare annotation was computed. [2019-11-15 23:28:05,739 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 309) no Hoare annotation was computed. [2019-11-15 23:28:05,739 INFO L443 ceAbstractionStarter]: For program point L294-1(lines 261 560) no Hoare annotation was computed. [2019-11-15 23:28:05,740 INFO L439 ceAbstractionStarter]: At program point L559(lines 261 560) the Hoare annotation is: (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.div roundNearestTiesToEven .cse7 (_ +zero 11 53))) (.cse3 (not (fp.lt |ULTIMATE.start_main_#t~ret90| .cse7)))) (and (= (_ +zero 11 53) |ULTIMATE.start___ieee754_pow_#res|) (exists ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (fp.lt (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start___ieee754_pow_~hx~2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)))) (= ULTIMATE.start_main_~y~0 .cse1) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))))) (or .cse3 (forall ((|v_skolemized_q#valueAsBitvector_74| (_ BitVec 64)) (ULTIMATE.start___ieee754_pow_~lx~1 (_ BitVec 32))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_74|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_74|)) ULTIMATE.start_main_~x~0)) (not (= (bvor (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_74|)) (_ bv3222274048 32)) ULTIMATE.start___ieee754_pow_~lx~1) (_ bv0 32)))))) (= ULTIMATE.start___ieee754_pow_~y .cse1) (exists ((v_skolemized_v_prenex_9_4 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~hy~1) (= ((_ extract 31 0) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~ly~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_9_4) ((_ extract 62 52) v_skolemized_v_prenex_9_4) ((_ extract 51 0) v_skolemized_v_prenex_9_4)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))) (fp.lt (let ((.cse5 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) (exists ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_pow_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (fp.lt (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (exists ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_75|)) (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_75|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_75|))))) (= ~zero_pow~0 (_ +zero 11 53)) (or .cse3 (forall ((|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64))) (or (not (= (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)) (_ bv2148532224 32)) (_ bv0 32))) (not (= ULTIMATE.start_main_~x~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_76|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_76|))))))) (exists ((v_skolemized_v_prenex_9_4 (_ BitVec 64))) (and (= ((_ extract 31 0) v_skolemized_v_prenex_9_4) ULTIMATE.start___ieee754_pow_~ly~0) (= ULTIMATE.start___ieee754_pow_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_9_4))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_9_4) ((_ extract 62 52) v_skolemized_v_prenex_9_4) ((_ extract 51 0) v_skolemized_v_prenex_9_4)) (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53)))))))) [2019-11-15 23:28:05,740 INFO L443 ceAbstractionStarter]: For program point L295(lines 295 308) no Hoare annotation was computed. [2019-11-15 23:28:05,741 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 164) no Hoare annotation was computed. [2019-11-15 23:28:05,741 INFO L443 ceAbstractionStarter]: For program point L163-2(lines 163 164) no Hoare annotation was computed. [2019-11-15 23:28:05,741 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 500) no Hoare annotation was computed. [2019-11-15 23:28:05,741 INFO L443 ceAbstractionStarter]: For program point L363(line 363) no Hoare annotation was computed. [2019-11-15 23:28:05,741 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 308) no Hoare annotation was computed. [2019-11-15 23:28:05,741 INFO L443 ceAbstractionStarter]: For program point L363-2(line 363) no Hoare annotation was computed. [2019-11-15 23:28:05,742 INFO L443 ceAbstractionStarter]: For program point L364(lines 364 365) no Hoare annotation was computed. [2019-11-15 23:28:05,742 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 167) no Hoare annotation was computed. [2019-11-15 23:28:05,742 INFO L443 ceAbstractionStarter]: For program point L166-2(lines 166 167) no Hoare annotation was computed. [2019-11-15 23:28:05,742 INFO L443 ceAbstractionStarter]: For program point L365(line 365) no Hoare annotation was computed. [2019-11-15 23:28:05,742 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 307) no Hoare annotation was computed. [2019-11-15 23:28:05,742 INFO L443 ceAbstractionStarter]: For program point L365-2(line 365) no Hoare annotation was computed. [2019-11-15 23:28:05,742 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 101 106) no Hoare annotation was computed. [2019-11-15 23:28:05,743 INFO L439 ceAbstractionStarter]: At program point L101-2(lines 101 106) the Hoare annotation is: false [2019-11-15 23:28:05,743 INFO L439 ceAbstractionStarter]: At program point L35(lines 17 36) the Hoare annotation is: false [2019-11-15 23:28:05,743 INFO L443 ceAbstractionStarter]: For program point L101-3(lines 95 203) no Hoare annotation was computed. [2019-11-15 23:28:05,743 INFO L439 ceAbstractionStarter]: At program point L35-1(lines 17 36) the Hoare annotation is: false [2019-11-15 23:28:05,749 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:555) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:212) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 23:28:05,752 INFO L168 Benchmark]: Toolchain (without parser) took 101241.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 264.8 MB). Free memory was 945.6 MB in the beginning and 951.5 MB in the end (delta: -5.8 MB). Peak memory consumption was 258.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:28:05,752 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:28:05,753 INFO L168 Benchmark]: CACSL2BoogieTranslator took 573.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:28:05,753 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:28:05,754 INFO L168 Benchmark]: Boogie Preprocessor took 174.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:28:05,754 INFO L168 Benchmark]: RCFGBuilder took 47516.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.1 MB in the end (delta: 126.7 MB). Peak memory consumption was 126.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:28:05,755 INFO L168 Benchmark]: TraceAbstraction took 52841.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 117.4 MB). Free memory was 976.1 MB in the beginning and 951.5 MB in the end (delta: 24.6 MB). Peak memory consumption was 142.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:28:05,760 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 573.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 131.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 174.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 47516.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.1 MB in the end (delta: 126.7 MB). Peak memory consumption was 126.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 52841.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 117.4 MB). Free memory was 976.1 MB in the beginning and 951.5 MB in the end (delta: 24.6 MB). Peak memory consumption was 142.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: 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: 453]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 517]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: 0 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...