./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0661b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0661b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7b03c010cc5bb74fc451f0f165676fac13dd665 .......................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0661b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f7b03c010cc5bb74fc451f0f165676fac13dd665 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 02:22:16,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:22:16,262 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:22:16,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:22:16,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:22:16,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:22:16,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:22:16,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:22:16,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:22:16,296 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:22:16,297 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:22:16,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:22:16,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:22:16,299 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:22:16,300 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:22:16,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:22:16,301 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:22:16,302 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:22:16,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:22:16,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:22:16,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:22:16,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:22:16,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:22:16,314 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:22:16,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:22:16,318 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:22:16,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:22:16,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:22:16,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:22:16,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:22:16,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:22:16,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:22:16,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:22:16,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:22:16,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:22:16,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:22:16,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:22:16,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:22:16,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:22:16,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:22:16,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:22:16,331 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 02:22:16,356 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:22:16,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:22:16,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:22:16,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:22:16,357 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:22:16,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:22:16,357 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:22:16,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:22:16,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:22:16,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:22:16,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:22:16,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:22:16,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:22:16,359 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:22:16,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:22:16,359 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:22:16,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:22:16,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:22:16,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:22:16,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:22:16,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:22:16,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:22:16,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:22:16,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:22:16,361 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:22:16,361 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:22:16,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 02:22:16,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:22:16,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7b03c010cc5bb74fc451f0f165676fac13dd665 [2019-11-20 02:22:16,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:22:16,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:22:16,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:22:16,516 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:22:16,516 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:22:16,516 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0661b.c [2019-11-20 02:22:16,567 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/data/9e659fec8/08a73b59fa7d4a63a97d65adf7cc8915/FLAGc28ccc126 [2019-11-20 02:22:16,949 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:22:16,949 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/sv-benchmarks/c/float-newlib/double_req_bl_0661b.c [2019-11-20 02:22:16,957 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/data/9e659fec8/08a73b59fa7d4a63a97d65adf7cc8915/FLAGc28ccc126 [2019-11-20 02:22:17,297 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/data/9e659fec8/08a73b59fa7d4a63a97d65adf7cc8915 [2019-11-20 02:22:17,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:22:17,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:22:17,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:22:17,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:22:17,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:22:17,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:22:17" (1/1) ... [2019-11-20 02:22:17,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aac797c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17, skipping insertion in model container [2019-11-20 02:22:17,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:22:17" (1/1) ... [2019-11-20 02:22:17,322 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:22:17,348 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:22:17,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:22:17,683 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:22:17,739 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:22:17,762 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:22:17,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17 WrapperNode [2019-11-20 02:22:17,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:22:17,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:22:17,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:22:17,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:22:17,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17" (1/1) ... [2019-11-20 02:22:17,785 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17" (1/1) ... [2019-11-20 02:22:17,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:22:17,839 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:22:17,839 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:22:17,839 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:22:17,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17" (1/1) ... [2019-11-20 02:22:17,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17" (1/1) ... [2019-11-20 02:22:17,861 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17" (1/1) ... [2019-11-20 02:22:17,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17" (1/1) ... [2019-11-20 02:22:17,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17" (1/1) ... [2019-11-20 02:22:17,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17" (1/1) ... [2019-11-20 02:22:17,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17" (1/1) ... [2019-11-20 02:22:17,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:22:17,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:22:17,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:22:17,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:22:17,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:22:17,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 02:22:17,992 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-20 02:22:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 02:22:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 02:22:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:22:17,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:22:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 02:22:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-20 02:22:17,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 02:22:18,940 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:22:18,941 INFO L285 CfgBuilder]: Removed 48 assume(true) statements. [2019-11-20 02:22:18,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:22:18 BoogieIcfgContainer [2019-11-20 02:22:18,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:22:18,943 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:22:18,943 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:22:18,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:22:18,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:22:17" (1/3) ... [2019-11-20 02:22:18,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4f8849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:22:18, skipping insertion in model container [2019-11-20 02:22:18,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:17" (2/3) ... [2019-11-20 02:22:18,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4f8849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:22:18, skipping insertion in model container [2019-11-20 02:22:18,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:22:18" (3/3) ... [2019-11-20 02:22:18,949 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0661b.c [2019-11-20 02:22:18,958 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:22:18,965 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 02:22:18,983 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 02:22:19,007 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:22:19,008 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:22:19,008 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:22:19,008 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:22:19,008 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:22:19,008 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:22:19,008 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:22:19,009 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:22:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2019-11-20 02:22:19,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 02:22:19,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:22:19,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:22:19,035 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:22:19,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:19,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1517456143, now seen corresponding path program 1 times [2019-11-20 02:22:19,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:19,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828928093] [2019-11-20 02:22:19,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:22:19,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:22:19,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828928093] [2019-11-20 02:22:19,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:22:19,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 02:22:19,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731849033] [2019-11-20 02:22:19,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 02:22:19,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:22:19,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 02:22:19,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 02:22:19,194 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 2 states. [2019-11-20 02:22:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:22:19,223 INFO L93 Difference]: Finished difference Result 237 states and 398 transitions. [2019-11-20 02:22:19,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 02:22:19,224 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-20 02:22:19,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:22:19,235 INFO L225 Difference]: With dead ends: 237 [2019-11-20 02:22:19,235 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 02:22:19,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 02:22:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 02:22:19,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-11-20 02:22:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-20 02:22:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2019-11-20 02:22:19,280 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 12 [2019-11-20 02:22:19,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:22:19,280 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2019-11-20 02:22:19,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 02:22:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2019-11-20 02:22:19,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 02:22:19,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:22:19,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:22:19,282 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:22:19,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash -229938040, now seen corresponding path program 1 times [2019-11-20 02:22:19,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:19,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731556166] [2019-11-20 02:22:19,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:19,446 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:22:19,446 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 02:22:19,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:22:19 BoogieIcfgContainer [2019-11-20 02:22:19,497 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 02:22:19,498 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 02:22:19,498 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 02:22:19,498 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 02:22:19,499 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:22:18" (3/4) ... [2019-11-20 02:22:19,502 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 02:22:19,502 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 02:22:19,504 INFO L168 Benchmark]: Toolchain (without parser) took 2196.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -86.4 MB). Peak memory consumption was 60.9 MB. Max. memory is 11.5 GB. [2019-11-20 02:22:19,505 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:22:19,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:22:19,506 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:22:19,507 INFO L168 Benchmark]: Boogie Preprocessor took 85.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:22:19,507 INFO L168 Benchmark]: RCFGBuilder took 1018.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. [2019-11-20 02:22:19,508 INFO L168 Benchmark]: TraceAbstraction took 554.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-20 02:22:19,509 INFO L168 Benchmark]: Witness Printer took 4.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:22:19,512 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 455.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -190.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1018.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 554.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 271]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 270. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] 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, }; [L60-L62] 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; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L264] double x = __VERIFIER_nondet_double(); [L265] double y = 0.0; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L267] COND TRUE x > 0.0 [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L268] double res = __ieee754_atan2(y, x); [L270] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L270] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L271] __VERIFIER_error() VAL [aT_atan={6:0}, atanhi_atan={3:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 170 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=120occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 02:22:21,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:22:21,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:22:21,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:22:21,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:22:21,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:22:21,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:22:21,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:22:21,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:22:21,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:22:21,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:22:21,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:22:21,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:22:21,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:22:21,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:22:21,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:22:21,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:22:21,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:22:21,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:22:21,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:22:21,477 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:22:21,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:22:21,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:22:21,480 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:22:21,483 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:22:21,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:22:21,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:22:21,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:22:21,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:22:21,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:22:21,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:22:21,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:22:21,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:22:21,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:22:21,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:22:21,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:22:21,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:22:21,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:22:21,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:22:21,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:22:21,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:22:21,495 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 02:22:21,510 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:22:21,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:22:21,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:22:21,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:22:21,512 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:22:21,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:22:21,512 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 02:22:21,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 02:22:21,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:22:21,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 02:22:21,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 02:22:21,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 02:22:21,514 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 02:22:21,514 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 02:22:21,515 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 02:22:21,515 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:22:21,515 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:22:21,515 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 02:22:21,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:22:21,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:22:21,516 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 02:22:21,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 02:22:21,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:22:21,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:22:21,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 02:22:21,517 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 02:22:21,518 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 02:22:21,518 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 02:22:21,518 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 02:22:21,518 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 02:22:21,519 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f7b03c010cc5bb74fc451f0f165676fac13dd665 [2019-11-20 02:22:21,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:22:21,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:22:21,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:22:21,810 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:22:21,811 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:22:21,812 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0661b.c [2019-11-20 02:22:21,880 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/data/a45dcabda/130ce6a07fc9419da183016066518dad/FLAGb5659ae25 [2019-11-20 02:22:22,331 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:22:22,332 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/sv-benchmarks/c/float-newlib/double_req_bl_0661b.c [2019-11-20 02:22:22,340 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/data/a45dcabda/130ce6a07fc9419da183016066518dad/FLAGb5659ae25 [2019-11-20 02:22:22,754 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/data/a45dcabda/130ce6a07fc9419da183016066518dad [2019-11-20 02:22:22,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:22:22,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:22:22,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:22:22,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:22:22,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:22:22,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:22:22" (1/1) ... [2019-11-20 02:22:22,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@370cf650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:22, skipping insertion in model container [2019-11-20 02:22:22,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:22:22" (1/1) ... [2019-11-20 02:22:22,771 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:22:22,795 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:22:22,991 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:22:22,999 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:22:23,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:22:23,163 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:22:23,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:23 WrapperNode [2019-11-20 02:22:23,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:22:23,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:22:23,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:22:23,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:22:23,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:23" (1/1) ... [2019-11-20 02:22:23,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:23" (1/1) ... [2019-11-20 02:22:23,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:22:23,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:22:23,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:22:23,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:22:23,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:23" (1/1) ... [2019-11-20 02:22:23,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:23" (1/1) ... [2019-11-20 02:22:23,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:23" (1/1) ... [2019-11-20 02:22:23,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:23" (1/1) ... [2019-11-20 02:22:23,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:23" (1/1) ... [2019-11-20 02:22:23,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:23" (1/1) ... [2019-11-20 02:22:23,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:23" (1/1) ... [2019-11-20 02:22:23,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:22:23,315 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:22:23,315 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:22:23,315 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:22:23,316 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 02:22:23,377 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-20 02:22:23,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 02:22:23,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 02:22:23,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-20 02:22:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 02:22:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:22:23,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:22:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 02:22:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 02:22:59,464 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:22:59,464 INFO L285 CfgBuilder]: Removed 48 assume(true) statements. [2019-11-20 02:22:59,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:22:59 BoogieIcfgContainer [2019-11-20 02:22:59,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:22:59,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 02:22:59,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 02:22:59,469 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 02:22:59,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:22:22" (1/3) ... [2019-11-20 02:22:59,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6170ec3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:22:59, skipping insertion in model container [2019-11-20 02:22:59,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:23" (2/3) ... [2019-11-20 02:22:59,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6170ec3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:22:59, skipping insertion in model container [2019-11-20 02:22:59,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:22:59" (3/3) ... [2019-11-20 02:22:59,473 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0661b.c [2019-11-20 02:22:59,483 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 02:22:59,491 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 02:22:59,501 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 02:22:59,528 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 02:22:59,528 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 02:22:59,528 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 02:22:59,528 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:22:59,528 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:22:59,528 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 02:22:59,529 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:22:59,529 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 02:22:59,543 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2019-11-20 02:22:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-20 02:22:59,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:22:59,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:22:59,549 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:22:59,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:59,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1517456143, now seen corresponding path program 1 times [2019-11-20 02:22:59,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:22:59,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367704403] [2019-11-20 02:22:59,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-20 02:22:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:22:59,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 02:22:59,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:22:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:22:59,902 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:22:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:22:59,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367704403] [2019-11-20 02:22:59,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:22:59,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 02:22:59,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844611488] [2019-11-20 02:22:59,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 02:22:59,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:22:59,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 02:22:59,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 02:22:59,930 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 2 states. [2019-11-20 02:22:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:22:59,967 INFO L93 Difference]: Finished difference Result 237 states and 398 transitions. [2019-11-20 02:22:59,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 02:22:59,968 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-11-20 02:22:59,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:22:59,979 INFO L225 Difference]: With dead ends: 237 [2019-11-20 02:22:59,979 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 02:22:59,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 02:22:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 02:23:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-11-20 02:23:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-20 02:23:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 165 transitions. [2019-11-20 02:23:00,019 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 165 transitions. Word has length 12 [2019-11-20 02:23:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:23:00,019 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 165 transitions. [2019-11-20 02:23:00,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 02:23:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 165 transitions. [2019-11-20 02:23:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 02:23:00,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:23:00,021 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:00,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 02:23:00,222 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:23:00,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:00,222 INFO L82 PathProgramCache]: Analyzing trace with hash -229938040, now seen corresponding path program 1 times [2019-11-20 02:23:00,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:23:00,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633622054] [2019-11-20 02:23:00,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-20 02:23:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:00,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-20 02:23:00,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:00,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2019-11-20 02:23:00,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2019-11-20 02:23:00,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:00,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:00,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-11-20 02:23:00,831 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:00,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:00,879 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:00,879 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2019-11-20 02:23:00,880 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:00,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:00,896 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:23:00,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:00,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:23:00,923 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:30 [2019-11-20 02:23:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:01,188 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:23:01,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:23:01,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:23:01,753 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:01,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 83 treesize of output 88 [2019-11-20 02:23:01,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-11-20 02:23:01,800 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:01,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:01,873 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-20 02:23:01,874 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:01,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:01,900 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:23:01,932 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:01,933 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 89 treesize of output 89 [2019-11-20 02:23:01,992 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:01,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 76 [2019-11-20 02:23:01,993 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:02,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:02,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2019-11-20 02:23:02,042 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:02,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:02,080 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:02,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2019-11-20 02:23:02,081 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-20 02:23:02,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:02,096 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:23:02,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:23:02,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-20 02:23:02,154 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:173, output treesize:81 [2019-11-20 02:23:02,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:23:02,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:02,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633622054] [2019-11-20 02:23:02,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:23:02,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-20 02:23:02,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495077970] [2019-11-20 02:23:02,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 02:23:02,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:23:02,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 02:23:02,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-20 02:23:02,444 INFO L87 Difference]: Start difference. First operand 116 states and 165 transitions. Second operand 14 states. [2019-11-20 02:23:03,337 WARN L191 SmtUtils]: Spent 677.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 02:23:03,510 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 02:23:03,931 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-20 02:23:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:04,999 INFO L93 Difference]: Finished difference Result 171 states and 238 transitions. [2019-11-20 02:23:05,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:23:05,344 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-11-20 02:23:05,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:23:05,346 INFO L225 Difference]: With dead ends: 171 [2019-11-20 02:23:05,346 INFO L226 Difference]: Without dead ends: 107 [2019-11-20 02:23:05,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-11-20 02:23:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-20 02:23:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-20 02:23:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 02:23:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 145 transitions. [2019-11-20 02:23:05,362 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 145 transitions. Word has length 14 [2019-11-20 02:23:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:23:05,363 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 145 transitions. [2019-11-20 02:23:05,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 02:23:05,363 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2019-11-20 02:23:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 02:23:05,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:23:05,366 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:05,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 02:23:05,587 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:23:05,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:05,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1963663166, now seen corresponding path program 1 times [2019-11-20 02:23:05,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:23:05,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848994406] [2019-11-20 02:23:05,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-20 02:23:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:05,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 02:23:05,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:05,838 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:23:05,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:23:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:05,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848994406] [2019-11-20 02:23:05,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:23:05,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-20 02:23:05,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008081173] [2019-11-20 02:23:05,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 02:23:05,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:23:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 02:23:05,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:23:05,912 INFO L87 Difference]: Start difference. First operand 107 states and 145 transitions. Second operand 9 states. [2019-11-20 02:23:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:11,115 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2019-11-20 02:23:11,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:23:11,122 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-11-20 02:23:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:23:11,123 INFO L225 Difference]: With dead ends: 119 [2019-11-20 02:23:11,123 INFO L226 Difference]: Without dead ends: 116 [2019-11-20 02:23:11,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:23:11,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-20 02:23:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-20 02:23:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 02:23:11,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2019-11-20 02:23:11,137 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 19 [2019-11-20 02:23:11,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:23:11,137 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2019-11-20 02:23:11,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 02:23:11,137 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2019-11-20 02:23:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 02:23:11,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:23:11,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:11,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 02:23:11,354 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:23:11,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:11,355 INFO L82 PathProgramCache]: Analyzing trace with hash 291898349, now seen corresponding path program 1 times [2019-11-20 02:23:11,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:23:11,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607453057] [2019-11-20 02:23:11,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-20 02:23:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:11,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 02:23:11,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:11,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:11,672 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:23:11,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:23:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:11,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607453057] [2019-11-20 02:23:11,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:23:11,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 02:23:11,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140698509] [2019-11-20 02:23:11,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 02:23:11,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:23:11,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 02:23:11,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-20 02:23:11,700 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 7 states. [2019-11-20 02:23:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:13,231 INFO L93 Difference]: Finished difference Result 130 states and 167 transitions. [2019-11-20 02:23:13,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:23:13,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-20 02:23:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:23:13,234 INFO L225 Difference]: With dead ends: 130 [2019-11-20 02:23:13,234 INFO L226 Difference]: Without dead ends: 127 [2019-11-20 02:23:13,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:23:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-20 02:23:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2019-11-20 02:23:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-20 02:23:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 147 transitions. [2019-11-20 02:23:13,259 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 147 transitions. Word has length 20 [2019-11-20 02:23:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:23:13,260 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 147 transitions. [2019-11-20 02:23:13,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 02:23:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 147 transitions. [2019-11-20 02:23:13,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-20 02:23:13,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:23:13,262 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:13,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 02:23:13,478 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:23:13,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:13,478 INFO L82 PathProgramCache]: Analyzing trace with hash -957948556, now seen corresponding path program 1 times [2019-11-20 02:23:13,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:23:13,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883637701] [2019-11-20 02:23:13,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-20 02:23:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:13,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-20 02:23:13,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:14,104 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:23:14,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:23:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:23:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:14,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883637701] [2019-11-20 02:23:14,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:23:14,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 7] imperfect sequences [] total 13 [2019-11-20 02:23:14,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022857267] [2019-11-20 02:23:14,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 02:23:14,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:23:14,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 02:23:14,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:23:14,382 INFO L87 Difference]: Start difference. First operand 109 states and 147 transitions. Second operand 13 states. [2019-11-20 02:23:16,736 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-20 02:23:17,078 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-20 02:23:19,120 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-20 02:23:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:20,800 INFO L93 Difference]: Finished difference Result 194 states and 253 transitions. [2019-11-20 02:23:20,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:23:20,801 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-11-20 02:23:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:23:20,802 INFO L225 Difference]: With dead ends: 194 [2019-11-20 02:23:20,802 INFO L226 Difference]: Without dead ends: 124 [2019-11-20 02:23:20,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-11-20 02:23:20,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-20 02:23:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2019-11-20 02:23:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-20 02:23:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 140 transitions. [2019-11-20 02:23:20,819 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 140 transitions. Word has length 20 [2019-11-20 02:23:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:23:20,819 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 140 transitions. [2019-11-20 02:23:20,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 02:23:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 140 transitions. [2019-11-20 02:23:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 02:23:20,821 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:23:20,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:21,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 02:23:21,050 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:23:21,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:21,050 INFO L82 PathProgramCache]: Analyzing trace with hash 627447986, now seen corresponding path program 1 times [2019-11-20 02:23:21,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:23:21,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896194735] [2019-11-20 02:23:21,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-20 02:23:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:21,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 02:23:21,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:23,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:23:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:23,600 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:23:23,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:23:23,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:23,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896194735] [2019-11-20 02:23:23,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:23:23,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 02:23:23,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553346273] [2019-11-20 02:23:23,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 02:23:23,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:23:23,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 02:23:23,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=126, Unknown=1, NotChecked=0, Total=156 [2019-11-20 02:23:23,816 INFO L87 Difference]: Start difference. First operand 106 states and 140 transitions. Second operand 13 states. [2019-11-20 02:23:24,092 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-11-20 02:23:25,189 WARN L191 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 30 [2019-11-20 02:23:27,303 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-11-20 02:23:30,110 WARN L191 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-11-20 02:23:31,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:31,761 INFO L93 Difference]: Finished difference Result 181 states and 230 transitions. [2019-11-20 02:23:31,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:23:31,762 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2019-11-20 02:23:31,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:23:31,764 INFO L225 Difference]: With dead ends: 181 [2019-11-20 02:23:31,764 INFO L226 Difference]: Without dead ends: 120 [2019-11-20 02:23:31,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=88, Invalid=217, Unknown=1, NotChecked=0, Total=306 [2019-11-20 02:23:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-20 02:23:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2019-11-20 02:23:31,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 02:23:31,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2019-11-20 02:23:31,793 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 22 [2019-11-20 02:23:31,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:23:31,793 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2019-11-20 02:23:31,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 02:23:31,793 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2019-11-20 02:23:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 02:23:31,800 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:23:31,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:32,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 02:23:32,017 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:23:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1575840196, now seen corresponding path program 1 times [2019-11-20 02:23:32,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:23:32,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514992278] [2019-11-20 02:23:32,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-20 02:23:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:32,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 02:23:32,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:32,560 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:23:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:32,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514992278] [2019-11-20 02:23:32,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:23:32,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-20 02:23:32,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81241518] [2019-11-20 02:23:32,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 02:23:32,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:23:32,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 02:23:32,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-20 02:23:32,882 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand 14 states. [2019-11-20 02:23:34,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:34,816 INFO L93 Difference]: Finished difference Result 131 states and 165 transitions. [2019-11-20 02:23:35,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:23:35,256 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-11-20 02:23:35,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:23:35,257 INFO L225 Difference]: With dead ends: 131 [2019-11-20 02:23:35,257 INFO L226 Difference]: Without dead ends: 111 [2019-11-20 02:23:35,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-20 02:23:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-20 02:23:35,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2019-11-20 02:23:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 02:23:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 131 transitions. [2019-11-20 02:23:35,268 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 131 transitions. Word has length 22 [2019-11-20 02:23:35,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:23:35,268 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 131 transitions. [2019-11-20 02:23:35,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 02:23:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 131 transitions. [2019-11-20 02:23:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 02:23:35,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:23:35,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:35,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 02:23:35,482 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:23:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash 328100550, now seen corresponding path program 1 times [2019-11-20 02:23:35,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:23:35,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313212212] [2019-11-20 02:23:35,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-20 02:23:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:35,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 02:23:35,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:35,842 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:23:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:23:35,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313212212] [2019-11-20 02:23:35,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:23:35,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 02:23:35,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747108815] [2019-11-20 02:23:35,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 02:23:35,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:23:35,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 02:23:35,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:23:35,987 INFO L87 Difference]: Start difference. First operand 102 states and 131 transitions. Second operand 12 states. [2019-11-20 02:24:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:24:21,768 INFO L93 Difference]: Finished difference Result 173 states and 214 transitions. [2019-11-20 02:24:21,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:24:21,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-20 02:24:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:24:21,847 INFO L225 Difference]: With dead ends: 173 [2019-11-20 02:24:21,847 INFO L226 Difference]: Without dead ends: 145 [2019-11-20 02:24:21,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-20 02:24:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-20 02:24:21,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 89. [2019-11-20 02:24:21,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 02:24:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2019-11-20 02:24:21,858 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 23 [2019-11-20 02:24:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:24:21,858 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2019-11-20 02:24:21,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 02:24:21,858 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2019-11-20 02:24:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 02:24:21,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:24:21,859 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:24:22,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-20 02:24:22,074 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:24:22,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:22,074 INFO L82 PathProgramCache]: Analyzing trace with hash -105632341, now seen corresponding path program 1 times [2019-11-20 02:24:22,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:24:22,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607235967] [2019-11-20 02:24:22,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-20 02:24:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:22,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 02:24:22,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:24:22,398 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:24:22,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:24:22,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607235967] [2019-11-20 02:24:22,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:24:22,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 02:24:22,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431757605] [2019-11-20 02:24:22,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 02:24:22,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:24:22,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 02:24:22,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:24:22,497 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand 13 states. [2019-11-20 02:24:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:24:55,964 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2019-11-20 02:24:55,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 02:24:55,964 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-11-20 02:24:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:24:55,965 INFO L225 Difference]: With dead ends: 120 [2019-11-20 02:24:55,965 INFO L226 Difference]: Without dead ends: 117 [2019-11-20 02:24:55,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-11-20 02:24:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-20 02:24:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 90. [2019-11-20 02:24:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-20 02:24:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2019-11-20 02:24:55,973 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 23 [2019-11-20 02:24:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:24:55,974 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2019-11-20 02:24:55,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 02:24:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2019-11-20 02:24:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 02:24:55,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:24:55,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:24:56,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-20 02:24:56,180 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:24:56,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:24:56,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1341915625, now seen corresponding path program 1 times [2019-11-20 02:24:56,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:24:56,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086825127] [2019-11-20 02:24:56,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-20 02:24:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:24:56,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:24:56,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:24:56,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:24:56,495 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:24:56,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:24:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:24:56,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086825127] [2019-11-20 02:24:56,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:24:56,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-20 02:24:56,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143100742] [2019-11-20 02:24:56,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 02:24:56,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:24:56,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 02:24:56,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-20 02:24:56,672 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand 16 states. [2019-11-20 02:25:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:25:00,625 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2019-11-20 02:25:00,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 02:25:00,626 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-20 02:25:00,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:25:00,626 INFO L225 Difference]: With dead ends: 99 [2019-11-20 02:25:00,626 INFO L226 Difference]: Without dead ends: 87 [2019-11-20 02:25:00,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2019-11-20 02:25:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-20 02:25:00,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-20 02:25:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-20 02:25:00,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2019-11-20 02:25:00,634 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 107 transitions. Word has length 23 [2019-11-20 02:25:00,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:25:00,635 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 107 transitions. [2019-11-20 02:25:00,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 02:25:00,635 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 107 transitions. [2019-11-20 02:25:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 02:25:00,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:25:00,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:25:00,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-20 02:25:00,838 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:25:00,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:25:00,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2054581310, now seen corresponding path program 1 times [2019-11-20 02:25:00,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:25:00,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540021162] [2019-11-20 02:25:00,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-20 02:25:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:25:01,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 02:25:01,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:25:01,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:01,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:25:01,211 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:25:01,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:25:01,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540021162] [2019-11-20 02:25:01,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:25:01,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 02:25:01,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145307405] [2019-11-20 02:25:01,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 02:25:01,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:25:01,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 02:25:01,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-20 02:25:01,335 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. Second operand 14 states. [2019-11-20 02:25:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:25:02,250 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2019-11-20 02:25:02,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:25:02,251 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2019-11-20 02:25:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:25:02,251 INFO L225 Difference]: With dead ends: 96 [2019-11-20 02:25:02,251 INFO L226 Difference]: Without dead ends: 85 [2019-11-20 02:25:02,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2019-11-20 02:25:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-20 02:25:02,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-11-20 02:25:02,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-20 02:25:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2019-11-20 02:25:02,259 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 24 [2019-11-20 02:25:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:25:02,260 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2019-11-20 02:25:02,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 02:25:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2019-11-20 02:25:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 02:25:02,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:25:02,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:25:02,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-20 02:25:02,461 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:25:02,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:25:02,461 INFO L82 PathProgramCache]: Analyzing trace with hash 782702068, now seen corresponding path program 1 times [2019-11-20 02:25:02,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:25:02,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230356289] [2019-11-20 02:25:02,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-20 02:25:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:25:06,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 02:25:06,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:25:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:25:06,980 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:25:07,965 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 02:25:09,375 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 02:25:10,944 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 02:25:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:25:11,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230356289] [2019-11-20 02:25:11,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:25:11,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-20 02:25:11,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345851072] [2019-11-20 02:25:11,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 02:25:11,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:25:11,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 02:25:11,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-20 02:25:11,822 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 10 states. [2019-11-20 02:25:18,877 WARN L191 SmtUtils]: Spent 772.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-11-20 02:25:53,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:25:53,126 INFO L93 Difference]: Finished difference Result 147 states and 175 transitions. [2019-11-20 02:25:53,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 02:25:53,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-20 02:25:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:25:53,215 INFO L225 Difference]: With dead ends: 147 [2019-11-20 02:25:53,216 INFO L226 Difference]: Without dead ends: 132 [2019-11-20 02:25:53,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:25:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-20 02:25:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 79. [2019-11-20 02:25:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-20 02:25:53,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2019-11-20 02:25:53,226 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 26 [2019-11-20 02:25:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:25:53,226 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2019-11-20 02:25:53,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 02:25:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2019-11-20 02:25:53,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 02:25:53,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:25:53,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:25:53,429 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-20 02:25:53,430 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:25:53,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:25:53,430 INFO L82 PathProgramCache]: Analyzing trace with hash -485446016, now seen corresponding path program 1 times [2019-11-20 02:25:53,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:25:53,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484297464] [2019-11-20 02:25:53,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-20 02:25:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:25:53,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 02:25:53,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:25:53,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:53,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:25:53,957 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:25:53,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:25:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:25:54,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484297464] [2019-11-20 02:25:54,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:25:54,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 20 [2019-11-20 02:25:54,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578590753] [2019-11-20 02:25:54,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 02:25:54,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:25:54,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 02:25:54,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-11-20 02:25:54,397 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand 20 states. [2019-11-20 02:26:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:26:20,376 INFO L93 Difference]: Finished difference Result 86 states and 101 transitions. [2019-11-20 02:26:20,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 02:26:20,377 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-11-20 02:26:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:26:20,377 INFO L225 Difference]: With dead ends: 86 [2019-11-20 02:26:20,377 INFO L226 Difference]: Without dead ends: 69 [2019-11-20 02:26:20,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2019-11-20 02:26:20,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-20 02:26:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-11-20 02:26:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-11-20 02:26:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2019-11-20 02:26:20,386 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 27 [2019-11-20 02:26:20,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:26:20,386 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2019-11-20 02:26:20,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 02:26:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2019-11-20 02:26:20,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 02:26:20,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:26:20,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:26:20,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-20 02:26:20,588 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:26:20,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:26:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1972844972, now seen corresponding path program 1 times [2019-11-20 02:26:20,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:26:20,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260910943] [2019-11-20 02:26:20,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-20 02:26:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:26:21,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 02:26:21,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:26:21,810 INFO L377 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 66 treesize of output 60 [2019-11-20 02:26:21,820 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:26:21,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:26:21,824 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:26:21,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:26:21,850 INFO L496 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. [2019-11-20 02:26:21,850 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:94, output treesize:55 [2019-11-20 02:26:23,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:26:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:26:23,452 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:26:23,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:26:24,716 INFO L377 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 128 treesize of output 116 [2019-11-20 02:26:24,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 02:26:24,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:26:24,730 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 02:26:24,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:26:24,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:26:24,749 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:145, output treesize:73 [2019-11-20 02:26:41,382 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64))) (let ((.cse0 (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (.cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y ULTIMATE.start___ieee754_atan2_~x))) (or (fp.eq .cse0 (_ +zero 11 53)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|)) .cse1)) (not (= .cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|)) (_ bv1071382528 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse1))))) is different from true [2019-11-20 02:26:43,781 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64))) (let ((.cse1 (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (.cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~y~0 ULTIMATE.start___ieee754_atan2_~x))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|)) .cse0)) (fp.eq .cse1 (_ +zero 11 53)) (not (= .cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|)) (_ bv1071382528 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)) .cse0))))) is different from true [2019-11-20 02:26:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:26:43,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260910943] [2019-11-20 02:26:43,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:26:43,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 16] imperfect sequences [] total 29 [2019-11-20 02:26:43,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726145394] [2019-11-20 02:26:43,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-20 02:26:43,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:26:43,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-20 02:26:43,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=623, Unknown=4, NotChecked=102, Total=812 [2019-11-20 02:26:43,799 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand 29 states. [2019-11-20 02:26:53,033 WARN L191 SmtUtils]: Spent 2.55 s on a formula simplification that was a NOOP. DAG size: 58 [2019-11-20 02:27:00,812 WARN L191 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 62 [2019-11-20 02:27:06,493 WARN L191 SmtUtils]: Spent 3.66 s on a formula simplification that was a NOOP. DAG size: 67 [2019-11-20 02:27:15,415 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification that was a NOOP. DAG size: 71 [2019-11-20 02:27:23,759 WARN L191 SmtUtils]: Spent 5.37 s on a formula simplification that was a NOOP. DAG size: 73 [2019-11-20 02:27:41,798 WARN L191 SmtUtils]: Spent 10.67 s on a formula simplification that was a NOOP. DAG size: 80 [2019-11-20 02:27:44,528 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)) c_ULTIMATE.start___ieee754_atan2_~z~1) (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|)) (_ bv1071382528 32)))) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)) |c_ULTIMATE.start_atan_double_#res|) (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|)) (_ bv1071382528 32)))) (forall ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64))) (let ((.cse0 (let ((.cse1 (concat (bvand (_ bv2147483647 32) c_ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (or (not (= .cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)))) (fp.eq .cse0 (_ +zero 11 53)) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|)) (_ bv1071382528 32))) (not (= c_ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|))))))) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)) c_ULTIMATE.start_atan_double_~x) (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|)) (_ bv1071382528 32)))) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)) c_ULTIMATE.start_atan_double_~x) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|) c_ULTIMATE.start_atan_double_~hx~0))) (exists ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)))) (and (= .cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))) (= (let ((.cse3 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) c_ULTIMATE.start_atan_double_~x) (= .cse2 (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x))))) (exists ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse4 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)))) (and (= .cse4 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))) (= (let ((.cse5 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))) |c_ULTIMATE.start_atan_double_#res|) (= .cse4 (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x))))) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (and (= c_ULTIMATE.start_atan_double_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)) c_ULTIMATE.start_atan_double_~x))) (exists ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse7 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)))) (and (= (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) c_ULTIMATE.start___ieee754_atan2_~z~1) (= .cse7 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))) (= .cse7 (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x))))) (exists ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)))) (and (= .cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))) (= .cse8 (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x)) (= (let ((.cse9 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))) |c_ULTIMATE.start_fabs_double_#res|)))) (exists ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse11 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)))) (and (= c_ULTIMATE.start_fabs_double_~x (let ((.cse10 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10)))) (= .cse11 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))) (= .cse11 (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x)))))) is different from false [2019-11-20 02:28:05,840 WARN L191 SmtUtils]: Spent 3.17 s on a formula simplification that was a NOOP. DAG size: 72 [2019-11-20 02:28:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:28:13,711 INFO L93 Difference]: Finished difference Result 144 states and 173 transitions. [2019-11-20 02:28:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 02:28:13,712 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 37 [2019-11-20 02:28:13,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:28:13,713 INFO L225 Difference]: With dead ends: 144 [2019-11-20 02:28:13,713 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 02:28:13,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 77.4s TimeCoverageRelationStatistics Valid=234, Invalid=1255, Unknown=5, NotChecked=228, Total=1722 [2019-11-20 02:28:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 02:28:13,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 65. [2019-11-20 02:28:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-20 02:28:13,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-11-20 02:28:13,724 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 37 [2019-11-20 02:28:13,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:28:13,724 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-11-20 02:28:13,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-20 02:28:13,724 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-11-20 02:28:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-20 02:28:13,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:28:13,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:28:13,925 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-20 02:28:13,925 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:28:13,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:28:13,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2116641785, now seen corresponding path program 1 times [2019-11-20 02:28:13,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:28:13,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197970330] [2019-11-20 02:28:13,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-20 02:28:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:28:14,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 02:28:14,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:28:15,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-20 02:28:15,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-20 02:28:15,147 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:28:15,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:28:15,151 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:28:15,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:28:15,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 02:28:15,179 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:40 [2019-11-20 02:28:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:28:16,155 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:28:16,872 INFO L377 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 55 treesize of output 49 [2019-11-20 02:28:16,877 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-11-20 02:28:16,877 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:28:16,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:28:16,881 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:28:16,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:28:16,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:28:16,890 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:36 [2019-11-20 02:28:21,642 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_40| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (v_arrayElimCell_22 (_ BitVec 32))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_40|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_40|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_40|)) (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (not (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_40|)) (_ bv1141899264 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))))) is different from false [2019-11-20 02:28:24,016 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_40| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (v_arrayElimCell_22 (_ BitVec 32))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_40|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_40|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_40|)) (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (not (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_40|)) (_ bv1141899264 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y c_ULTIMATE.start___ieee754_atan2_~x))))) is different from true [2019-11-20 02:28:26,414 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_40| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ FloatingPoint 11 53)) (v_arrayElimCell_22 (_ BitVec 32))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_40|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_40|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_40|)) (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (not (fp.gt ULTIMATE.start_main_~x~0 (_ +zero 11 53))) (not (bvsge (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_40|)) (_ bv1141899264 32))) (not (= (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~x~0) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|)))))) is different from true [2019-11-20 02:28:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:28:26,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197970330] [2019-11-20 02:28:26,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:28:26,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 20 [2019-11-20 02:28:26,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935219559] [2019-11-20 02:28:26,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 02:28:26,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:28:26,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 02:28:26,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=262, Unknown=4, NotChecked=66, Total=380 [2019-11-20 02:28:26,430 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 20 states. [2019-11-20 02:28:29,042 WARN L191 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 40 DAG size of output: 8 [2019-11-20 02:28:33,024 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-20 02:28:33,401 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-20 02:28:33,817 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-20 02:28:34,217 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 02:28:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:28:42,876 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2019-11-20 02:28:42,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 02:28:42,877 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2019-11-20 02:28:42,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:28:42,877 INFO L225 Difference]: With dead ends: 104 [2019-11-20 02:28:42,877 INFO L226 Difference]: Without dead ends: 79 [2019-11-20 02:28:42,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=151, Invalid=453, Unknown=4, NotChecked=94, Total=702 [2019-11-20 02:28:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-20 02:28:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 61. [2019-11-20 02:28:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-20 02:28:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-11-20 02:28:42,887 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 37 [2019-11-20 02:28:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:28:42,887 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-11-20 02:28:42,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 02:28:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2019-11-20 02:28:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 02:28:42,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:28:42,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:28:43,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-20 02:28:43,089 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:28:43,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:28:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1126660719, now seen corresponding path program 1 times [2019-11-20 02:28:43,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:28:43,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128114843] [2019-11-20 02:28:43,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-20 02:28:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:28:44,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 02:28:44,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:28:45,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:28:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:28:45,576 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:28:45,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:28:45,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:28:45,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128114843] [2019-11-20 02:28:45,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:28:45,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-20 02:28:45,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940513459] [2019-11-20 02:28:45,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 02:28:45,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:28:45,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 02:28:45,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-20 02:28:45,795 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand 13 states. [2019-11-20 02:28:50,197 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-11-20 02:28:51,131 WARN L191 SmtUtils]: Spent 875.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-20 02:28:54,690 WARN L191 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-20 02:29:00,301 WARN L191 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-20 02:29:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:29:00,310 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2019-11-20 02:29:00,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:29:00,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2019-11-20 02:29:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:29:00,311 INFO L225 Difference]: With dead ends: 70 [2019-11-20 02:29:00,311 INFO L226 Difference]: Without dead ends: 52 [2019-11-20 02:29:00,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-11-20 02:29:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-20 02:29:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-11-20 02:29:00,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-20 02:29:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2019-11-20 02:29:00,320 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 39 [2019-11-20 02:29:00,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:29:00,321 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2019-11-20 02:29:00,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 02:29:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2019-11-20 02:29:00,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 02:29:00,322 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:29:00,322 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:29:00,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-20 02:29:00,530 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:29:00,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:29:00,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2102915936, now seen corresponding path program 1 times [2019-11-20 02:29:00,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:29:00,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490590786] [2019-11-20 02:29:00,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-20 02:29:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:29:05,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 02:29:05,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:29:05,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-20 02:29:05,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2019-11-20 02:29:05,954 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:29:05,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:29:05,959 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:29:06,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:29:06,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-20 02:29:06,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:47 [2019-11-20 02:29:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:29:07,320 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:29:09,612 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 02:29:12,255 WARN L191 SmtUtils]: Spent 725.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-20 02:29:14,618 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 02:29:16,480 WARN L191 SmtUtils]: Spent 804.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 02:29:20,187 WARN L191 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 02:29:24,521 WARN L191 SmtUtils]: Spent 518.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 02:29:24,528 INFO L377 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 107 treesize of output 95 [2019-11-20 02:29:24,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2019-11-20 02:29:24,533 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:29:25,095 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-11-20 02:29:25,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:29:25,095 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:29:25,640 WARN L191 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-20 02:29:25,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:29:25,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:29:25,641 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:114, output treesize:60 [2019-11-20 02:29:30,758 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 02:29:41,214 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 02:29:43,798 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (v_arrayElimCell_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)) v_arrayElimCell_26))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (or (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) (_ bv1071382528 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) .cse0)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y ULTIMATE.start___ieee754_atan2_~x))) (fp.gt (fp.add roundNearestTiesToEven c_~huge_atan~0 .cse0) c_~one_atan~0)))) is different from false [2019-11-20 02:29:46,234 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (v_arrayElimCell_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)) v_arrayElimCell_26))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (or (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) (_ bv1071382528 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) .cse0)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start___ieee754_atan2_~y ULTIMATE.start___ieee754_atan2_~x))) (fp.gt (fp.add roundNearestTiesToEven c_~huge_atan~0 .cse0) c_~one_atan~0)))) is different from true [2019-11-20 02:29:50,072 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (v_arrayElimCell_26 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)) v_arrayElimCell_26))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|)) (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~y~0 ULTIMATE.start___ieee754_atan2_~x))) (not (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) (_ bv1071382528 32))) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) .cse0)) (fp.gt (fp.add roundNearestTiesToEven c_~huge_atan~0 .cse0) c_~one_atan~0)))) is different from true [2019-11-20 02:30:03,267 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 02:30:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:30:03,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490590786] [2019-11-20 02:30:03,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:30:03,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 23 [2019-11-20 02:30:03,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140728480] [2019-11-20 02:30:03,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 02:30:03,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:30:03,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 02:30:03,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=331, Unknown=7, NotChecked=82, Total=552 [2019-11-20 02:30:03,281 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 24 states. [2019-11-20 02:30:10,607 WARN L191 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 49 DAG size of output: 15 [2019-11-20 02:30:19,118 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-20 02:30:20,019 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-20 02:30:20,529 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-20 02:30:20,858 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-20 02:30:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:30:21,038 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-11-20 02:30:21,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 02:30:21,049 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2019-11-20 02:30:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:30:21,049 INFO L225 Difference]: With dead ends: 59 [2019-11-20 02:30:21,049 INFO L226 Difference]: Without dead ends: 42 [2019-11-20 02:30:21,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 66.1s TimeCoverageRelationStatistics Valid=256, Invalid=615, Unknown=7, NotChecked=114, Total=992 [2019-11-20 02:30:21,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-20 02:30:21,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-20 02:30:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-20 02:30:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2019-11-20 02:30:21,059 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 40 [2019-11-20 02:30:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:30:21,060 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2019-11-20 02:30:21,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 02:30:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2019-11-20 02:30:21,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 02:30:21,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 02:30:21,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:30:21,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-20 02:30:21,274 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 02:30:21,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:30:21,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1587270145, now seen corresponding path program 1 times [2019-11-20 02:30:21,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 02:30:21,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271781215] [2019-11-20 02:30:21,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2fad6b7f-aac6-46df-bfde-1fa0085c172d/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-20 02:30:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:30:22,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-20 02:30:22,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:30:22,314 INFO L377 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 48 treesize of output 42 [2019-11-20 02:30:22,324 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2019-11-20 02:30:22,324 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:30:22,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:30:22,334 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 02:30:22,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 02:30:22,339 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-20 02:30:22,339 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:21 [2019-11-20 02:30:23,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:30:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:30:23,586 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 02:30:23,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 02:30:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:30:32,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271781215] [2019-11-20 02:30:32,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:30:32,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 16] imperfect sequences [] total 28 [2019-11-20 02:30:32,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196576186] [2019-11-20 02:30:32,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-20 02:30:32,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 02:30:32,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-20 02:30:32,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=677, Unknown=3, NotChecked=0, Total=756 [2019-11-20 02:30:32,426 INFO L87 Difference]: Start difference. First operand 42 states and 41 transitions. Second operand 28 states. [2019-11-20 02:30:41,161 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 49 [2019-11-20 02:30:41,849 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-20 02:30:42,526 WARN L191 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-20 02:30:43,039 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-20 02:30:43,590 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-20 02:30:44,445 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-20 02:30:45,196 WARN L191 SmtUtils]: Spent 666.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-20 02:30:46,078 WARN L191 SmtUtils]: Spent 826.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-20 02:30:46,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:30:46,165 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2019-11-20 02:30:46,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-20 02:30:46,167 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 41 [2019-11-20 02:30:46,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 02:30:46,167 INFO L225 Difference]: With dead ends: 42 [2019-11-20 02:30:46,167 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 02:30:46,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=373, Invalid=1264, Unknown=3, NotChecked=0, Total=1640 [2019-11-20 02:30:46,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 02:30:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 02:30:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 02:30:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 02:30:46,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-11-20 02:30:46,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 02:30:46,169 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 02:30:46,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-20 02:30:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 02:30:46,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 02:30:46,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-20 02:30:46,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 02:30:46,512 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 373 DAG size of output: 363 [2019-11-20 02:30:46,698 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 505 DAG size of output: 475 [2019-11-20 02:30:46,843 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 461 DAG size of output: 430 [2019-11-20 02:30:46,960 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 410 DAG size of output: 400 [2019-11-20 02:30:58,690 WARN L191 SmtUtils]: Spent 11.73 s on a formula simplification. DAG size of input: 361 DAG size of output: 200 [2019-11-20 02:31:12,870 WARN L191 SmtUtils]: Spent 14.15 s on a formula simplification. DAG size of input: 473 DAG size of output: 226 [2019-11-20 02:31:20,493 WARN L191 SmtUtils]: Spent 7.62 s on a formula simplification. DAG size of input: 278 DAG size of output: 154 [2019-11-20 02:31:31,161 WARN L191 SmtUtils]: Spent 10.66 s on a formula simplification. DAG size of input: 290 DAG size of output: 161 [2019-11-20 02:31:31,968 WARN L191 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 72 [2019-11-20 02:31:39,423 WARN L191 SmtUtils]: Spent 7.45 s on a formula simplification. DAG size of input: 428 DAG size of output: 201 [2019-11-20 02:31:44,111 WARN L191 SmtUtils]: Spent 4.69 s on a formula simplification. DAG size of input: 120 DAG size of output: 70 [2019-11-20 02:31:48,659 WARN L191 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 175 DAG size of output: 109 [2019-11-20 02:31:51,239 WARN L191 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 78 DAG size of output: 45 [2019-11-20 02:32:02,595 WARN L191 SmtUtils]: Spent 11.35 s on a formula simplification. DAG size of input: 397 DAG size of output: 85 [2019-11-20 02:32:02,598 INFO L444 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-11-20 02:32:02,598 INFO L444 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-11-20 02:32:02,598 INFO L440 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (v_arrayElimCell_20 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= |ULTIMATE.start_fabs_double_#res| (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) v_arrayElimCell_20))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|))))) (exists ((ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= ULTIMATE.start_fabs_double_~x (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x)))) (exists ((ULTIMATE.start___ieee754_atan2_~hx~1 (_ BitVec 32)) (v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (bvneg (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_atan2_~hx~1))) (_ bv20 32)) ULTIMATE.start___ieee754_atan2_~k~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))) (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse2 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse1) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse2) (= .cse1 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse2) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)))) (and (= .cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))) (= .cse3 (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x)) (= (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) |ULTIMATE.start_fabs_double_#res|)))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse5 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse5) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse5 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (v_arrayElimCell_20 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) v_arrayElimCell_20))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) ULTIMATE.start_atan_double_~x) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse7 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)))) (and (= .cse7 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))) (= (let ((.cse8 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))) ULTIMATE.start_atan_double_~x) (= .cse7 (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x))))) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3))) (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_3)))) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6))))) (exists ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|))) (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (bvor (bvand (_ bv1 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_22_7) (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|) (_ bv30 32)))) ULTIMATE.start___ieee754_atan2_~m~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)) (_ +zero 11 53)))) (= (_ +zero 11 53) ULTIMATE.start_main_~y~0)) [2019-11-20 02:32:02,598 INFO L444 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L267(lines 267 274) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L267-2(lines 267 274) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L270(line 270) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L270-2(lines 270 273) no Hoare annotation was computed. [2019-11-20 02:32:02,599 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-20 02:32:02,600 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-11-20 02:32:02,600 INFO L444 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-11-20 02:32:02,600 INFO L444 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-11-20 02:32:02,600 INFO L444 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-11-20 02:32:02,600 INFO L444 ceAbstractionStarter]: For program point L271(line 271) no Hoare annotation was computed. [2019-11-20 02:32:02,600 INFO L444 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-11-20 02:32:02,600 INFO L444 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-20 02:32:02,600 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-11-20 02:32:02,600 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-11-20 02:32:02,600 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-20 02:32:02,600 INFO L440 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (= (_ +zero 11 53) |ULTIMATE.start___ieee754_atan2_#res|) (let ((.cse1 (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse7 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse7) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse7 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53)))))) (.cse0 (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53))) (.cse2 (= ~zero_atan2~0 (_ +zero 11 53))) (.cse3 (exists ((v_skolemized_v_prenex_22_4 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_4)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_4) ((_ extract 62 52) v_skolemized_v_prenex_22_4) ((_ extract 51 0) v_skolemized_v_prenex_22_4)) (_ +zero 11 53))))) (.cse4 (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse5 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse6 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse5) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse6) (= .cse5 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse6) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))))) (or (and (and .cse0 (= (_ bv0 32) ULTIMATE.start___ieee754_atan2_~m~0) (and .cse1 .cse2 .cse3 .cse4)) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6)))))) (and (= (_ +zero 11 53) |ULTIMATE.start_atan_double_#res|) (and .cse1 (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) .cse0 .cse2 .cse3 .cse4) (= ULTIMATE.start_atan_double_~x (_ +zero 11 53))))) (= (_ +zero 11 53) ULTIMATE.start_main_~y~0)) [2019-11-20 02:32:02,601 INFO L444 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-11-20 02:32:02,601 INFO L440 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-11-20 02:32:02,601 INFO L444 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-11-20 02:32:02,601 INFO L444 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-11-20 02:32:02,601 INFO L440 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-11-20 02:32:02,601 INFO L444 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-11-20 02:32:02,601 INFO L447 ceAbstractionStarter]: At program point L276(lines 256 277) the Hoare annotation is: true [2019-11-20 02:32:02,601 INFO L444 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-11-20 02:32:02,601 INFO L444 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-11-20 02:32:02,601 INFO L444 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-11-20 02:32:02,602 INFO L444 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-11-20 02:32:02,602 INFO L440 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= ~zero_atan2~0 (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (= (_ +zero 11 53) ULTIMATE.start_main_~y~0) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0)) [2019-11-20 02:32:02,602 INFO L444 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-11-20 02:32:02,602 INFO L444 ceAbstractionStarter]: For program point L247-1(lines 247 251) no Hoare annotation was computed. [2019-11-20 02:32:02,602 INFO L444 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-20 02:32:02,603 INFO L440 ceAbstractionStarter]: At program point L247-2(lines 247 251) the Hoare annotation is: (let ((.cse0 (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y)) (.cse1 (and (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse11 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse11) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse11 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) |ULTIMATE.start_main_#t~short53| (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_4 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_4)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_4) ((_ extract 62 52) v_skolemized_v_prenex_22_4) ((_ extract 51 0) v_skolemized_v_prenex_22_4)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse12 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse13 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse12) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse13) (= .cse12 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse13) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))))) (.cse2 (= (_ +zero 11 53) ULTIMATE.start_main_~y~0))) (or (and (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) .cse0 (= (_ +zero 11 53) |ULTIMATE.start___ieee754_atan2_#res|) .cse1 .cse2) (and |ULTIMATE.start___ieee754_atan2_#t~switch43| (exists ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|))) (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|)) |ULTIMATE.start_atan_double_#res|))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))))) (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64))) (and (= ULTIMATE.start_atan_double_~hx~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) ULTIMATE.start_atan_double_~x))) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= |ULTIMATE.start___ieee754_atan2_#res| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))))) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= ULTIMATE.start___ieee754_atan2_~z~1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))))) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= (let ((.cse3 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) |ULTIMATE.start_atan_double_#res|)) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))) (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)))) (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) ULTIMATE.start_atan_double_~ix~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) ULTIMATE.start_atan_double_~x))) (and (and .cse0 .cse1) .cse2) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= ULTIMATE.start___signbit_double_~x (let ((.cse4 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (exists ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (v_arrayElimCell_24 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|))) (= ULTIMATE.start_atan_double_~x (let ((.cse5 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)) v_arrayElimCell_24))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5)))))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= |ULTIMATE.start___ieee754_atan2_#res| (let ((.cse6 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= ULTIMATE.start___ieee754_atan2_~z~1 (let ((.cse7 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= ULTIMATE.start_main_~res~0 (let ((.cse8 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) (exists ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (v_arrayElimCell_24 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse9 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)) v_arrayElimCell_24))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))))) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (bvor (bvand (_ bv1 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_22_7) (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|) (_ bv30 32)))) ULTIMATE.start___ieee754_atan2_~m~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (v_arrayElimCell_24 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|))) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse10 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)) v_arrayElimCell_24))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))))))))) [2019-11-20 02:32:02,604 INFO L444 ceAbstractionStarter]: For program point L247-3(lines 247 251) no Hoare annotation was computed. [2019-11-20 02:32:02,604 INFO L444 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-11-20 02:32:02,604 INFO L444 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-11-20 02:32:02,604 INFO L444 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-11-20 02:32:02,604 INFO L444 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-11-20 02:32:02,604 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-11-20 02:32:02,605 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-11-20 02:32:02,605 INFO L444 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-11-20 02:32:02,605 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-11-20 02:32:02,605 INFO L444 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-20 02:32:02,605 INFO L440 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-20 02:32:02,605 INFO L444 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-20 02:32:02,606 INFO L440 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: (and (exists ((ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= ULTIMATE.start_fabs_double_~x (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x)))) (exists ((ULTIMATE.start___ieee754_atan2_~hx~1 (_ BitVec 32)) (v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (bvneg (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_atan2_~hx~1))) (_ bv20 32)) ULTIMATE.start___ieee754_atan2_~k~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))) (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse1 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse0) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse1) (= .cse0 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse1) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse2) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse2 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3))) (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_3)))) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6))))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (bvor (bvand (_ bv1 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_22_7) (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|) (_ bv30 32)))) ULTIMATE.start___ieee754_atan2_~m~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)) (_ +zero 11 53)))) (= (_ +zero 11 53) ULTIMATE.start_main_~y~0)) [2019-11-20 02:32:02,606 INFO L444 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-11-20 02:32:02,606 INFO L440 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-11-20 02:32:02,606 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 02:32:02,606 INFO L444 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-11-20 02:32:02,607 INFO L444 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-11-20 02:32:02,607 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-20 02:32:02,608 INFO L440 ceAbstractionStarter]: At program point L253(lines 244 254) the Hoare annotation is: (let ((.cse9 (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))) (.cse1 (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y)) (.cse2 (and (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse14 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse14) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse14 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_3))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) |ULTIMATE.start_main_#t~short53| (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_4 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_4)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_4) ((_ extract 62 52) v_skolemized_v_prenex_22_4) ((_ extract 51 0) v_skolemized_v_prenex_22_4)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse15 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse16 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse15) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse16) (= .cse15 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse16) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))))) (.cse3 (= (_ +zero 11 53) ULTIMATE.start_main_~y~0))) (or (and |ULTIMATE.start___ieee754_atan2_#t~switch43| (exists ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|))) (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|)) |ULTIMATE.start_atan_double_#res|))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))))) (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64))) (and (= ULTIMATE.start_atan_double_~hx~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) ULTIMATE.start_atan_double_~x))) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= |ULTIMATE.start___ieee754_atan2_#res| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))))) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= ULTIMATE.start___ieee754_atan2_~z~1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))))) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) |ULTIMATE.start_atan_double_#res|)) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))) (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)))) (exists ((|v_skolemized_q#valueAsBitvector_43| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_43|)) ULTIMATE.start_atan_double_~ix~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_43|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_43|)) ULTIMATE.start_atan_double_~x))) (and (and .cse1 .cse2) .cse3) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= ULTIMATE.start___signbit_double_~x (let ((.cse4 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (exists ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (v_arrayElimCell_24 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|))) (= ULTIMATE.start_atan_double_~x (let ((.cse5 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)) v_arrayElimCell_24))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5)))))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= |ULTIMATE.start___ieee754_atan2_#res| (let ((.cse6 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= ULTIMATE.start___ieee754_atan2_~z~1 (let ((.cse7 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))))) (exists ((ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32))) (= ULTIMATE.start_main_~res~0 (let ((.cse8 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))) .cse9 (exists ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (v_arrayElimCell_24 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse10 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)) v_arrayElimCell_24))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10)))))) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64)) (ULTIMATE.start_fabs_double_~high~0 (_ BitVec 32)) (v_arrayElimCell_28 (_ BitVec 32)) (v_skolemized_v_prenex_31_6 (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) v_skolemized_v_prenex_31_6) ((_ extract 62 52) v_skolemized_v_prenex_31_6) ((_ extract 51 0) v_skolemized_v_prenex_31_6)))) (and (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_31_6)) (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= .cse11 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|))) (= .cse11 (let ((.cse12 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_28))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12))))))) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (bvor (bvand (_ bv1 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_22_7) (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|) (_ bv30 32)))) ULTIMATE.start___ieee754_atan2_~m~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_42| (_ BitVec 64)) (v_arrayElimCell_24 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_42|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_42|))) (= |ULTIMATE.start_fabs_double_#res| (let ((.cse13 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_42|)) v_arrayElimCell_24))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))))) (and .cse9 (exists ((v_skolemized_v_prenex_31_4 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_31_4) ((_ extract 62 52) v_skolemized_v_prenex_31_4) ((_ extract 51 0) v_skolemized_v_prenex_31_4))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_31_4)))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) .cse1 (= (_ +zero 11 53) |ULTIMATE.start___ieee754_atan2_#res|) .cse2 .cse3))) [2019-11-20 02:32:02,608 INFO L444 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-20 02:32:02,608 INFO L444 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-11-20 02:32:02,609 INFO L440 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse0) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse0 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= ~zero_atan2~0 (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse2 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse1) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse2) (= .cse1 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse2) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (= (_ +zero 11 53) ULTIMATE.start_main_~y~0) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0)) [2019-11-20 02:32:02,609 INFO L444 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-11-20 02:32:02,609 INFO L444 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-11-20 02:32:02,609 INFO L444 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-11-20 02:32:02,609 INFO L444 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-20 02:32:02,609 INFO L444 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-11-20 02:32:02,610 INFO L444 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-11-20 02:32:02,610 INFO L444 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-11-20 02:32:02,610 INFO L444 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-11-20 02:32:02,610 INFO L444 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-11-20 02:32:02,610 INFO L444 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-11-20 02:32:02,610 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-11-20 02:32:02,610 INFO L444 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-11-20 02:32:02,610 INFO L444 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-11-20 02:32:02,611 INFO L444 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-11-20 02:32:02,611 INFO L444 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-11-20 02:32:02,611 INFO L444 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-11-20 02:32:02,611 INFO L444 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-11-20 02:32:02,611 INFO L444 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-11-20 02:32:02,611 INFO L444 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-11-20 02:32:02,611 INFO L444 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-11-20 02:32:02,611 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 02:32:02,612 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-20 02:32:02,612 INFO L444 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-11-20 02:32:02,612 INFO L440 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-11-20 02:32:02,612 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-20 02:32:02,612 INFO L444 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-11-20 02:32:02,612 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-11-20 02:32:02,612 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 02:32:02,613 INFO L444 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-11-20 02:32:02,613 INFO L444 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-11-20 02:32:02,613 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-11-20 02:32:02,613 INFO L440 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-11-20 02:32:02,614 INFO L440 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (v_arrayElimCell_20 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= |ULTIMATE.start_fabs_double_#res| (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) v_arrayElimCell_20))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|))))) (exists ((ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= ULTIMATE.start_fabs_double_~x (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x)))) (exists ((ULTIMATE.start___ieee754_atan2_~hx~1 (_ BitVec 32)) (v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (bvneg (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_atan2_~hx~1))) (_ bv20 32)) ULTIMATE.start___ieee754_atan2_~k~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))) (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse2 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse1) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse2) (= .cse1 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse2) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)))) (and (= .cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))) (= .cse3 (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x)) (= (let ((.cse4 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) |ULTIMATE.start_fabs_double_#res|)))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse5 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse5) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse5 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_3) ((_ extract 62 52) v_skolemized_v_prenex_22_3) ((_ extract 51 0) v_skolemized_v_prenex_22_3))) (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_3)))) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6))))) (exists ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|))) (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (bvor (bvand (_ bv1 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_22_7) (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|) (_ bv30 32)))) ULTIMATE.start___ieee754_atan2_~m~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)) (_ +zero 11 53)))) (= (_ +zero 11 53) ULTIMATE.start_main_~y~0)) [2019-11-20 02:32:02,614 INFO L440 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-11-20 02:32:02,614 INFO L444 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-11-20 02:32:02,614 INFO L444 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-11-20 02:32:02,614 INFO L444 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-11-20 02:32:02,615 INFO L444 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-11-20 02:32:02,615 INFO L444 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-20 02:32:02,615 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-11-20 02:32:02,615 INFO L444 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-11-20 02:32:02,615 INFO L440 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse0) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse0 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6))))) (= (_ +zero 11 53) |ULTIMATE.start_atan_double_#res|) (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_4 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_4)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_4) ((_ extract 62 52) v_skolemized_v_prenex_22_4) ((_ extract 51 0) v_skolemized_v_prenex_22_4)) (_ +zero 11 53)))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse2 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse1) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse2) (= .cse1 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse2) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (= ULTIMATE.start_atan_double_~x (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start_main_~y~0) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0)) [2019-11-20 02:32:02,616 INFO L444 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-11-20 02:32:02,616 INFO L444 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-11-20 02:32:02,616 INFO L444 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-11-20 02:32:02,617 INFO L440 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (v_arrayElimCell_20 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (= |ULTIMATE.start_fabs_double_#res| (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) v_arrayElimCell_20))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|))))) (exists ((|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_38|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_38|)) ULTIMATE.start_atan_double_~x) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|) ULTIMATE.start_atan_double_~hx~0))) (exists ((ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= ULTIMATE.start_fabs_double_~x (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x)))) (exists ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)))) (and (= .cse1 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))) (= (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_atan_double_#res|) (= .cse1 (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x))))) (exists ((ULTIMATE.start___ieee754_atan2_~hx~1 (_ BitVec 32)) (v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= (bvashr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6)) (bvneg (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_atan2_~hx~1))) (_ bv20 32)) ULTIMATE.start___ieee754_atan2_~k~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))))) (exists ((v_skolemized_v_prenex_22_5 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_5)) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_5) ((_ extract 62 52) v_skolemized_v_prenex_22_5) ((_ extract 51 0) v_skolemized_v_prenex_22_5))))) (= ~zero_atan2~0 (_ +zero 11 53)) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse3 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse4 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse3) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse4) (= .cse3 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse4) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|)) |ULTIMATE.start_atan_double_#res|))) (exists ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse5 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)))) (and (= .cse5 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))) (= .cse5 (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x)) (= (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))) |ULTIMATE.start_fabs_double_#res|)))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse7 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse7) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse7 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_36| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (let ((.cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_37|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_37|)))) (and (= .cse8 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_36|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_36|))) (= (let ((.cse9 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_36|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))) ULTIMATE.start_atan_double_~x) (= .cse8 (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6))))) (exists ((|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|))) (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_41| (_ BitVec 64)) (v_skolemized_v_prenex_22_7 (_ BitVec 64))) (and (= (bvor (bvand (_ bv1 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_22_7) (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_41|) (_ bv30 32)))) ULTIMATE.start___ieee754_atan2_~m~0) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_7) ((_ extract 62 52) v_skolemized_v_prenex_22_7) ((_ extract 51 0) v_skolemized_v_prenex_22_7))) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_41|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_41|)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_40| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_39| (_ BitVec 64)) (v_arrayElimCell_20 (_ BitVec 32)) (ULTIMATE.start___ieee754_atan2_~x (_ FloatingPoint 11 53))) (and (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (= (let ((.cse10 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_39|)) v_arrayElimCell_20))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_40|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_40|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_40|))) (= ULTIMATE.start_atan_double_~ix~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_40|))) (= (fp.div roundNearestTiesToEven (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~x) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_39|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_39|))))) (= (_ +zero 11 53) ULTIMATE.start_main_~y~0) (exists ((|v_skolemized_q#valueAsBitvector_44| (_ BitVec 64))) (and (bvslt (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_44|)) (_ bv1071382528 32)) (= ULTIMATE.start_atan_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_44|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_44|)))))) [2019-11-20 02:32:02,617 INFO L444 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-20 02:32:02,617 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-11-20 02:32:02,617 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 02:32:02,618 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 271) no Hoare annotation was computed. [2019-11-20 02:32:02,618 INFO L444 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-20 02:32:02,618 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-11-20 02:32:02,618 INFO L440 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_skolemized_v_prenex_19_3)) (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse0) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|)) (= .cse0 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (fp.gt ULTIMATE.start___ieee754_atan2_~x (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_6 (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_22_6) ((_ extract 62 52) v_skolemized_v_prenex_22_6) ((_ extract 51 0) v_skolemized_v_prenex_22_6))) (= ULTIMATE.start___ieee754_atan2_~iy~0 (bvand (_ bv2147483647 32) ((_ extract 63 32) v_skolemized_v_prenex_22_6))))) (= ~zero_atan2~0 (_ +zero 11 53)) (exists ((v_skolemized_v_prenex_22_4 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) v_skolemized_v_prenex_22_4)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_22_4) ((_ extract 62 52) v_skolemized_v_prenex_22_4) ((_ extract 51 0) v_skolemized_v_prenex_22_4)) (_ +zero 11 53)))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (v_skolemized_v_prenex_19_3 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_33|)) (.cse2 ((_ extract 63 32) v_skolemized_v_prenex_19_3))) (and (= ULTIMATE.start___ieee754_atan2_~lx~0 .cse1) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) .cse2) (= .cse1 ((_ extract 31 0) v_skolemized_v_prenex_19_3)) (= (bvand (_ bv2147483647 32) .cse2) ULTIMATE.start___ieee754_atan2_~ix~1) (fp.gt (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_33|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_33|)) (_ +zero 11 53))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_atan~0) (= ULTIMATE.start_atan_double_~x (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start_main_~y~0) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ~one_atan~0)) [2019-11-20 02:32:02,623 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:556) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:256) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 02:32:02,631 INFO L168 Benchmark]: Toolchain (without parser) took 579873.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 219.2 MB). Free memory was 955.1 MB in the beginning and 1.0 GB in the end (delta: -60.0 MB). Peak memory consumption was 373.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:32:02,631 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:32:02,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.1 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:32:02,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:32:02,632 INFO L168 Benchmark]: Boogie Preprocessor took 86.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 02:32:02,632 INFO L168 Benchmark]: RCFGBuilder took 36150.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.4 MB). Peak memory consumption was 76.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:32:02,633 INFO L168 Benchmark]: TraceAbstraction took 543163.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 317.0 MB. Max. memory is 11.5 GB. [2019-11-20 02:32:02,635 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 404.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.1 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 36150.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.4 MB). Peak memory consumption was 76.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 543163.38 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 76.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.8 MB). Peak memory consumption was 317.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 271]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...