./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_0621b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cbb939d5 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_0621b.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 53b93f4c2daa7fb311d5fc7342a0c6c62ac64fa8 ........................................................................................................................................................................................................................................................................................................................... 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_0621b.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 53b93f4c2daa7fb311d5fc7342a0c6c62ac64fa8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.2.0-cbb939d [2020-11-23 16:25:20,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-23 16:25:20,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-23 16:25:20,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-23 16:25:20,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-23 16:25:20,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-23 16:25:20,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-23 16:25:20,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-23 16:25:20,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-23 16:25:20,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-23 16:25:20,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-23 16:25:20,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-23 16:25:20,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-23 16:25:20,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-23 16:25:20,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-23 16:25:20,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-23 16:25:20,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-23 16:25:20,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-23 16:25:20,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-23 16:25:20,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-23 16:25:20,747 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-23 16:25:20,749 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-23 16:25:20,751 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-23 16:25:20,752 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-23 16:25:20,756 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-23 16:25:20,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-23 16:25:20,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-23 16:25:20,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-23 16:25:20,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-23 16:25:20,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-23 16:25:20,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-23 16:25:20,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-23 16:25:20,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-23 16:25:20,765 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-23 16:25:20,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-23 16:25:20,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-23 16:25:20,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-23 16:25:20,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-23 16:25:20,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-23 16:25:20,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-23 16:25:20,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-23 16:25:20,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-23 16:25:20,810 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-23 16:25:20,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-23 16:25:20,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-23 16:25:20,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-23 16:25:20,814 INFO L138 SettingsManager]: * Use SBE=true [2020-11-23 16:25:20,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-23 16:25:20,815 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-23 16:25:20,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-23 16:25:20,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-23 16:25:20,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-23 16:25:20,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-23 16:25:20,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-23 16:25:20,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-23 16:25:20,817 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-23 16:25:20,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-23 16:25:20,818 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-23 16:25:20,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-23 16:25:20,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-23 16:25:20,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-23 16:25:20,819 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-23 16:25:20,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-23 16:25:20,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 16:25:20,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-23 16:25:20,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-23 16:25:20,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-23 16:25:20,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-23 16:25:20,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-23 16:25:20,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-23 16:25:20,822 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-23 16:25:20,822 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 -> 53b93f4c2daa7fb311d5fc7342a0c6c62ac64fa8 [2020-11-23 16:25:21,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-23 16:25:21,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-23 16:25:21,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-23 16:25:21,341 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-23 16:25:21,344 INFO L275 PluginConnector]: CDTParser initialized [2020-11-23 16:25:21,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0621b.c [2020-11-23 16:25:21,439 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/512a1c1ce/dc8ba55917ee4c8bbc8a9207da914608/FLAG4021d3b69 [2020-11-23 16:25:22,183 INFO L306 CDTParser]: Found 1 translation units. [2020-11-23 16:25:22,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0621b.c [2020-11-23 16:25:22,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/512a1c1ce/dc8ba55917ee4c8bbc8a9207da914608/FLAG4021d3b69 [2020-11-23 16:25:22,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/512a1c1ce/dc8ba55917ee4c8bbc8a9207da914608 [2020-11-23 16:25:22,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-23 16:25:22,543 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-23 16:25:22,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-23 16:25:22,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-23 16:25:22,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-23 16:25:22,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:25:22" (1/1) ... [2020-11-23 16:25:22,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f540003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22, skipping insertion in model container [2020-11-23 16:25:22,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:25:22" (1/1) ... [2020-11-23 16:25:22,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-23 16:25:22,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-23 16:25:22,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-23 16:25:22,892 INFO L203 MainTranslator]: Completed pre-run [2020-11-23 16:25:22,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-23 16:25:22,982 INFO L208 MainTranslator]: Completed translation [2020-11-23 16:25:22,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22 WrapperNode [2020-11-23 16:25:22,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-23 16:25:22,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-23 16:25:22,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-23 16:25:22,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-23 16:25:22,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22" (1/1) ... [2020-11-23 16:25:23,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22" (1/1) ... [2020-11-23 16:25:23,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-23 16:25:23,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-23 16:25:23,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-23 16:25:23,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-23 16:25:23,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22" (1/1) ... [2020-11-23 16:25:23,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22" (1/1) ... [2020-11-23 16:25:23,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22" (1/1) ... [2020-11-23 16:25:23,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22" (1/1) ... [2020-11-23 16:25:23,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22" (1/1) ... [2020-11-23 16:25:23,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22" (1/1) ... [2020-11-23 16:25:23,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22" (1/1) ... [2020-11-23 16:25:23,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-23 16:25:23,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-23 16:25:23,129 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-23 16:25:23,129 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-23 16:25:23,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22" (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-11-23 16:25:23,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-23 16:25:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-23 16:25:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-11-23 16:25:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-23 16:25:23,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-11-23 16:25:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-23 16:25:23,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-23 16:25:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-23 16:25:23,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2020-11-23 16:25:23,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-23 16:25:23,973 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-23 16:25:23,973 INFO L298 CfgBuilder]: Removed 18 assume(true) statements. [2020-11-23 16:25:23,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:25:23 BoogieIcfgContainer [2020-11-23 16:25:23,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-23 16:25:23,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-23 16:25:23,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-23 16:25:23,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-23 16:25:23,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:25:22" (1/3) ... [2020-11-23 16:25:23,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2863b39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:25:23, skipping insertion in model container [2020-11-23 16:25:23,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:22" (2/3) ... [2020-11-23 16:25:23,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2863b39e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:25:23, skipping insertion in model container [2020-11-23 16:25:23,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:25:23" (3/3) ... [2020-11-23 16:25:23,990 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0621b.c [2020-11-23 16:25:24,009 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-23 16:25:24,014 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-23 16:25:24,045 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-23 16:25:24,102 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-23 16:25:24,103 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-23 16:25:24,103 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-23 16:25:24,103 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-23 16:25:24,104 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-23 16:25:24,104 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-23 16:25:24,104 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-23 16:25:24,104 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-23 16:25:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-11-23 16:25:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-23 16:25:24,149 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:25:24,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 16:25:24,153 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:25:24,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:25:24,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1035664421, now seen corresponding path program 1 times [2020-11-23 16:25:24,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-23 16:25:24,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843938261] [2020-11-23 16:25:24,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-23 16:25:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 16:25:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 16:25:24,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843938261] [2020-11-23 16:25:24,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-23 16:25:24,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-23 16:25:24,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338642335] [2020-11-23 16:25:24,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-23 16:25:24,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-23 16:25:24,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-23 16:25:24,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-23 16:25:24,415 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2020-11-23 16:25:24,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:25:24,442 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2020-11-23 16:25:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-23 16:25:24,444 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-11-23 16:25:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:25:24,458 INFO L225 Difference]: With dead ends: 67 [2020-11-23 16:25:24,459 INFO L226 Difference]: Without dead ends: 31 [2020-11-23 16:25:24,462 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-23 16:25:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-11-23 16:25:24,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-11-23 16:25:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-23 16:25:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-11-23 16:25:24,527 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2020-11-23 16:25:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:25:24,528 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-11-23 16:25:24,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-23 16:25:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2020-11-23 16:25:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-23 16:25:24,530 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:25:24,531 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 16:25:24,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-23 16:25:24,532 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:25:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:25:24,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1843594333, now seen corresponding path program 1 times [2020-11-23 16:25:24,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-23 16:25:24,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173109794] [2020-11-23 16:25:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-23 16:25:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-23 16:25:24,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-23 16:25:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-23 16:25:24,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-23 16:25:24,796 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-23 16:25:24,796 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-23 16:25:24,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-23 16:25:24,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:25:24 BoogieIcfgContainer [2020-11-23 16:25:24,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-23 16:25:24,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-23 16:25:24,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-23 16:25:24,903 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-23 16:25:24,904 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:25:23" (3/4) ... [2020-11-23 16:25:24,911 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-23 16:25:24,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-23 16:25:24,919 INFO L168 Benchmark]: Toolchain (without parser) took 2376.34 ms. Allocated memory was 39.8 MB in the beginning and 58.7 MB in the end (delta: 18.9 MB). Free memory was 17.0 MB in the beginning and 31.3 MB in the end (delta: -14.3 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2020-11-23 16:25:24,920 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 39.8 MB. Free memory was 24.6 MB in the beginning and 24.6 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 16:25:24,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 439.72 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.3 MB in the beginning and 31.4 MB in the end (delta: -15.0 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. [2020-11-23 16:25:24,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.59 ms. Allocated memory is still 48.2 MB. Free memory was 31.2 MB in the beginning and 29.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-23 16:25:24,926 INFO L168 Benchmark]: Boogie Preprocessor took 53.52 ms. Allocated memory is still 48.2 MB. Free memory was 29.0 MB in the beginning and 27.1 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 16:25:24,928 INFO L168 Benchmark]: RCFGBuilder took 847.82 ms. Allocated memory is still 48.2 MB. Free memory was 26.9 MB in the beginning and 28.8 MB in the end (delta: -1.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. [2020-11-23 16:25:24,929 INFO L168 Benchmark]: TraceAbstraction took 922.31 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 28.4 MB in the beginning and 31.6 MB in the end (delta: -3.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-11-23 16:25:24,933 INFO L168 Benchmark]: Witness Printer took 9.56 ms. Allocated memory is still 58.7 MB. Free memory was 31.6 MB in the beginning and 31.3 MB in the end (delta: 317.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 16:25:24,951 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.49 ms. Allocated memory is still 39.8 MB. Free memory was 24.6 MB in the beginning and 24.6 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 439.72 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.3 MB in the beginning and 31.4 MB in the end (delta: -15.0 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 87.59 ms. Allocated memory is still 48.2 MB. Free memory was 31.2 MB in the beginning and 29.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 53.52 ms. Allocated memory is still 48.2 MB. Free memory was 29.0 MB in the beginning and 27.1 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 847.82 ms. Allocated memory is still 48.2 MB. Free memory was 26.9 MB in the beginning and 28.8 MB in the end (delta: -1.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 922.31 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 28.4 MB in the beginning and 31.6 MB in the end (delta: -3.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Witness Printer took 9.56 ms. Allocated memory is still 58.7 MB. Free memory was 31.6 MB in the beginning and 31.3 MB in the end (delta: 317.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 84, overapproximation of bitwiseAnd at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 146. Possible FailurePath: [L39-L44] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L46-L51] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L53-L60] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L62-L64] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; VAL [aT_atan={7:0}, atanhi_atan={11:0}, atanlo_atan={10:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L143] double x = -1.0 / 0.0; [L67] double w, s1, s2, z; [L68] __int32_t ix, hx, id; VAL [aT_atan={7:0}, atanhi_atan={11:0}, atanlo_atan={10:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L71] ieee_double_shape_type gh_u; [L72] gh_u.value = (x) [L73] EXPR gh_u.parts.msw [L73] (hx) = gh_u.parts.msw [L75] ix = hx & 0x7fffffff VAL [aT_atan={7:0}, atanhi_atan={11:0}, atanlo_atan={10:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L76] COND TRUE ix >= 0x44100000 [L77] __uint32_t low; VAL [aT_atan={7:0}, atanhi_atan={11:0}, atanlo_atan={10:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L79] ieee_double_shape_type gl_u; [L80] gl_u.value = (x) [L81] EXPR gl_u.parts.lsw [L81] (low) = gl_u.parts.lsw [L83] COND TRUE ix > 0x7ff00000 || (ix == 0x7ff00000 && (low != 0)) [L84] return x + x; VAL [aT_atan={7:0}, atanhi_atan={11:0}, atanlo_atan={10:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L144] double res = atan_double(x); [L146] COND TRUE res != -pi_o_2 VAL [aT_atan={7:0}, atanhi_atan={11:0}, atanlo_atan={10:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L3] __assert_fail("0", "double_req_bl_0621b.c", 3, "reach_error") VAL [aT_atan={7:0}, atanhi_atan={11:0}, atanlo_atan={10:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 44 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-cbb939d [2020-11-23 16:25:29,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-23 16:25:29,806 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-23 16:25:29,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-23 16:25:29,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-23 16:25:29,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-23 16:25:29,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-23 16:25:29,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-23 16:25:29,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-23 16:25:29,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-23 16:25:29,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-23 16:25:29,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-23 16:25:29,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-23 16:25:29,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-23 16:25:29,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-23 16:25:29,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-23 16:25:29,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-23 16:25:29,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-23 16:25:29,935 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-23 16:25:29,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-23 16:25:29,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-23 16:25:29,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-23 16:25:29,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-23 16:25:29,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-23 16:25:29,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-23 16:25:29,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-23 16:25:29,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-23 16:25:29,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-23 16:25:29,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-23 16:25:29,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-23 16:25:29,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-23 16:25:29,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-23 16:25:29,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-23 16:25:30,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-23 16:25:30,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-23 16:25:30,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-23 16:25:30,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-23 16:25:30,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-23 16:25:30,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-23 16:25:30,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-23 16:25:30,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-23 16:25:30,032 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-23 16:25:30,156 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-23 16:25:30,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-23 16:25:30,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-23 16:25:30,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-23 16:25:30,169 INFO L138 SettingsManager]: * Use SBE=true [2020-11-23 16:25:30,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-23 16:25:30,170 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-23 16:25:30,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-23 16:25:30,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-23 16:25:30,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-23 16:25:30,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-23 16:25:30,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-23 16:25:30,176 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-23 16:25:30,177 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-23 16:25:30,177 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-23 16:25:30,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-23 16:25:30,178 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-23 16:25:30,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-23 16:25:30,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-23 16:25:30,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-23 16:25:30,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-23 16:25:30,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-23 16:25:30,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 16:25:30,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-23 16:25:30,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-23 16:25:30,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-23 16:25:30,182 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-23 16:25:30,183 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-23 16:25:30,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-23 16:25:30,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-23 16:25:30,184 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-23 16:25:30,184 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 -> 53b93f4c2daa7fb311d5fc7342a0c6c62ac64fa8 [2020-11-23 16:25:31,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-23 16:25:31,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-23 16:25:31,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-23 16:25:31,229 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-23 16:25:31,231 INFO L275 PluginConnector]: CDTParser initialized [2020-11-23 16:25:31,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_0621b.c [2020-11-23 16:25:31,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f897fa21c/6fb5dce1a4a0489f9cbdd47de0385d20/FLAGc0b92b627 [2020-11-23 16:25:32,940 INFO L306 CDTParser]: Found 1 translation units. [2020-11-23 16:25:32,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_0621b.c [2020-11-23 16:25:32,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f897fa21c/6fb5dce1a4a0489f9cbdd47de0385d20/FLAGc0b92b627 [2020-11-23 16:25:33,020 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f897fa21c/6fb5dce1a4a0489f9cbdd47de0385d20 [2020-11-23 16:25:33,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-23 16:25:33,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-23 16:25:33,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-23 16:25:33,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-23 16:25:33,056 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-23 16:25:33,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:25:33" (1/1) ... [2020-11-23 16:25:33,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@259ce8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:33, skipping insertion in model container [2020-11-23 16:25:33,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:25:33" (1/1) ... [2020-11-23 16:25:33,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-23 16:25:33,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-23 16:25:33,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-23 16:25:33,806 INFO L203 MainTranslator]: Completed pre-run [2020-11-23 16:25:33,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-23 16:25:34,039 INFO L208 MainTranslator]: Completed translation [2020-11-23 16:25:34,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:34 WrapperNode [2020-11-23 16:25:34,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-23 16:25:34,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-23 16:25:34,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-23 16:25:34,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-23 16:25:34,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:34" (1/1) ... [2020-11-23 16:25:34,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:34" (1/1) ... [2020-11-23 16:25:34,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-23 16:25:34,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-23 16:25:34,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-23 16:25:34,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-23 16:25:34,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:34" (1/1) ... [2020-11-23 16:25:34,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:34" (1/1) ... [2020-11-23 16:25:34,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:34" (1/1) ... [2020-11-23 16:25:34,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:34" (1/1) ... [2020-11-23 16:25:34,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:34" (1/1) ... [2020-11-23 16:25:34,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:34" (1/1) ... [2020-11-23 16:25:34,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:34" (1/1) ... [2020-11-23 16:25:34,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-23 16:25:34,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-23 16:25:34,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-23 16:25:34,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-23 16:25:34,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:34" (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-11-23 16:25:34,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2020-11-23 16:25:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-11-23 16:25:34,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-23 16:25:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-23 16:25:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2020-11-23 16:25:34,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-11-23 16:25:34,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-23 16:25:34,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-23 16:25:34,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-11-23 16:25:34,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-23 16:25:55,725 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-23 16:25:55,726 INFO L298 CfgBuilder]: Removed 18 assume(true) statements. [2020-11-23 16:25:55,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:25:55 BoogieIcfgContainer [2020-11-23 16:25:55,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-23 16:25:55,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-23 16:25:55,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-23 16:25:55,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-23 16:25:55,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:25:33" (1/3) ... [2020-11-23 16:25:55,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b620854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:25:55, skipping insertion in model container [2020-11-23 16:25:55,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:25:34" (2/3) ... [2020-11-23 16:25:55,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b620854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:25:55, skipping insertion in model container [2020-11-23 16:25:55,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:25:55" (3/3) ... [2020-11-23 16:25:55,757 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0621b.c [2020-11-23 16:25:55,794 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-23 16:25:55,806 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-23 16:25:55,835 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-23 16:25:55,903 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-23 16:25:55,904 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-23 16:25:55,904 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-23 16:25:55,905 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-23 16:25:55,905 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-23 16:25:55,905 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-23 16:25:55,905 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-23 16:25:55,906 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-23 16:25:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-11-23 16:25:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-23 16:25:55,955 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:25:55,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 16:25:55,960 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:25:55,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:25:55,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1035664421, now seen corresponding path program 1 times [2020-11-23 16:25:56,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:25:56,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346602441] [2020-11-23 16:25:56,026 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-11-23 16:25:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 16:25:57,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 1 conjunts are in the unsatisfiable core [2020-11-23 16:25:57,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:25:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 16:25:57,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:25:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 16:25:57,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346602441] [2020-11-23 16:25:57,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 16:25:57,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-23 16:25:57,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569454084] [2020-11-23 16:25:57,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-23 16:25:57,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:25:57,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-23 16:25:57,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-23 16:25:57,363 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2020-11-23 16:25:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:25:57,460 INFO L93 Difference]: Finished difference Result 67 states and 105 transitions. [2020-11-23 16:25:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-23 16:25:57,464 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-11-23 16:25:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:25:57,500 INFO L225 Difference]: With dead ends: 67 [2020-11-23 16:25:57,501 INFO L226 Difference]: Without dead ends: 31 [2020-11-23 16:25:57,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-11-23 16:25:57,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-11-23 16:25:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-11-23 16:25:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-23 16:25:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2020-11-23 16:25:57,623 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2020-11-23 16:25:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:25:57,625 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2020-11-23 16:25:57,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-23 16:25:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2020-11-23 16:25:57,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-23 16:25:57,629 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:25:57,629 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 16:25:57,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-23 16:25:57,847 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:25:57,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:25:57,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1843594333, now seen corresponding path program 1 times [2020-11-23 16:25:57,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:25:57,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289978852] [2020-11-23 16:25:57,855 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-11-23 16:25:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 16:25:58,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-23 16:25:58,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:25:59,511 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-11-23 16:25:59,546 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-23 16:25:59,556 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-23 16:25:59,559 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-23 16:25:59,692 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-11-23 16:25:59,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-23 16:25:59,701 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-11-23 16:25:59,702 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:41 [2020-11-23 16:25:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 16:25:59,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:25:59,977 INFO L615 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-23 16:26:00,013 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-11-23 16:26:00,029 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:00,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-23 16:26:00,037 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-11-23 16:26:00,119 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-23 16:26:00,123 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 2 xjuncts. [2020-11-23 16:26:00,124 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:37 [2020-11-23 16:26:00,339 WARN L194 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2020-11-23 16:26:00,519 INFO L615 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-23 16:26:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 16:26:00,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289978852] [2020-11-23 16:26:00,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 16:26:00,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-11-23 16:26:00,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502220507] [2020-11-23 16:26:00,722 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-23 16:26:00,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:26:00,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-23 16:26:00,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-23 16:26:00,726 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 10 states. [2020-11-23 16:26:01,417 WARN L194 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-11-23 16:26:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:26:02,032 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2020-11-23 16:26:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-23 16:26:02,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2020-11-23 16:26:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:26:02,063 INFO L225 Difference]: With dead ends: 35 [2020-11-23 16:26:02,064 INFO L226 Difference]: Without dead ends: 14 [2020-11-23 16:26:02,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-11-23 16:26:02,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-11-23 16:26:02,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-23 16:26:02,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-23 16:26:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2020-11-23 16:26:02,077 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 12 [2020-11-23 16:26:02,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:26:02,078 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2020-11-23 16:26:02,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-23 16:26:02,079 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2020-11-23 16:26:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-23 16:26:02,080 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:26:02,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-23 16:26:02,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-23 16:26:02,295 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:26:02,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:26:02,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1317299133, now seen corresponding path program 1 times [2020-11-23 16:26:02,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:26:02,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024387268] [2020-11-23 16:26:02,300 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-11-23 16:26:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 16:26:04,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 27 conjunts are in the unsatisfiable core [2020-11-23 16:26:04,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:26:04,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:04,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:05,079 WARN L194 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 39 [2020-11-23 16:26:05,084 INFO L348 Elim1Store]: treesize reduction 339, result has 16.7 percent of original size [2020-11-23 16:26:05,088 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 489 treesize of output 513 [2020-11-23 16:26:05,109 INFO L387 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 2, 2, 2, 2, 2, 2, 1] term [2020-11-23 16:26:05,110 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:05,116 INFO L387 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 2, 2, 2, 2, 2, 1] term [2020-11-23 16:26:05,117 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:05,133 INFO L387 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-11-23 16:26:05,134 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:05,138 INFO L387 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 4, 2, 3, 2, 3, 2, 3, 2, 2, 1] term [2020-11-23 16:26:05,139 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:05,170 INFO L387 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 5, 2, 4, 2, 3, 2, 3, 2, 2, 1] term [2020-11-23 16:26:05,171 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:05,180 INFO L387 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 2, 4, 2, 3, 2, 2, 1] term [2020-11-23 16:26:05,184 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:05,195 INFO L387 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 5, 2, 4, 2, 2, 2, 2, 1] term [2020-11-23 16:26:05,195 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:05,207 INFO L387 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 5, 2, 4, 2, 2, 2, 2, 1] term [2020-11-23 16:26:05,208 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:05,214 INFO L387 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 5, 2, 4, 2, 2, 2, 2, 1] term [2020-11-23 16:26:05,215 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:05,225 INFO L387 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 5, 2, 4, 2, 2, 2, 2, 1] term [2020-11-23 16:26:05,235 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:05,237 INFO L387 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 5, 2, 4, 2, 2, 2, 2, 1] term [2020-11-23 16:26:05,241 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:05,249 INFO L387 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 2, 4, 2, 2, 2, 2, 1] term [2020-11-23 16:26:05,250 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:05,266 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:08,347 WARN L194 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 172 DAG size of output: 124 [2020-11-23 16:26:08,352 INFO L625 ElimStorePlain]: treesize reduction 2569, result has 7.3 percent of original size [2020-11-23 16:26:08,401 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,448 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,472 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,495 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,540 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,564 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,589 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,607 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,638 INFO L547 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2020-11-23 16:26:08,640 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:182, output treesize:201 [2020-11-23 16:26:08,656 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,668 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,691 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,705 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,723 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,730 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,741 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:08,752 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:09,208 WARN L194 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-11-23 16:26:09,270 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:09,278 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:09,284 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:09,291 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:09,304 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:09,310 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:09,326 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:09,332 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,069 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,085 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,091 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,104 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,133 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,140 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,147 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,155 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,165 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,171 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,181 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,197 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,211 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,221 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,228 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,235 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,249 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,259 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,273 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,281 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,292 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,309 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,315 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,324 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,330 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,367 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,373 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,382 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,392 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,398 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,410 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,417 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,424 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,443 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,448 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,456 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,468 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,478 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,484 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,492 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,514 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,519 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,526 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,532 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,537 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,549 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,560 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,569 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,575 INFO L615 QuantifierPusher]: Distributing 7 conjuncts over 4 disjuncts [2020-11-23 16:26:10,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:11,505 INFO L244 Elim1Store]: Index analysis took 779 ms [2020-11-23 16:26:12,456 WARN L194 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2020-11-23 16:26:12,458 INFO L348 Elim1Store]: treesize reduction 48, result has 77.3 percent of original size [2020-11-23 16:26:12,460 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 46 treesize of output 193 [2020-11-23 16:26:12,465 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:12,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:13,478 INFO L244 Elim1Store]: Index analysis took 914 ms [2020-11-23 16:26:14,101 WARN L194 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2020-11-23 16:26:14,102 INFO L348 Elim1Store]: treesize reduction 48, result has 77.3 percent of original size [2020-11-23 16:26:14,103 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 46 treesize of output 193 [2020-11-23 16:26:14,106 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:14,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:14,767 INFO L244 Elim1Store]: Index analysis took 587 ms [2020-11-23 16:26:15,346 WARN L194 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2020-11-23 16:26:15,347 INFO L348 Elim1Store]: treesize reduction 48, result has 77.3 percent of original size [2020-11-23 16:26:15,348 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 44 treesize of output 191 [2020-11-23 16:26:15,351 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:15,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:15,878 INFO L244 Elim1Store]: Index analysis took 461 ms [2020-11-23 16:26:16,457 WARN L194 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2020-11-23 16:26:16,458 INFO L348 Elim1Store]: treesize reduction 48, result has 77.3 percent of original size [2020-11-23 16:26:16,458 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 44 treesize of output 191 [2020-11-23 16:26:16,461 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:16,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:17,509 INFO L244 Elim1Store]: Index analysis took 982 ms [2020-11-23 16:26:18,035 WARN L194 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2020-11-23 16:26:18,036 INFO L348 Elim1Store]: treesize reduction 48, result has 77.3 percent of original size [2020-11-23 16:26:18,037 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 46 treesize of output 193 [2020-11-23 16:26:18,040 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:18,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:18,912 INFO L244 Elim1Store]: Index analysis took 790 ms [2020-11-23 16:26:19,532 WARN L194 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 71 [2020-11-23 16:26:19,534 INFO L348 Elim1Store]: treesize reduction 48, result has 77.3 percent of original size [2020-11-23 16:26:19,535 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 44 treesize of output 191 [2020-11-23 16:26:19,537 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:19,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:20,070 INFO L244 Elim1Store]: Index analysis took 451 ms [2020-11-23 16:26:20,952 WARN L194 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 82 [2020-11-23 16:26:20,954 INFO L348 Elim1Store]: treesize reduction 96, result has 66.4 percent of original size [2020-11-23 16:26:20,954 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 49 treesize of output 221 [2020-11-23 16:26:20,957 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:28,328 WARN L194 SmtUtils]: Spent 7.37 s on a formula simplification. DAG size of input: 187 DAG size of output: 154 [2020-11-23 16:26:28,331 INFO L625 ElimStorePlain]: treesize reduction 1113, result has 50.0 percent of original size [2020-11-23 16:26:28,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:28,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:28,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:28,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:28,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:28,837 INFO L244 Elim1Store]: Index analysis took 450 ms [2020-11-23 16:26:29,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:29,110 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-23 16:26:29,118 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-23 16:26:29,119 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 101 [2020-11-23 16:26:29,121 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:29,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:29,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:29,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:29,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:29,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:29,721 INFO L244 Elim1Store]: Index analysis took 545 ms [2020-11-23 16:26:30,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:30,051 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-23 16:26:30,059 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-23 16:26:30,060 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 101 [2020-11-23 16:26:30,062 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:30,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:30,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:30,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:30,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:30,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:30,464 INFO L244 Elim1Store]: Index analysis took 335 ms [2020-11-23 16:26:30,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:30,658 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-23 16:26:30,666 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-23 16:26:30,667 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 101 [2020-11-23 16:26:30,669 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:30,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:30,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:30,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:30,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:30,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:31,248 INFO L244 Elim1Store]: Index analysis took 525 ms [2020-11-23 16:26:31,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:31,567 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-23 16:26:31,587 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-23 16:26:31,588 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 101 [2020-11-23 16:26:31,590 INFO L547 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:31,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:31,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:31,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:31,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:31,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:31,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:31,824 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-23 16:26:31,834 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-23 16:26:31,835 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 101 [2020-11-23 16:26:31,837 INFO L547 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:40,040 WARN L194 SmtUtils]: Spent 8.20 s on a formula simplification. DAG size of input: 161 DAG size of output: 148 [2020-11-23 16:26:40,043 INFO L625 ElimStorePlain]: treesize reduction 66, result has 94.2 percent of original size [2020-11-23 16:26:40,053 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-23 16:26:40,057 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-23 16:26:40,103 INFO L547 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 46 dim-0 vars, and 5 xjuncts. [2020-11-23 16:26:40,105 INFO L244 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:1516, output treesize:1071 [2020-11-23 16:26:40,108 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-23 16:26:40,110 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-23 16:26:40,125 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-23 16:26:40,128 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-23 16:26:40,136 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-23 16:26:40,139 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-23 16:26:40,153 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-23 16:26:40,164 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-23 16:26:40,173 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-23 16:26:40,176 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-23 16:26:42,236 WARN L194 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 502 DAG size of output: 139 [2020-11-23 16:26:42,272 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-23 16:26:42,275 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-23 16:26:42,589 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-23 16:26:42,592 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-23 16:26:42,884 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-23 16:26:42,887 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-23 16:26:43,226 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-23 16:26:43,229 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-23 16:26:43,253 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-23 16:26:43,256 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-23 16:26:43,281 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-23 16:26:43,285 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-23 16:26:43,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:43,847 INFO L244 Elim1Store]: Index analysis took 417 ms [2020-11-23 16:26:44,415 WARN L194 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-11-23 16:26:44,416 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-23 16:26:44,417 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 17 case distinctions, treesize of input 45 treesize of output 165 [2020-11-23 16:26:44,419 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:45,902 WARN L194 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 144 [2020-11-23 16:26:45,905 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-23 16:26:45,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:45,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:45,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:46,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-11-23 16:26:46,011 INFO L173 IndexEqualityManager]: detected equality via solver [2020-11-23 16:26:46,446 WARN L194 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2020-11-23 16:26:46,449 INFO L348 Elim1Store]: treesize reduction 12, result has 82.6 percent of original size [2020-11-23 16:26:46,452 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 157 [2020-11-23 16:26:46,456 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:48,709 WARN L194 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 150 DAG size of output: 141 [2020-11-23 16:26:48,712 INFO L625 ElimStorePlain]: treesize reduction 39, result has 85.8 percent of original size [2020-11-23 16:26:48,736 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,738 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,744 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,746 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,752 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,754 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,757 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,759 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,766 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,768 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,772 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,773 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,777 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,779 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,782 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,784 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,788 INFO L547 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2020-11-23 16:26:48,789 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 15 variables, input treesize:239, output treesize:187 [2020-11-23 16:26:48,793 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,795 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,803 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,805 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,808 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,809 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,812 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,814 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,819 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,821 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,824 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,825 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,829 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,830 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,833 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:48,835 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,463 WARN L194 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-11-23 16:26:51,477 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,479 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,484 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,485 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,488 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,490 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,493 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,495 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,502 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,503 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,507 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,509 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,513 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,515 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,519 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:51,521 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-23 16:26:56,623 WARN L194 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 119 [2020-11-23 16:26:57,069 WARN L194 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2020-11-23 16:26:57,071 INFO L348 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2020-11-23 16:26:57,072 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 12 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 8 case distinctions, treesize of input 176 treesize of output 96 [2020-11-23 16:26:57,075 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-23 16:26:59,483 WARN L194 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 94 DAG size of output: 90 [2020-11-23 16:26:59,489 INFO L625 ElimStorePlain]: treesize reduction 6, result has 96.2 percent of original size [2020-11-23 16:26:59,519 INFO L547 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-11-23 16:26:59,520 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 13 variables, input treesize:258, output treesize:71 [2020-11-23 16:27:01,828 WARN L194 SmtUtils]: Spent 601.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-11-23 16:27:05,378 WARN L194 SmtUtils]: Spent 906.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2020-11-23 16:27:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 16:27:05,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:27:11,333 WARN L194 SmtUtils]: Spent 660.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2020-11-23 16:27:13,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_15| (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gl_u~0.base_8| (_ BitVec 32)) (v_skolemized_v_prenex_20_3 (_ BitVec 64))) (or (fp.eq (let ((.cse2 (store |c_#memory_int| |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8| (store (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_15|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_15|)) (_ bv0 32) ((_ extract 31 0) v_skolemized_v_prenex_20_3)) (_ bv4 32) ((_ extract 63 32) v_skolemized_v_prenex_20_3))))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse0 (let ((.cse1 (select .cse2 |c_~#atanhi_atan~0.base|))) (concat (select .cse1 (bvadd |c_~#atanhi_atan~0.offset| (_ bv28 32))) (select .cse1 (bvadd |c_~#atanhi_atan~0.offset| (_ bv24 32))))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (let ((.cse3 (let ((.cse4 (select .cse2 |c_~#atanlo_atan~0.base|))) (concat (select .cse4 (bvadd |c_~#atanlo_atan~0.offset| (_ bv28 32))) (select .cse4 (bvadd |c_~#atanlo_atan~0.offset| (_ bv24 32))))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.neg c_~pi_o_2~0)) (not (= (select |c_#valid| |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8|) (_ bv0 1))))) is different from false [2020-11-23 16:27:15,606 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_14| (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_15| (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gl_u~0.base_8| (_ BitVec 32)) (v_skolemized_v_prenex_20_3 (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (or (not (= (_ bv0 1) (select (store |c_#valid| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| (_ bv0 1)) |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8|))) (not (= (select |c_#valid| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|) (_ bv0 1))) (fp.eq (let ((.cse2 (let ((.cse5 (store |c_#memory_int| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8| (store (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_atan_double_~#gh_u~1.base_8|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_14|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_14|)) (_ bv0 32) ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (_ bv4 32) ((_ extract 63 32) v_skolemized_v_prenex_19_3))))) (store .cse5 |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8| (store (store (store (store (select .cse5 |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_15|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_15|)) (_ bv0 32) ((_ extract 31 0) v_skolemized_v_prenex_20_3)) (_ bv4 32) ((_ extract 63 32) v_skolemized_v_prenex_20_3)))))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse0 (let ((.cse1 (select .cse2 |c_~#atanhi_atan~0.base|))) (concat (select .cse1 (bvadd |c_~#atanhi_atan~0.offset| (_ bv28 32))) (select .cse1 (bvadd |c_~#atanhi_atan~0.offset| (_ bv24 32))))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (let ((.cse3 (let ((.cse4 (select .cse2 |c_~#atanlo_atan~0.base|))) (concat (select .cse4 (bvadd |c_~#atanlo_atan~0.offset| (_ bv28 32))) (select .cse4 (bvadd |c_~#atanlo_atan~0.offset| (_ bv24 32))))))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (fp.neg c_~pi_o_2~0)))) is different from false [2020-11-23 16:27:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-23 16:27:15,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024387268] [2020-11-23 16:27:15,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 16:27:15,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2020-11-23 16:27:15,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340534285] [2020-11-23 16:27:15,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-23 16:27:15,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:27:15,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-23 16:27:15,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=79, Unknown=6, NotChecked=38, Total=156 [2020-11-23 16:27:15,817 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand 13 states. [2020-11-23 16:27:29,428 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_48 (_ BitVec 64))) (let ((.cse0 (select |c_#memory_int| |c_~#atanlo_atan~0.base|))) (and (= (select .cse0 (bvadd |c_~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_48)) (= (fp ((_ extract 63 63) v_prenex_48) ((_ extract 62 52) v_prenex_48) ((_ extract 51 0) v_prenex_48)) ((_ to_fp 11 53) c_currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (select .cse0 (bvadd |c_~#atanlo_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_prenex_48))))) (exists ((v_prenex_43 (_ BitVec 32)) (v_prenex_49 (_ BitVec 32)) (v_prenex_42 (_ BitVec 64)) (v_prenex_47 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (and (not (= |c_~#atanlo_atan~0.base| v_prenex_43)) (= (select (select |c_#memory_int| v_prenex_43) (_ bv8 32)) ((_ extract 31 0) v_prenex_42)) (= (bvadd (select |c_#valid| v_prenex_49) (_ bv1 1)) (_ bv0 1)) (= (_ bv1 1) (select |c_#valid| v_prenex_47)) (not (= |c_~#atanlo_atan~0.base| v_prenex_46)) (not (= v_prenex_46 v_prenex_43)) (not (= |c_~#atanlo_atan~0.base| v_prenex_49)) (= (_ bv1 1) (select |c_#valid| v_prenex_46)) (= (bvadd (select |c_#valid| v_prenex_43) (_ bv1 1)) (_ bv0 1)) (not (= v_prenex_49 v_prenex_43)) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_42) ((_ extract 62 52) v_prenex_42) ((_ extract 51 0) v_prenex_42))) (not (= |c_~#atanlo_atan~0.base| v_prenex_47)) (not (= v_prenex_47 v_prenex_43)))) (exists ((v_prenex_40 (_ BitVec 64))) (let ((.cse1 (select |c_#memory_int| |c_~#atanhi_atan~0.base|))) (and (= (select .cse1 (bvadd |c_~#atanhi_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_prenex_40)) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_40) ((_ extract 62 52) v_prenex_40) ((_ extract 51 0) v_prenex_40))) (= (select .cse1 (bvadd |c_~#atanhi_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_40))))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~pi_o_2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 785398163397448279.0 500000000000000000.0))) (exists ((v_prenex_44 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_44) ((_ extract 62 52) v_prenex_44) ((_ extract 51 0) v_prenex_44)) ((_ to_fp 11 53) c_currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_prenex_44) (select (select |c_#memory_int| |c_~#atanhi_atan~0.base|) (bvadd |c_~#atanhi_atan~0.offset| (_ bv8 32)))))) (forall ((|v_skolemized_q#valueAsBitvector_15| (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gl_u~0.base_8| (_ BitVec 32)) (v_skolemized_v_prenex_20_3 (_ BitVec 64))) (or (fp.eq (let ((.cse4 (store |c_#memory_int| |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8| (store (store (store (store (select |c_#memory_int| |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_15|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_15|)) (_ bv0 32) ((_ extract 31 0) v_skolemized_v_prenex_20_3)) (_ bv4 32) ((_ extract 63 32) v_skolemized_v_prenex_20_3))))) (fp.sub c_currentRoundingMode (fp.neg (let ((.cse2 (let ((.cse3 (select .cse4 |c_~#atanhi_atan~0.base|))) (concat (select .cse3 (bvadd |c_~#atanhi_atan~0.offset| (_ bv28 32))) (select .cse3 (bvadd |c_~#atanhi_atan~0.offset| (_ bv24 32))))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#atanlo_atan~0.base|))) (concat (select .cse6 (bvadd |c_~#atanlo_atan~0.offset| (_ bv28 32))) (select .cse6 (bvadd |c_~#atanlo_atan~0.offset| (_ bv24 32))))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (fp.neg c_~pi_o_2~0)) (not (= (select |c_#valid| |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8|) (_ bv0 1))))) (not (= |c_~#atanlo_atan~0.base| |c_~#atanhi_atan~0.base|)) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_45 (_ BitVec 64))) (let ((.cse8 (select |c_#memory_int| v_prenex_41)) (.cse9 (= v_prenex_41 |c_~#atanhi_atan~0.base|)) (.cse7 (= |c_~#atanlo_atan~0.base| v_prenex_41))) (and (= (select |c_#valid| v_prenex_41) (_ bv0 1)) (not .cse7) (= ((_ extract 31 0) v_prenex_45) (select .cse8 (_ bv0 32))) (= ((_ extract 63 32) v_prenex_45) (select .cse8 (_ bv4 32))) (not .cse9) (or .cse9 (= (_ bv1 1) (select |c_#valid| |c_~#atanhi_atan~0.base|))) (or (= (_ bv1 1) (select |c_#valid| |c_~#atanlo_atan~0.base|)) .cse7)))) (= |c_~#atanhi_atan~0.offset| (_ bv0 32))) is different from false [2020-11-23 16:27:33,149 WARN L194 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 143 DAG size of output: 142 [2020-11-23 16:27:37,629 WARN L194 SmtUtils]: Spent 3.76 s on a formula simplification. DAG size of input: 147 DAG size of output: 146 [2020-11-23 16:27:37,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:27:37,631 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2020-11-23 16:27:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-23 16:27:37,632 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2020-11-23 16:27:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:27:37,632 INFO L225 Difference]: With dead ends: 14 [2020-11-23 16:27:37,633 INFO L226 Difference]: Without dead ends: 0 [2020-11-23 16:27:37,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=52, Invalid=109, Unknown=7, NotChecked=72, Total=240 [2020-11-23 16:27:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-23 16:27:37,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-23 16:27:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-23 16:27:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-23 16:27:37,634 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-11-23 16:27:37,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:27:37,634 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-23 16:27:37,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-23 16:27:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-23 16:27:37,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-23 16:27:37,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-23 16:27:37,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-23 16:27:39,232 WARN L194 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 177 [2020-11-23 16:28:00,761 WARN L194 SmtUtils]: Spent 21.53 s on a formula simplification. DAG size of input: 203 DAG size of output: 165 [2020-11-23 16:28:01,204 WARN L194 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-11-23 16:28:01,211 INFO L262 CegarLoopResult]: For program point L85(lines 85 88) no Hoare annotation was computed. [2020-11-23 16:28:01,211 INFO L262 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-11-23 16:28:01,211 INFO L262 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-11-23 16:28:01,212 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-23 16:28:01,212 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-23 16:28:01,212 INFO L262 CegarLoopResult]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2020-11-23 16:28:01,213 INFO L258 CegarLoopResult]: At program point L78-2(lines 78 82) the Hoare annotation is: (and (exists ((v_prenex_48 (_ BitVec 64))) (let ((.cse0 (select |#memory_int| |~#atanlo_atan~0.base|))) (and (= (select .cse0 (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_48)) (= (fp ((_ extract 63 63) v_prenex_48) ((_ extract 62 52) v_prenex_48) ((_ extract 51 0) v_prenex_48)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (select .cse0 (bvadd |~#atanlo_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_prenex_48))))) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_atan_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (exists ((v_prenex_43 (_ BitVec 32)) (v_prenex_49 (_ BitVec 32)) (v_prenex_42 (_ BitVec 64)) (v_prenex_47 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (and (not (= |~#atanlo_atan~0.base| v_prenex_43)) (= (select (select |#memory_int| v_prenex_43) (_ bv8 32)) ((_ extract 31 0) v_prenex_42)) (= (bvadd (select |#valid| v_prenex_49) (_ bv1 1)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| v_prenex_47)) (not (= |~#atanlo_atan~0.base| v_prenex_46)) (not (= v_prenex_46 v_prenex_43)) (not (= |~#atanlo_atan~0.base| v_prenex_49)) (= (_ bv1 1) (select |#valid| v_prenex_46)) (= (bvadd (select |#valid| v_prenex_43) (_ bv1 1)) (_ bv0 1)) (not (= v_prenex_49 v_prenex_43)) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_42) ((_ extract 62 52) v_prenex_42) ((_ extract 51 0) v_prenex_42))) (not (= |~#atanlo_atan~0.base| v_prenex_47)) (not (= v_prenex_47 v_prenex_43)))) (exists ((v_prenex_40 (_ BitVec 64))) (let ((.cse1 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= (select .cse1 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_prenex_40)) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_40) ((_ extract 62 52) v_prenex_40) ((_ extract 51 0) v_prenex_40))) (= (select .cse1 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_40))))) (= currentRoundingMode roundNearestTiesToEven) (= ~pi_o_2~0 ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0))) (exists ((v_prenex_44 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_44) ((_ extract 62 52) v_prenex_44) ((_ extract 51 0) v_prenex_44)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_prenex_44) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) (exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) ULTIMATE.start_atan_double_~hx~0) (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|))))) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) (exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (and (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|))) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|)) ULTIMATE.start_atan_double_~ix~0))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_45 (_ BitVec 64))) (let ((.cse3 (select |#memory_int| v_prenex_41)) (.cse4 (= v_prenex_41 |~#atanhi_atan~0.base|)) (.cse2 (= |~#atanlo_atan~0.base| v_prenex_41))) (and (= (select |#valid| v_prenex_41) (_ bv0 1)) (not .cse2) (= ((_ extract 31 0) v_prenex_45) (select .cse3 (_ bv0 32))) (= ((_ extract 63 32) v_prenex_45) (select .cse3 (_ bv4 32))) (not .cse4) (or .cse4 (= (_ bv1 1) (select |#valid| |~#atanhi_atan~0.base|))) (or (= (_ bv1 1) (select |#valid| |~#atanlo_atan~0.base|)) .cse2)))) (= |~#atanhi_atan~0.offset| (_ bv0 32))) [2020-11-23 16:28:01,214 INFO L262 CegarLoopResult]: For program point L78-3(lines 76 89) no Hoare annotation was computed. [2020-11-23 16:28:01,214 INFO L262 CegarLoopResult]: For program point L70-1(lines 70 74) no Hoare annotation was computed. [2020-11-23 16:28:01,214 INFO L258 CegarLoopResult]: At program point L70-2(lines 70 74) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 64))) (let ((.cse0 (select |#memory_int| |~#atanlo_atan~0.base|))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_13|) (select .cse0 (bvadd |~#atanlo_atan~0.offset| (_ bv28 32)))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_13|) (select .cse0 (bvadd |~#atanlo_atan~0.offset| (_ bv24 32)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_13|)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0)))))) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_atan_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (exists ((v_skolemized_v_prenex_16_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_16_3) ((_ extract 62 52) v_skolemized_v_prenex_16_3) ((_ extract 51 0) v_skolemized_v_prenex_16_3)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32))) ((_ extract 31 0) v_skolemized_v_prenex_16_3)))) (exists ((v_skolemized_v_prenex_14_3 (_ BitVec 64)) (|#t~string5.base| (_ BitVec 32)) (|#t~string4.base| (_ BitVec 32)) (|~#aT_atan~0.base| (_ BitVec 32)) (|#t~string6.base| (_ BitVec 32))) (and (= (select (select |#memory_int| |~#aT_atan~0.base|) (_ bv8 32)) ((_ extract 31 0) v_skolemized_v_prenex_14_3)) (not (= |~#atanlo_atan~0.base| |~#aT_atan~0.base|)) (not (= |~#aT_atan~0.base| |#t~string4.base|)) (or (= |~#aT_atan~0.base| (_ bv0 32)) (= (_ bv0 32) |#t~string6.base|) (= (_ bv0 32) |#t~string4.base|) (= |~#atanlo_atan~0.base| (_ bv0 32)) (= (select |#valid| (_ bv0 32)) (_ bv0 1)) (= (_ bv0 32) |~#atanhi_atan~0.base|) (= (_ bv0 32) |#t~string5.base|)) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_skolemized_v_prenex_14_3) ((_ extract 62 52) v_skolemized_v_prenex_14_3) ((_ extract 51 0) v_skolemized_v_prenex_14_3))) (not (= |~#aT_atan~0.base| |#t~string5.base|)) (= (bvadd (select |#valid| |#t~string4.base|) (_ bv1 1)) (_ bv0 1)) (not (= |~#atanlo_atan~0.base| |#t~string4.base|)) (= (_ bv1 1) (select |#valid| |~#aT_atan~0.base|)) (= (_ bv1 1) (select |#valid| |#t~string6.base|)) (not (= |~#aT_atan~0.base| |#t~string6.base|)) (= (_ bv1 1) (select |#valid| |#t~string5.base|)) (not (= |~#atanlo_atan~0.base| |#t~string5.base|)) (not (= |~#atanlo_atan~0.base| |#t~string6.base|)))) (= currentRoundingMode roundNearestTiesToEven) (= ~pi_o_2~0 ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0))) (= (_ bv1 1) (select |#valid| |~#atanlo_atan~0.base|)) (= (_ bv1 1) (select |#valid| |~#atanhi_atan~0.base|)) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) (exists ((v_skolemized_v_prenex_12_3 (_ BitVec 64))) (let ((.cse1 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= (select .cse1 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_skolemized_v_prenex_12_3)) (= (select .cse1 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_skolemized_v_prenex_12_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_12_3) ((_ extract 62 52) v_skolemized_v_prenex_12_3) ((_ extract 51 0) v_skolemized_v_prenex_12_3)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)))))) (= |~#atanhi_atan~0.offset| (_ bv0 32))) [2020-11-23 16:28:01,215 INFO L262 CegarLoopResult]: For program point L70-3(lines 70 74) no Hoare annotation was computed. [2020-11-23 16:28:01,215 INFO L262 CegarLoopResult]: For program point L128(lines 128 133) no Hoare annotation was computed. [2020-11-23 16:28:01,215 INFO L262 CegarLoopResult]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2020-11-23 16:28:01,215 INFO L258 CegarLoopResult]: At program point L21-2(lines 21 25) the Hoare annotation is: false [2020-11-23 16:28:01,215 INFO L262 CegarLoopResult]: For program point L146(lines 146 149) no Hoare annotation was computed. [2020-11-23 16:28:01,216 INFO L262 CegarLoopResult]: For program point L98(lines 98 114) no Hoare annotation was computed. [2020-11-23 16:28:01,216 INFO L258 CegarLoopResult]: At program point L32(lines 19 33) the Hoare annotation is: false [2020-11-23 16:28:01,216 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-23 16:28:01,216 INFO L262 CegarLoopResult]: For program point L90(lines 90 115) no Hoare annotation was computed. [2020-11-23 16:28:01,217 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-23 16:28:01,217 INFO L262 CegarLoopResult]: For program point L107(lines 107 113) no Hoare annotation was computed. [2020-11-23 16:28:01,217 INFO L262 CegarLoopResult]: For program point L107-2(lines 90 115) no Hoare annotation was computed. [2020-11-23 16:28:01,218 INFO L262 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2020-11-23 16:28:01,218 INFO L262 CegarLoopResult]: For program point L99(lines 99 105) no Hoare annotation was computed. [2020-11-23 16:28:01,218 INFO L262 CegarLoopResult]: For program point L132-2(line 132) no Hoare annotation was computed. [2020-11-23 16:28:01,220 INFO L258 CegarLoopResult]: At program point L132-3(lines 66 134) the Hoare annotation is: (and (exists ((v_prenex_48 (_ BitVec 64))) (let ((.cse0 (select |#memory_int| |~#atanlo_atan~0.base|))) (and (= (select .cse0 (bvadd |~#atanlo_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_48)) (= (fp ((_ extract 63 63) v_prenex_48) ((_ extract 62 52) v_prenex_48) ((_ extract 51 0) v_prenex_48)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))) (= (select .cse0 (bvadd |~#atanlo_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_prenex_48))))) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_atan_double_~x (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (exists ((v_prenex_40 (_ BitVec 64))) (let ((.cse1 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= (select .cse1 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_prenex_40)) (= ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_40) ((_ extract 62 52) v_prenex_40) ((_ extract 51 0) v_prenex_40))) (= (select .cse1 (bvadd |~#atanhi_atan~0.offset| (_ bv28 32))) ((_ extract 63 32) v_prenex_40))))) (exists ((v_prenex_41 (_ BitVec 32)) (v_prenex_43 (_ BitVec 32)) (|v_ULTIMATE.start_atan_double_~#gl_u~0.base_8| (_ BitVec 32)) (v_skolemized_v_prenex_20_3 (_ BitVec 64)) (v_prenex_45 (_ BitVec 64)) (v_prenex_42 (_ BitVec 64))) (let ((.cse2 (select |#memory_int| |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8|)) (.cse3 (= |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8| v_prenex_41)) (.cse4 (select |#memory_int| v_prenex_41))) (and (not (= |~#atanlo_atan~0.base| v_prenex_43)) (= (select (select |#memory_int| v_prenex_43) (_ bv8 32)) ((_ extract 31 0) v_prenex_42)) (not (= |~#atanlo_atan~0.base| |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8|)) (= ((_ extract 63 32) v_skolemized_v_prenex_20_3) (select .cse2 (_ bv4 32))) (not (= |~#atanlo_atan~0.base| v_prenex_41)) (= ((_ extract 31 0) v_skolemized_v_prenex_20_3) (select .cse2 (_ bv0 32))) (not (= |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8| v_prenex_43)) (not (= |v_ULTIMATE.start_atan_double_~#gl_u~0.base_8| |~#atanhi_atan~0.base|)) (not (= v_prenex_41 v_prenex_43)) (= (fp.neg ((_ to_fp 11 53) currentRoundingMode (/ 49999999999691208119.0 250000000000000000000.0))) (fp ((_ extract 63 63) v_prenex_42) ((_ extract 62 52) v_prenex_42) ((_ extract 51 0) v_prenex_42))) (not (= v_prenex_41 |~#atanhi_atan~0.base|)) (or .cse3 (= ((_ extract 63 32) v_prenex_45) (select .cse4 (_ bv4 32)))) (or .cse3 (= ((_ extract 31 0) v_prenex_45) (select .cse4 (_ bv0 32))))))) (= currentRoundingMode roundNearestTiesToEven) (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (exists ((v_prenex_44 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_44) ((_ extract 62 52) v_prenex_44) ((_ extract 51 0) v_prenex_44)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448278999.0 1000000000000000000000.0))) (= ((_ extract 31 0) v_prenex_44) (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv8 32)))))) (exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) ULTIMATE.start_atan_double_~hx~0) (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|))))) (not (= |~#atanlo_atan~0.base| |~#atanhi_atan~0.base|)) (exists ((|v_skolemized_q#valueAsBitvector_12| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (let ((.cse5 (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) .cse5) (= .cse5 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_12|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_12|))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_12|) ULTIMATE.start_atan_double_~low~0) (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|)) ULTIMATE.start_atan_double_~ix~0)))) (exists ((v_prenex_48 (_ BitVec 64)) (v_prenex_40 (_ BitVec 64))) (and (= |ULTIMATE.start_atan_double_#res| (fp.sub roundNearestTiesToEven (fp.neg (let ((.cse6 (concat ((_ extract 63 32) v_prenex_40) ((_ extract 31 0) v_prenex_40)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6)))) (let ((.cse7 (concat ((_ extract 63 32) v_prenex_48) ((_ extract 31 0) v_prenex_48)))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0)) (fp ((_ extract 63 63) v_prenex_48) ((_ extract 62 52) v_prenex_48) ((_ extract 51 0) v_prenex_48))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0)) (fp ((_ extract 63 63) v_prenex_40) ((_ extract 62 52) v_prenex_40) ((_ extract 51 0) v_prenex_40))))) (= |~#atanhi_atan~0.offset| (_ bv0 32))) [2020-11-23 16:28:01,221 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-23 16:28:01,221 INFO L262 CegarLoopResult]: For program point L91(lines 91 94) no Hoare annotation was computed. [2020-11-23 16:28:01,222 INFO L262 CegarLoopResult]: For program point L91-2(lines 91 94) no Hoare annotation was computed. [2020-11-23 16:28:01,222 INFO L262 CegarLoopResult]: For program point L92(lines 92 93) no Hoare annotation was computed. [2020-11-23 16:28:01,222 INFO L262 CegarLoopResult]: For program point L26(lines 26 31) no Hoare annotation was computed. [2020-11-23 16:28:01,222 INFO L262 CegarLoopResult]: For program point L26-1(lines 19 33) no Hoare annotation was computed. [2020-11-23 16:28:01,222 INFO L262 CegarLoopResult]: For program point L26-2(lines 26 31) no Hoare annotation was computed. [2020-11-23 16:28:01,223 INFO L265 CegarLoopResult]: At program point L150(lines 136 151) the Hoare annotation is: true [2020-11-23 16:28:01,223 INFO L262 CegarLoopResult]: For program point L76(lines 76 89) no Hoare annotation was computed. [2020-11-23 16:28:01,258 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:796) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:283) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:240) 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) [2020-11-23 16:28:01,271 INFO L168 Benchmark]: Toolchain (without parser) took 148238.42 ms. Allocated memory was 46.1 MB in the beginning and 69.2 MB in the end (delta: 23.1 MB). Free memory was 30.8 MB in the beginning and 49.8 MB in the end (delta: -19.0 MB). Peak memory consumption was 42.9 MB. Max. memory is 16.1 GB. [2020-11-23 16:28:01,273 INFO L168 Benchmark]: CDTParser took 1.07 ms. Allocated memory is still 37.7 MB. Free memory was 20.5 MB in the beginning and 20.4 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 16:28:01,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 999.91 ms. Allocated memory is still 46.1 MB. Free memory was 30.1 MB in the beginning and 28.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. [2020-11-23 16:28:01,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 214.74 ms. Allocated memory is still 46.1 MB. Free memory was 28.2 MB in the beginning and 25.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-23 16:28:01,278 INFO L168 Benchmark]: Boogie Preprocessor took 196.48 ms. Allocated memory is still 46.1 MB. Free memory was 25.7 MB in the beginning and 23.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-23 16:28:01,280 INFO L168 Benchmark]: RCFGBuilder took 21263.97 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 23.5 MB in the beginning and 32.2 MB in the end (delta: -8.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-23 16:28:01,282 INFO L168 Benchmark]: TraceAbstraction took 125532.35 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 31.9 MB in the beginning and 49.8 MB in the end (delta: -17.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 16.1 GB. [2020-11-23 16:28:01,291 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.07 ms. Allocated memory is still 37.7 MB. Free memory was 20.5 MB in the beginning and 20.4 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 999.91 ms. Allocated memory is still 46.1 MB. Free memory was 30.1 MB in the beginning and 28.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 214.74 ms. Allocated memory is still 46.1 MB. Free memory was 28.2 MB in the beginning and 25.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 196.48 ms. Allocated memory is still 46.1 MB. Free memory was 25.7 MB in the beginning and 23.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 21263.97 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 23.5 MB in the beginning and 32.2 MB in the end (delta: -8.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 125532.35 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 31.9 MB in the beginning and 49.8 MB in the end (delta: -17.9 MB). Peak memory consumption was 33.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 1 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...