./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3e5ce664 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e9201cae23fc7cbf1af50183e9486b54bc56d6e ................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e9201cae23fc7cbf1af50183e9486b54bc56d6e ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.0-3e5ce66 [2020-12-02 21:32:41,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 21:32:41,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 21:32:41,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 21:32:41,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 21:32:41,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 21:32:41,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 21:32:41,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 21:32:41,574 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 21:32:41,581 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 21:32:41,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 21:32:41,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 21:32:41,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 21:32:41,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 21:32:41,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 21:32:41,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 21:32:41,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 21:32:41,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 21:32:41,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 21:32:41,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 21:32:41,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 21:32:41,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 21:32:41,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 21:32:41,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 21:32:41,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 21:32:41,639 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 21:32:41,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 21:32:41,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 21:32:41,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 21:32:41,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 21:32:41,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 21:32:41,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 21:32:41,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 21:32:41,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 21:32:41,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 21:32:41,652 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 21:32:41,653 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 21:32:41,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 21:32:41,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 21:32:41,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 21:32:41,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 21:32:41,660 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 21:32:41,722 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 21:32:41,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 21:32:41,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 21:32:41,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 21:32:41,729 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 21:32:41,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 21:32:41,730 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 21:32:41,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 21:32:41,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 21:32:41,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 21:32:41,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 21:32:41,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 21:32:41,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 21:32:41,733 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 21:32:41,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 21:32:41,734 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 21:32:41,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 21:32:41,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 21:32:41,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 21:32:41,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 21:32:41,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 21:32:41,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 21:32:41,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 21:32:41,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 21:32:41,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 21:32:41,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 21:32:41,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 21:32:41,737 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 21:32:41,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> 3e9201cae23fc7cbf1af50183e9486b54bc56d6e [2020-12-02 21:32:42,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 21:32:42,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 21:32:42,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 21:32:42,270 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 21:32:42,271 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 21:32:42,273 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882.c [2020-12-02 21:32:42,358 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba35fc8bb/875030caa1e145b5be3449c5d54dddd7/FLAG7c3b6937e [2020-12-02 21:32:43,020 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 21:32:43,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0882.c [2020-12-02 21:32:43,042 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba35fc8bb/875030caa1e145b5be3449c5d54dddd7/FLAG7c3b6937e [2020-12-02 21:32:43,365 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba35fc8bb/875030caa1e145b5be3449c5d54dddd7 [2020-12-02 21:32:43,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 21:32:43,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 21:32:43,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 21:32:43,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 21:32:43,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 21:32:43,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:32:43" (1/1) ... [2020-12-02 21:32:43,388 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706d926b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:43, skipping insertion in model container [2020-12-02 21:32:43,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:32:43" (1/1) ... [2020-12-02 21:32:43,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 21:32:43,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 21:32:43,725 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.standardfunctions.StandardFunctionHandler.handleNaNOrInfinity(StandardFunctionHandler.java:1702) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.lambda$41(StandardFunctionHandler.java:358) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:234) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1402) 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:1972) 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:1601) 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:1046) 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:1578) 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:1046) 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:1424) 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:3212) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2293) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:580) 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:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-02 21:32:43,733 INFO L168 Benchmark]: Toolchain (without parser) took 359.43 ms. Allocated memory is still 54.5 MB. Free memory was 30.6 MB in the beginning and 32.2 MB in the end (delta: -1.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 16.1 GB. [2020-12-02 21:32:43,735 INFO L168 Benchmark]: CDTParser took 1.01 ms. Allocated memory is still 54.5 MB. Free memory was 32.4 MB in the beginning and 32.3 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 21:32:43,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.24 ms. Allocated memory is still 54.5 MB. Free memory was 30.4 MB in the beginning and 32.2 MB in the end (delta: -1.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 GB. [2020-12-02 21:32:43,739 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01 ms. Allocated memory is still 54.5 MB. Free memory was 32.4 MB in the beginning and 32.3 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 352.24 ms. Allocated memory is still 54.5 MB. Free memory was 30.4 MB in the beginning and 32.2 MB in the end (delta: -1.8 MB). Peak memory consumption was 7.8 MB. Max. memory is 16.1 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.2.0-3e5ce66 [2020-12-02 21:32:46,250 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 21:32:46,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 21:32:46,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 21:32:46,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 21:32:46,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 21:32:46,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 21:32:46,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 21:32:46,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 21:32:46,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 21:32:46,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 21:32:46,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 21:32:46,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 21:32:46,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 21:32:46,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 21:32:46,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 21:32:46,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 21:32:46,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 21:32:46,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 21:32:46,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 21:32:46,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 21:32:46,375 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 21:32:46,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 21:32:46,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 21:32:46,387 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 21:32:46,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 21:32:46,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 21:32:46,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 21:32:46,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 21:32:46,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 21:32:46,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 21:32:46,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 21:32:46,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 21:32:46,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 21:32:46,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 21:32:46,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 21:32:46,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 21:32:46,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 21:32:46,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 21:32:46,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 21:32:46,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 21:32:46,409 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-02 21:32:46,481 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 21:32:46,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 21:32:46,483 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 21:32:46,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 21:32:46,486 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 21:32:46,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 21:32:46,486 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 21:32:46,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 21:32:46,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 21:32:46,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 21:32:46,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 21:32:46,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 21:32:46,490 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-02 21:32:46,490 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-02 21:32:46,491 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 21:32:46,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 21:32:46,491 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 21:32:46,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 21:32:46,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 21:32:46,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 21:32:46,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 21:32:46,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 21:32:46,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 21:32:46,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 21:32:46,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 21:32:46,494 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-02 21:32:46,494 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-02 21:32:46,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 21:32:46,495 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 21:32:46,495 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-02 21:32:46,496 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> 3e9201cae23fc7cbf1af50183e9486b54bc56d6e [2020-12-02 21:32:46,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 21:32:46,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 21:32:46,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 21:32:46,984 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 21:32:46,985 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 21:32:46,987 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0882.c [2020-12-02 21:32:47,067 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337930c13/4ec80e16c4c048c9b6c5bb8c7db89b15/FLAG043174342 [2020-12-02 21:32:47,835 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 21:32:47,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0882.c [2020-12-02 21:32:47,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337930c13/4ec80e16c4c048c9b6c5bb8c7db89b15/FLAG043174342 [2020-12-02 21:32:48,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/337930c13/4ec80e16c4c048c9b6c5bb8c7db89b15 [2020-12-02 21:32:48,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 21:32:48,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 21:32:48,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 21:32:48,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 21:32:48,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 21:32:48,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:32:48" (1/1) ... [2020-12-02 21:32:48,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1667bcaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48, skipping insertion in model container [2020-12-02 21:32:48,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:32:48" (1/1) ... [2020-12-02 21:32:48,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 21:32:48,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 21:32:48,561 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0882.c[14275,14288] [2020-12-02 21:32:48,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 21:32:48,592 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 21:32:48,799 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0882.c[14275,14288] [2020-12-02 21:32:48,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 21:32:48,835 INFO L208 MainTranslator]: Completed translation [2020-12-02 21:32:48,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48 WrapperNode [2020-12-02 21:32:48,836 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 21:32:48,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 21:32:48,838 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 21:32:48,838 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 21:32:48,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48" (1/1) ... [2020-12-02 21:32:48,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48" (1/1) ... [2020-12-02 21:32:48,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 21:32:48,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 21:32:48,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 21:32:48,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 21:32:48,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48" (1/1) ... [2020-12-02 21:32:48,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48" (1/1) ... [2020-12-02 21:32:49,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48" (1/1) ... [2020-12-02 21:32:49,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48" (1/1) ... [2020-12-02 21:32:49,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48" (1/1) ... [2020-12-02 21:32:49,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48" (1/1) ... [2020-12-02 21:32:49,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48" (1/1) ... [2020-12-02 21:32:49,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 21:32:49,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 21:32:49,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 21:32:49,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 21:32:49,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 21:32:49,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2020-12-02 21:32:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-12-02 21:32:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-02 21:32:49,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 21:32:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2020-12-02 21:32:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-12-02 21:32:49,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 21:32:49,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 21:32:49,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-12-02 21:32:49,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 21:34:14,137 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 21:34:14,140 INFO L298 CfgBuilder]: Removed 92 assume(true) statements. [2020-12-02 21:34:14,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:34:14 BoogieIcfgContainer [2020-12-02 21:34:14,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 21:34:14,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 21:34:14,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 21:34:14,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 21:34:14,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:32:48" (1/3) ... [2020-12-02 21:34:14,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b1dabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:34:14, skipping insertion in model container [2020-12-02 21:34:14,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:32:48" (2/3) ... [2020-12-02 21:34:14,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b1dabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:34:14, skipping insertion in model container [2020-12-02 21:34:14,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:34:14" (3/3) ... [2020-12-02 21:34:14,162 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0882.c [2020-12-02 21:34:14,187 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 21:34:14,198 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 21:34:14,213 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 21:34:14,270 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 21:34:14,271 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 21:34:14,271 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 21:34:14,271 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 21:34:14,271 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 21:34:14,271 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 21:34:14,272 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 21:34:14,272 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 21:34:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states. [2020-12-02 21:34:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 21:34:14,319 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:34:14,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:34:14,321 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:34:14,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:34:14,333 INFO L82 PathProgramCache]: Analyzing trace with hash 484722149, now seen corresponding path program 1 times [2020-12-02 21:34:14,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:34:14,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121546751] [2020-12-02 21:34:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-02 21:34:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:34:14,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-02 21:34:14,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:34:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:34:14,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:34:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:34:14,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121546751] [2020-12-02 21:34:14,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:34:14,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-12-02 21:34:14,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431490600] [2020-12-02 21:34:14,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-02 21:34:14,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:34:14,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-02 21:34:14,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 21:34:14,817 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 2 states. [2020-12-02 21:34:14,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:34:14,875 INFO L93 Difference]: Finished difference Result 431 states and 736 transitions. [2020-12-02 21:34:14,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-02 21:34:14,877 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-12-02 21:34:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:34:14,899 INFO L225 Difference]: With dead ends: 431 [2020-12-02 21:34:14,899 INFO L226 Difference]: Without dead ends: 213 [2020-12-02 21:34:14,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 21:34:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-12-02 21:34:14,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2020-12-02 21:34:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-12-02 21:34:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 292 transitions. [2020-12-02 21:34:15,008 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 292 transitions. Word has length 11 [2020-12-02 21:34:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:34:15,009 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 292 transitions. [2020-12-02 21:34:15,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-02 21:34:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 292 transitions. [2020-12-02 21:34:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 21:34:15,010 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:34:15,010 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:34:15,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-02 21:34:15,226 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:34:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:34:15,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1071825986, now seen corresponding path program 1 times [2020-12-02 21:34:15,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:34:15,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005577966] [2020-12-02 21:34:15,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-02 21:34:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:34:15,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-02 21:34:15,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:34:16,225 INFO L382 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 15 treesize of output 13 [2020-12-02 21:34:16,319 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-02 21:34:16,408 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:34:16,409 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-02 21:34:16,758 WARN L197 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-12-02 21:34:16,759 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:34:16,762 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-02 21:34:16,763 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2020-12-02 21:34:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:34:17,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:34:20,634 INFO L382 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 21 treesize of output 19 [2020-12-02 21:34:20,723 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-02 21:34:20,816 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:34:20,817 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-02 21:34:21,081 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-02 21:34:21,082 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:34:21,084 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-02 21:34:21,084 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2020-12-02 21:34:22,095 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-12-02 21:34:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:34:22,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005577966] [2020-12-02 21:34:22,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:34:22,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-12-02 21:34:22,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130449852] [2020-12-02 21:34:22,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-02 21:34:22,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:34:22,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-02 21:34:22,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-02 21:34:22,190 INFO L87 Difference]: Start difference. First operand 213 states and 292 transitions. Second operand 8 states. [2020-12-02 21:34:24,845 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-12-02 21:34:25,255 WARN L197 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-12-02 21:34:43,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:34:43,168 INFO L93 Difference]: Finished difference Result 366 states and 483 transitions. [2020-12-02 21:34:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-02 21:34:43,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-12-02 21:34:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:34:43,307 INFO L225 Difference]: With dead ends: 366 [2020-12-02 21:34:43,307 INFO L226 Difference]: Without dead ends: 181 [2020-12-02 21:34:43,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-12-02 21:34:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2020-12-02 21:34:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 172. [2020-12-02 21:34:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-12-02 21:34:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 219 transitions. [2020-12-02 21:34:43,341 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 219 transitions. Word has length 13 [2020-12-02 21:34:43,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:34:43,342 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 219 transitions. [2020-12-02 21:34:43,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-02 21:34:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 219 transitions. [2020-12-02 21:34:43,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 21:34:43,343 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:34:43,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:34:43,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-02 21:34:43,558 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:34:43,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:34:43,559 INFO L82 PathProgramCache]: Analyzing trace with hash 754691751, now seen corresponding path program 1 times [2020-12-02 21:34:43,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:34:43,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255875624] [2020-12-02 21:34:43,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-02 21:34:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:34:43,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-02 21:34:43,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:34:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:34:45,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:34:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:34:47,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255875624] [2020-12-02 21:34:47,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:34:47,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-12-02 21:34:47,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699313970] [2020-12-02 21:34:47,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 21:34:47,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:34:47,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 21:34:47,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-02 21:34:47,173 INFO L87 Difference]: Start difference. First operand 172 states and 219 transitions. Second operand 10 states. [2020-12-02 21:34:47,848 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-12-02 21:34:48,453 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-12-02 21:34:49,040 WARN L197 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-12-02 21:34:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:34:55,622 INFO L93 Difference]: Finished difference Result 331 states and 414 transitions. [2020-12-02 21:34:55,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 21:34:55,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-12-02 21:34:55,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:34:55,626 INFO L225 Difference]: With dead ends: 331 [2020-12-02 21:34:55,626 INFO L226 Difference]: Without dead ends: 171 [2020-12-02 21:34:55,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-12-02 21:34:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-12-02 21:34:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 153. [2020-12-02 21:34:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-12-02 21:34:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2020-12-02 21:34:55,666 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 15 [2020-12-02 21:34:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:34:55,667 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2020-12-02 21:34:55,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 21:34:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2020-12-02 21:34:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 21:34:55,668 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:34:55,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:34:55,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-02 21:34:55,879 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:34:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:34:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash 756538793, now seen corresponding path program 1 times [2020-12-02 21:34:55,881 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:34:55,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100733213] [2020-12-02 21:34:55,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-02 21:34:56,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:34:56,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-02 21:34:56,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:34:56,922 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-12-02 21:34:57,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-02 21:34:57,288 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2020-12-02 21:34:57,290 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-02 21:34:57,768 WARN L197 SmtUtils]: Spent 477.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-12-02 21:34:57,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:34:57,774 INFO L547 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. [2020-12-02 21:34:57,774 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:48 [2020-12-02 21:34:58,237 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-12-02 21:34:58,592 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:34:58,592 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:34:58,593 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2020-12-02 21:34:58,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:34:58,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 21:34:58,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 21:34:58,649 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_4], 2=[v_arrayElimCell_3]} [2020-12-02 21:34:59,545 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:34:59,545 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:34:59,545 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 44 [2020-12-02 21:34:59,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:34:59,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 21:34:59,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 21:34:59,606 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_6], 2=[v_arrayElimCell_5]} [2020-12-02 21:35:00,057 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:35:00,058 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:35:00,058 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2020-12-02 21:35:00,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:35:00,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 21:35:00,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 21:35:00,113 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_8], 2=[v_arrayElimCell_7]} [2020-12-02 21:35:01,185 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:35:01,186 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:35:01,186 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2020-12-02 21:35:01,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:35:01,190 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 21:35:01,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 21:35:01,241 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_10], 2=[v_arrayElimCell_9]} [2020-12-02 21:35:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:35:01,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:35:02,485 WARN L197 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-12-02 21:35:03,668 WARN L197 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2020-12-02 21:35:03,680 INFO L639 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-12-02 21:35:05,617 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-12-02 21:35:05,630 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-02 21:35:05,763 INFO L382 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 15 treesize of output 13 [2020-12-02 21:35:05,852 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-02 21:35:05,934 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:35:05,935 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-02 21:35:06,838 WARN L197 SmtUtils]: Spent 903.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-02 21:35:06,839 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:35:06,845 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2020-12-02 21:35:06,846 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:69 [2020-12-02 21:35:08,441 WARN L197 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2020-12-02 21:35:08,446 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:35:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:35:09,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100733213] [2020-12-02 21:35:09,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:35:09,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2020-12-02 21:35:09,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311726242] [2020-12-02 21:35:09,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 21:35:09,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:35:09,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 21:35:09,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=105, Unknown=1, NotChecked=0, Total=132 [2020-12-02 21:35:09,197 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand 12 states. [2020-12-02 21:35:10,360 WARN L197 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-12-02 21:35:11,107 WARN L197 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-02 21:35:12,607 WARN L197 SmtUtils]: Spent 876.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2020-12-02 21:35:14,015 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2020-12-02 21:35:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:35:24,623 INFO L93 Difference]: Finished difference Result 162 states and 188 transitions. [2020-12-02 21:35:24,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:35:24,624 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-12-02 21:35:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:35:24,624 INFO L225 Difference]: With dead ends: 162 [2020-12-02 21:35:24,624 INFO L226 Difference]: Without dead ends: 42 [2020-12-02 21:35:24,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=64, Invalid=175, Unknown=1, NotChecked=0, Total=240 [2020-12-02 21:35:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-02 21:35:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-12-02 21:35:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-02 21:35:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-12-02 21:35:24,631 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 15 [2020-12-02 21:35:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:35:24,631 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-12-02 21:35:24,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 21:35:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-12-02 21:35:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 21:35:24,632 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:35:24,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:35:24,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-02 21:35:24,847 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:35:24,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:35:24,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1368879435, now seen corresponding path program 1 times [2020-12-02 21:35:24,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:35:24,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187204777] [2020-12-02 21:35:24,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-02 21:35:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:35:25,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-02 21:35:25,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:35:26,426 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-02 21:35:26,816 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-02 21:35:27,273 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-02 21:35:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:35:27,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:35:30,338 WARN L838 $PredicateComparison]: unable to prove that (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start___ieee754_pow_~x) (_ +zero 11 53)) is different from false [2020-12-02 21:35:32,536 WARN L860 $PredicateComparison]: unable to prove that (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start___ieee754_pow_~x) (_ +zero 11 53)) is different from true [2020-12-02 21:35:34,756 WARN L838 $PredicateComparison]: unable to prove that (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start_main_~x~0) (_ +zero 11 53)) is different from false [2020-12-02 21:35:36,970 WARN L860 $PredicateComparison]: unable to prove that (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start_main_~x~0) (_ +zero 11 53)) is different from true [2020-12-02 21:35:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:35:39,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187204777] [2020-12-02 21:35:39,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:35:39,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-12-02 21:35:39,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933477192] [2020-12-02 21:35:39,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-02 21:35:39,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:35:39,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-02 21:35:39,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=51, Unknown=4, NotChecked=30, Total=110 [2020-12-02 21:35:39,148 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 11 states. [2020-12-02 21:35:41,591 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_~one_pow~0 .cse0) (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode .cse0 (_ +zero 11 53))) (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start_main_~x~0) (_ +zero 11 53)))) is different from false [2020-12-02 21:35:43,788 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_~one_pow~0 .cse0) (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode .cse0 (_ +zero 11 53))) (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start_main_~x~0) (_ +zero 11 53)))) is different from true [2020-12-02 21:35:45,995 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_~one_pow~0 .cse0) (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start___ieee754_pow_~x) (_ +zero 11 53)) (= c_ULTIMATE.start___ieee754_pow_~x (fp.div c_currentRoundingMode .cse0 (_ +zero 11 53))))) is different from false [2020-12-02 21:35:48,197 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_~one_pow~0 .cse0) (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start___ieee754_pow_~x) (_ +zero 11 53)) (= c_ULTIMATE.start___ieee754_pow_~x (fp.div c_currentRoundingMode .cse0 (_ +zero 11 53))))) is different from true [2020-12-02 21:35:48,775 WARN L197 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-12-02 21:35:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:35:54,203 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-12-02 21:35:54,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 21:35:54,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2020-12-02 21:35:54,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:35:54,204 INFO L225 Difference]: With dead ends: 54 [2020-12-02 21:35:54,204 INFO L226 Difference]: Without dead ends: 51 [2020-12-02 21:35:54,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=34, Invalid=64, Unknown=8, NotChecked=76, Total=182 [2020-12-02 21:35:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-12-02 21:35:54,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2020-12-02 21:35:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-12-02 21:35:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2020-12-02 21:35:54,210 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 19 [2020-12-02 21:35:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:35:54,211 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2020-12-02 21:35:54,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-02 21:35:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-12-02 21:35:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-02 21:35:54,212 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:35:54,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:35:54,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-02 21:35:54,423 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:35:54,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:35:54,424 INFO L82 PathProgramCache]: Analyzing trace with hash -319058285, now seen corresponding path program 1 times [2020-12-02 21:35:54,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:35:54,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92810156] [2020-12-02 21:35:54,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-12-02 21:35:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:35:54,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-02 21:35:54,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:35:56,008 WARN L197 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2020-12-02 21:35:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:35:56,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:35:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:35:57,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92810156] [2020-12-02 21:35:57,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:35:57,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-12-02 21:35:57,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793084651] [2020-12-02 21:35:57,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-02 21:35:57,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:35:57,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-02 21:35:57,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-02 21:35:57,406 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 9 states. [2020-12-02 21:36:03,242 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-12-02 21:36:03,627 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2020-12-02 21:36:04,064 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-12-02 21:36:04,490 WARN L197 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-12-02 21:36:04,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:36:04,784 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2020-12-02 21:36:04,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:36:04,785 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-12-02 21:36:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:36:04,785 INFO L225 Difference]: With dead ends: 56 [2020-12-02 21:36:04,786 INFO L226 Difference]: Without dead ends: 53 [2020-12-02 21:36:04,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-02 21:36:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-12-02 21:36:04,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2020-12-02 21:36:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-12-02 21:36:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2020-12-02 21:36:04,791 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 21 [2020-12-02 21:36:04,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:36:04,792 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2020-12-02 21:36:04,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-02 21:36:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-12-02 21:36:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 21:36:04,793 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:36:04,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:36:05,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-02 21:36:05,007 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:36:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:36:05,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1262256800, now seen corresponding path program 1 times [2020-12-02 21:36:05,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:36:05,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2125545480] [2020-12-02 21:36:05,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-02 21:36:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:36:06,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjunts are in the unsatisfiable core [2020-12-02 21:36:06,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:36:06,609 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-02 21:36:07,010 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-02 21:36:07,474 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-02 21:36:08,011 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-02 21:36:08,638 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-02 21:36:09,732 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-02 21:36:09,742 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:36:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:36:11,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:36:17,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (or (not (= (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|)) (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start___ieee754_pow_~x))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))))) is different from false [2020-12-02 21:36:20,116 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (or (not (= (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|)) (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start___ieee754_pow_~x))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))))) is different from true [2020-12-02 21:36:22,371 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (or (not (= (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|)) (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start_main_~x~0))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))))) is different from false [2020-12-02 21:36:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:36:26,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2125545480] [2020-12-02 21:36:26,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:36:26,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 17 [2020-12-02 21:36:26,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61336242] [2020-12-02 21:36:26,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-02 21:36:26,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:36:26,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-02 21:36:26,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=203, Unknown=3, NotChecked=58, Total=306 [2020-12-02 21:36:26,427 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 18 states. [2020-12-02 21:36:29,036 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_~one_pow~0 .cse0) (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode .cse0 (_ +zero 11 53))) (forall ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (or (not (= (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|)) (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start_main_~x~0))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))))))) is different from true [2020-12-02 21:36:32,199 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_~one_pow~0 .cse0) (forall ((|v_skolemized_q#valueAsBitvector_73| (_ BitVec 64))) (or (not (= (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|)) (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start___ieee754_pow_~x))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_73|))))) (= c_ULTIMATE.start___ieee754_pow_~x (fp.div c_currentRoundingMode .cse0 (_ +zero 11 53))))) is different from true [2020-12-02 21:36:33,223 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-12-02 21:36:34,332 WARN L197 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-02 21:36:35,892 WARN L197 SmtUtils]: Spent 844.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-12-02 21:36:37,270 WARN L197 SmtUtils]: Spent 761.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-12-02 21:36:40,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:36:40,701 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2020-12-02 21:36:40,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 21:36:40,701 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 23 [2020-12-02 21:36:40,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:36:40,702 INFO L225 Difference]: With dead ends: 53 [2020-12-02 21:36:40,702 INFO L226 Difference]: Without dead ends: 43 [2020-12-02 21:36:40,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=91, Invalid=300, Unknown=5, NotChecked=156, Total=552 [2020-12-02 21:36:40,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-02 21:36:40,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-12-02 21:36:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-02 21:36:40,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2020-12-02 21:36:40,706 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 23 [2020-12-02 21:36:40,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:36:40,706 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2020-12-02 21:36:40,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-12-02 21:36:40,707 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-12-02 21:36:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-02 21:36:40,708 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:36:40,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:36:40,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-02 21:36:40,914 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:36:40,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:36:40,915 INFO L82 PathProgramCache]: Analyzing trace with hash 826325992, now seen corresponding path program 1 times [2020-12-02 21:36:40,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:36:40,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901826367] [2020-12-02 21:36:40,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-02 21:36:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:36:41,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjunts are in the unsatisfiable core [2020-12-02 21:36:41,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:36:43,163 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-12-02 21:36:43,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:36:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:36:44,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:36:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:36:49,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901826367] [2020-12-02 21:36:49,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:36:49,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2020-12-02 21:36:49,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694634136] [2020-12-02 21:36:49,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-02 21:36:49,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:36:49,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-02 21:36:49,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-12-02 21:36:49,504 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 16 states. [2020-12-02 21:36:50,565 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-12-02 21:36:51,393 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-12-02 21:36:52,178 WARN L197 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-02 21:36:52,927 WARN L197 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-12-02 21:36:53,849 WARN L197 SmtUtils]: Spent 574.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-12-02 21:36:54,585 WARN L197 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-12-02 21:36:55,468 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2020-12-02 21:36:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:36:55,740 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2020-12-02 21:36:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 21:36:55,741 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2020-12-02 21:36:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:36:55,742 INFO L225 Difference]: With dead ends: 50 [2020-12-02 21:36:55,742 INFO L226 Difference]: Without dead ends: 37 [2020-12-02 21:36:55,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2020-12-02 21:36:55,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-12-02 21:36:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-12-02 21:36:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-12-02 21:36:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2020-12-02 21:36:55,746 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 25 [2020-12-02 21:36:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:36:55,747 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2020-12-02 21:36:55,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-02 21:36:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2020-12-02 21:36:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-02 21:36:55,748 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:36:55,748 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:36:55,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-02 21:36:55,952 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:36:55,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:36:55,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1611916476, now seen corresponding path program 1 times [2020-12-02 21:36:55,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:36:55,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458293403] [2020-12-02 21:36:55,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-02 21:36:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:36:57,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-02 21:36:57,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:36:57,922 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-02 21:36:58,327 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-02 21:36:59,178 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-02 21:36:59,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-02 21:36:59,512 INFO L244 Elim1Store]: Index analysis took 214 ms [2020-12-02 21:36:59,716 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2020-12-02 21:36:59,718 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-02 21:37:00,231 WARN L197 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-12-02 21:37:00,231 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:00,233 INFO L547 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. [2020-12-02 21:37:00,234 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:46 [2020-12-02 21:37:00,931 WARN L197 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-12-02 21:37:01,256 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:01,257 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:01,257 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 87 [2020-12-02 21:37:01,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:01,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 21:37:01,306 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_13], 2=[v_arrayElimCell_12]} [2020-12-02 21:37:02,053 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-02 21:37:02,420 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:02,421 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:02,421 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 87 [2020-12-02 21:37:02,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:02,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 21:37:02,474 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_15], 2=[v_arrayElimCell_14]} [2020-12-02 21:37:02,831 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:02,832 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:02,832 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 87 [2020-12-02 21:37:02,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:02,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 21:37:02,882 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_17], 2=[v_arrayElimCell_16]} [2020-12-02 21:37:03,544 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-02 21:37:03,845 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:03,846 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:03,846 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 87 [2020-12-02 21:37:03,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:03,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 21:37:03,888 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_19], 2=[v_arrayElimCell_18]} [2020-12-02 21:37:04,688 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-02 21:37:05,000 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:05,001 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:05,001 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 87 [2020-12-02 21:37:05,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:05,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 21:37:05,046 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_21], 2=[v_arrayElimCell_20]} [2020-12-02 21:37:05,427 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:05,428 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:05,428 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 87 [2020-12-02 21:37:05,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:05,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 21:37:05,468 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_23], 2=[v_arrayElimCell_22]} [2020-12-02 21:37:06,326 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-12-02 21:37:06,629 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:06,629 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:06,630 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 92 [2020-12-02 21:37:06,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:06,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 21:37:06,668 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_25], 2=[v_arrayElimCell_24]} [2020-12-02 21:37:09,592 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#memory_int_134| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (let ((.cse5 (select |v_#memory_int_134| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|))) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode 1.0)) (.cse1 (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|))) (.cse4 (select .cse5 (_ bv4 32)))) (and (= (fp.div currentRoundingMode .cse0 (_ +zero 11 53)) .cse1) (= c_ULTIMATE.start___ieee754_pow_~z~1 (fp.div currentRoundingMode .cse0 (let ((.cse2 (let ((.cse3 (bvand (_ bv2147483647 32) .cse4))) (concat .cse3 (select (store (store (select |v_#memory_int_134| |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse3) (_ bv0 32)))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)) .cse1) (= .cse4 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)) (= (select .cse5 (_ bv0 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)))))) is different from true [2020-12-02 21:37:09,937 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:09,937 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:09,937 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 92 [2020-12-02 21:37:09,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:09,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 21:37:09,983 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_27], 2=[v_arrayElimCell_26]} [2020-12-02 21:37:10,351 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:10,351 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:10,352 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 92 [2020-12-02 21:37:10,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:10,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 21:37:10,395 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_29], 2=[v_arrayElimCell_28]} [2020-12-02 21:37:13,162 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_#memory_int_134| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (let ((.cse5 (select |v_#memory_int_134| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|))) (let ((.cse1 (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|))) (.cse0 ((_ to_fp 11 53) currentRoundingMode 1.0)) (.cse4 (select .cse5 (_ bv4 32)))) (and (= (fp.div currentRoundingMode .cse0 (_ +zero 11 53)) .cse1) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)) .cse1) (= |c_ULTIMATE.start___ieee754_pow_#res| (fp.div currentRoundingMode .cse0 (let ((.cse2 (let ((.cse3 (bvand (_ bv2147483647 32) .cse4))) (concat .cse3 (select (store (store (select |v_#memory_int_134| |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse3) (_ bv0 32)))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))))) (= .cse4 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|)) (= (select .cse5 (_ bv0 32)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)))))) is different from true [2020-12-02 21:37:13,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:13,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:13,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 21:37:13,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:13,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:37:13,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 21:37:13,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-02 21:37:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:37:15,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:37:19,146 WARN L838 $PredicateComparison]: unable to prove that (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start___ieee754_pow_~z~1) (_ +zero 11 53)) is different from false [2020-12-02 21:37:21,343 WARN L860 $PredicateComparison]: unable to prove that (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start___ieee754_pow_~z~1) (_ +zero 11 53)) is different from true [2020-12-02 21:37:23,552 WARN L838 $PredicateComparison]: unable to prove that (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start___ieee754_pow_~ax~0) (_ +zero 11 53)) is different from false [2020-12-02 21:37:25,732 WARN L860 $PredicateComparison]: unable to prove that (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start___ieee754_pow_~ax~0) (_ +zero 11 53)) is different from true [2020-12-02 21:37:27,923 WARN L838 $PredicateComparison]: unable to prove that (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 |c_ULTIMATE.start_fabs_double_#res|) (_ +zero 11 53)) is different from false [2020-12-02 21:37:30,136 WARN L860 $PredicateComparison]: unable to prove that (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 |c_ULTIMATE.start_fabs_double_#res|) (_ +zero 11 53)) is different from true [2020-12-02 21:37:32,323 WARN L838 $PredicateComparison]: unable to prove that (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start_fabs_double_~x) (_ +zero 11 53)) is different from false [2020-12-02 21:37:34,513 WARN L860 $PredicateComparison]: unable to prove that (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 c_ULTIMATE.start_fabs_double_~x) (_ +zero 11 53)) is different from true [2020-12-02 21:37:37,195 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64))) (or (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse0 (let ((.cse1 (bvand (_ bv2147483647 32) c_ULTIMATE.start_fabs_double_~high~0))) (concat .cse1 (select (store (store (select |c_#memory_int| |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse1) (_ bv0 32)))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (_ +zero 11 53)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)) c_ULTIMATE.start_fabs_double_~x)))) is different from false [2020-12-02 21:37:39,394 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64))) (or (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse0 (let ((.cse1 (bvand (_ bv2147483647 32) c_ULTIMATE.start_fabs_double_~high~0))) (concat .cse1 (select (store (store (select |c_#memory_int| |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse1) (_ bv0 32)))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (_ +zero 11 53)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)) c_ULTIMATE.start_fabs_double_~x)))) is different from true [2020-12-02 21:37:39,835 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:37:39,836 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:39,836 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:37:40,218 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:40,218 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:40,218 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:37:40,220 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:40,221 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:37:40,222 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:37:40,264 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_31], 2=[v_arrayElimCell_30]} [2020-12-02 21:37:45,575 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|#memory_int| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64))) (or (not (= c_ULTIMATE.start_fabs_double_~x (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.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse0 (let ((.cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (let ((.cse1 (bvand (_ bv2147483647 32) .cse2))) (concat .cse1 (select (store (store (select (store |#memory_int| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (store (store (select |#memory_int| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)) (_ bv4 32) .cse2)) |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse1) (_ bv0 32))))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (_ +zero 11 53)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)) c_ULTIMATE.start_fabs_double_~x)))) is different from true [2020-12-02 21:37:46,026 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:37:46,027 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:46,027 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:37:46,339 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:46,340 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:46,341 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:37:46,342 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:46,342 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:37:46,343 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:37:46,379 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_33], 2=[v_arrayElimCell_32]} [2020-12-02 21:37:51,645 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|#memory_int| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)))) (or (not (= .cse0 (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.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse1 (let ((.cse3 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (let ((.cse2 (bvand (_ bv2147483647 32) .cse3))) (concat .cse2 (select (store (store (select (store |#memory_int| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (store (store (select |#memory_int| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)) (_ bv4 32) .cse3)) |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse2) (_ bv0 32))))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (_ +zero 11 53)) (not (= c_ULTIMATE.start___ieee754_pow_~x .cse0))))) is different from true [2020-12-02 21:37:52,012 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:37:52,016 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:52,016 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:37:52,316 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:52,317 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:52,317 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:37:52,318 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:52,318 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:37:52,319 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:37:52,352 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_35], 2=[v_arrayElimCell_34]} [2020-12-02 21:37:55,620 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:37:55,621 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:55,621 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:37:55,937 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:55,937 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:55,938 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:37:55,939 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:55,939 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:37:55,941 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:37:55,986 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_37], 2=[v_arrayElimCell_36]} [2020-12-02 21:37:59,379 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:37:59,379 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:59,380 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:37:59,654 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:37:59,654 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:59,654 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:37:59,657 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:59,658 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:37:59,658 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:37:59,694 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_39], 2=[v_arrayElimCell_38]} [2020-12-02 21:38:02,930 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:38:02,931 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:02,931 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:38:03,242 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:38:03,242 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:03,243 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:38:03,244 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:38:03,245 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:38:03,246 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:38:03,287 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_41], 2=[v_arrayElimCell_40]} [2020-12-02 21:38:06,568 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:38:06,568 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:06,569 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:38:06,865 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:38:06,866 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:06,866 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:38:06,867 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:38:06,868 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:38:06,869 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:38:06,913 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_43], 2=[v_arrayElimCell_42]} [2020-12-02 21:38:10,181 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:38:10,181 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:10,182 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:38:10,563 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:38:10,563 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:10,563 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:38:10,566 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:38:10,567 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:38:10,567 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:38:10,613 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_45], 2=[v_arrayElimCell_44]} [2020-12-02 21:38:14,081 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:38:14,082 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:14,082 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:38:14,362 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:38:14,362 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:14,363 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:38:14,363 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:38:14,364 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:38:14,365 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:38:14,399 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_47], 2=[v_arrayElimCell_46]} [2020-12-02 21:38:17,648 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:38:17,649 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:17,649 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:38:17,921 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:38:17,922 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:17,922 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:38:17,923 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:38:17,924 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:38:17,925 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:38:17,960 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_49], 2=[v_arrayElimCell_48]} [2020-12-02 21:38:21,193 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:38:21,194 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:21,194 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:38:21,471 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:38:21,471 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:21,472 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:38:21,473 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:38:21,474 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:38:21,474 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:38:21,506 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_51], 2=[v_arrayElimCell_50]} [2020-12-02 21:38:26,558 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|v_#memory_int_139| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)))) (or (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse0 (let ((.cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (let ((.cse1 (bvand (_ bv2147483647 32) .cse2))) (concat .cse1 (select (store (store (select (store |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (store (store (select |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)) (_ bv4 32) .cse2)) |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse1) (_ bv0 32))))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (_ +zero 11 53)) (not (= .cse3 (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|)))) (not (= c_ULTIMATE.start___ieee754_pow_~x .cse3))))) (forall ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (not (= (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|)) c_ULTIMATE.start___ieee754_pow_~x)))) is different from false [2020-12-02 21:38:28,746 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|v_#memory_int_139| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)))) (or (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse0 (let ((.cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (let ((.cse1 (bvand (_ bv2147483647 32) .cse2))) (concat .cse1 (select (store (store (select (store |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (store (store (select |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)) (_ bv4 32) .cse2)) |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse1) (_ bv0 32))))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (_ +zero 11 53)) (not (= .cse3 (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|)))) (not (= c_ULTIMATE.start___ieee754_pow_~x .cse3))))) (forall ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (not (= (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|)) c_ULTIMATE.start___ieee754_pow_~x)))) is different from true [2020-12-02 21:38:29,069 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:38:29,071 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:29,072 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:38:29,339 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:38:29,340 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:29,340 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:38:29,341 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:38:29,342 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:38:29,343 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:38:29,380 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_53], 2=[v_arrayElimCell_52]} [2020-12-02 21:38:34,526 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|v_#memory_int_139| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)))) (or (not (= (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|)) .cse0)) (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse1 (let ((.cse3 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (let ((.cse2 (bvand (_ bv2147483647 32) .cse3))) (concat .cse2 (select (store (store (select (store |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (store (store (select |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)) (_ bv4 32) .cse3)) |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse2) (_ bv0 32))))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~x~0 .cse0)) (not (= .cse0 (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|))))))) is different from true [2020-12-02 21:38:34,644 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-02 21:38:34,806 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-02 21:38:34,806 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:34,807 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 88 [2020-12-02 21:38:35,065 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-02 21:38:35,066 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:35,066 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 86 [2020-12-02 21:38:35,067 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:38:35,068 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-12-02 21:38:35,068 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-12-02 21:38:35,103 INFO L443 ElimStorePlain]: Different costs {0=[v_arrayElimCell_55], 2=[v_arrayElimCell_54]} [2020-12-02 21:38:40,105 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|v_#memory_int_139| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)))) (or (not (= (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|)) .cse0)) (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse1 (let ((.cse3 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (let ((.cse2 (bvand (_ bv2147483647 32) .cse3))) (concat .cse2 (select (store (store (select (store |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (store (store (select |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)) (_ bv4 32) .cse3)) |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse2) (_ bv0 32))))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (_ +zero 11 53)) (not (= .cse0 (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|)))) (not (= .cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (_ +zero 11 53))))))) is different from true [2020-12-02 21:38:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:40,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458293403] [2020-12-02 21:38:40,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:38:40,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 14] imperfect sequences [] total 25 [2020-12-02 21:38:40,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562054043] [2020-12-02 21:38:40,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-12-02 21:38:40,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:38:40,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-12-02 21:38:40,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=20, NotChecked=420, Total=650 [2020-12-02 21:38:40,117 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 26 states. [2020-12-02 21:38:43,383 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|v_#memory_int_139| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)))) (or (not (= (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|)) .cse0)) (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse1 (let ((.cse3 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (let ((.cse2 (bvand (_ bv2147483647 32) .cse3))) (concat .cse2 (select (store (store (select (store |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (store (store (select |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)) (_ bv4 32) .cse3)) |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse2) (_ bv0 32))))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (_ +zero 11 53)) (not (= .cse0 (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|)))) (not (= .cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (_ +zero 11 53))))))) (= c_~one_pow~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2020-12-02 21:38:46,314 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_~one_pow~0 .cse0) (= c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode .cse0 (_ +zero 11 53))) (forall ((|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|v_#memory_int_139| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)))) (or (not (= (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|)) .cse1)) (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse2 (let ((.cse4 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (let ((.cse3 (bvand (_ bv2147483647 32) .cse4))) (concat .cse3 (select (store (store (select (store |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (store (store (select |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)) (_ bv4 32) .cse4)) |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse3) (_ bv0 32))))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (_ +zero 11 53)) (not (= c_ULTIMATE.start_main_~x~0 .cse1)) (not (= .cse1 (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|))))))))) is different from true [2020-12-02 21:38:49,351 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (or (forall ((|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|v_#memory_int_139| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)))) (or (fp.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse0 (let ((.cse2 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (let ((.cse1 (bvand (_ bv2147483647 32) .cse2))) (concat .cse1 (select (store (store (select (store |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (store (store (select |v_#memory_int_139| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)) (_ bv4 32) .cse2)) |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse1) (_ bv0 32))))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (_ +zero 11 53)) (not (= .cse3 (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|)))) (not (= c_ULTIMATE.start___ieee754_pow_~x .cse3))))) (forall ((|v_skolemized_q#valueAsBitvector_75| (_ BitVec 64))) (not (= (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|)) c_ULTIMATE.start___ieee754_pow_~x)))) (= c_~one_pow~0 .cse4) (= c_ULTIMATE.start___ieee754_pow_~x (fp.div c_currentRoundingMode .cse4 (_ +zero 11 53))))) is different from true [2020-12-02 21:38:52,305 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|#memory_int| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)))) (or (not (= .cse0 (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.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse1 (let ((.cse3 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (let ((.cse2 (bvand (_ bv2147483647 32) .cse3))) (concat .cse2 (select (store (store (select (store |#memory_int| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (store (store (select |#memory_int| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)) (_ bv4 32) .cse3)) |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse2) (_ bv0 32))))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (_ +zero 11 53)) (not (= c_ULTIMATE.start___ieee754_pow_~x .cse0))))) (= c_~one_pow~0 .cse4) (= c_ULTIMATE.start___ieee754_pow_~x (fp.div c_currentRoundingMode .cse4 (_ +zero 11 53))))) is different from true [2020-12-02 21:38:55,305 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_ULTIMATE.start_fabs_double_~x (fp.div c_currentRoundingMode .cse0 (_ +zero 11 53))) (= c_~one_pow~0 .cse0) (forall ((|v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (_ BitVec 32)) (|v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5| (_ BitVec 32)) (|#memory_int| (Array (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32)))) (|v_skolemized_q#valueAsBitvector_76| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_77| (_ BitVec 64))) (or (not (= c_ULTIMATE.start_fabs_double_~x (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.eq (fp.div c_currentRoundingMode c_~one_pow~0 (let ((.cse1 (let ((.cse3 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_76|))) (let ((.cse2 (bvand (_ bv2147483647 32) .cse3))) (concat .cse2 (select (store (store (select (store |#memory_int| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5| (store (store (select |#memory_int| |v_ULTIMATE.start_fabs_double_~#gh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_76|)) (_ bv4 32) .cse3)) |v_ULTIMATE.start_fabs_double_~#sh_u~3.base_5|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_77|)) (_ bv4 32) .cse2) (_ bv0 32))))))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) (_ +zero 11 53)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_77|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_77|)) c_ULTIMATE.start_fabs_double_~x)))))) is different from true [2020-12-02 21:38:57,378 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-12-02 21:38:57,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:38:57,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-02 21:38:57,581 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 45 more [2020-12-02 21:38:57,588 INFO L168 Benchmark]: Toolchain (without parser) took 369506.49 ms. Allocated memory was 44.0 MB in the beginning and 73.4 MB in the end (delta: 29.4 MB). Free memory was 20.3 MB in the beginning and 28.7 MB in the end (delta: -8.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 16.1 GB. [2020-12-02 21:38:57,589 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 35.7 MB. Free memory is still 20.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 21:38:57,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.63 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 29.1 MB in the beginning and 32.0 MB in the end (delta: -2.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-02 21:38:57,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.94 ms. Allocated memory is still 54.5 MB. Free memory was 32.0 MB in the beginning and 27.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-02 21:38:57,590 INFO L168 Benchmark]: Boogie Preprocessor took 182.86 ms. Allocated memory is still 54.5 MB. Free memory was 27.1 MB in the beginning and 34.4 MB in the end (delta: -7.2 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. [2020-12-02 21:38:57,591 INFO L168 Benchmark]: RCFGBuilder took 84991.20 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 34.4 MB in the beginning and 32.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 16.1 GB. [2020-12-02 21:38:57,591 INFO L168 Benchmark]: TraceAbstraction took 283437.84 ms. Allocated memory is still 73.4 MB. Free memory was 32.0 MB in the beginning and 28.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.0 MB. Max. memory is 16.1 GB. [2020-12-02 21:38:57,600 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 35.7 MB. Free memory is still 20.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 731.63 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 29.1 MB in the beginning and 32.0 MB in the end (delta: -2.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 130.94 ms. Allocated memory is still 54.5 MB. Free memory was 32.0 MB in the beginning and 27.1 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 182.86 ms. Allocated memory is still 54.5 MB. Free memory was 27.1 MB in the beginning and 34.4 MB in the end (delta: -7.2 MB). Peak memory consumption was 8.6 MB. Max. memory is 16.1 GB. * RCFGBuilder took 84991.20 ms. Allocated memory was 54.5 MB in the beginning and 73.4 MB in the end (delta: 18.9 MB). Free memory was 34.4 MB in the beginning and 32.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 26.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 283437.84 ms. Allocated memory is still 73.4 MB. Free memory was 32.0 MB in the beginning and 28.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...