./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_0680b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0680b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/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 6672245f6516202a276f3cff39e39bf6cfceaf3d ........................................................................................................................................................................................................................................................................................................................... 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_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_0680b.c -s /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/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 6672245f6516202a276f3cff39e39bf6cfceaf3d ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:57:56,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:57:56,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:57:56,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:57:56,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:57:56,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:57:56,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:57:56,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:57:56,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:57:56,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:57:56,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:57:56,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:57:56,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:57:56,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:57:56,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:57:56,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:57:56,597 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:57:56,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:57:56,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:57:56,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:57:56,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:57:56,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:57:56,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:57:56,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:57:56,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:57:56,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:57:56,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:57:56,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:57:56,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:57:56,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:57:56,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:57:56,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:57:56,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:57:56,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:57:56,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:57:56,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:57:56,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:57:56,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:57:56,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:57:56,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:57:56,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:57:56,616 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:57:56,628 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:57:56,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:57:56,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:57:56,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:57:56,630 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:57:56,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:57:56,631 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:57:56,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:57:56,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:57:56,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:57:56,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:57:56,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:57:56,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:57:56,632 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:57:56,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:57:56,633 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:57:56,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:57:56,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:57:56,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:57:56,634 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:57:56,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:57:56,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:57:56,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:57:56,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:57:56,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:57:56,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:57:56,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:57:56,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:57:56,636 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_359549a9-7231-4c78-bb07-d34b81499a07/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 -> 6672245f6516202a276f3cff39e39bf6cfceaf3d [2019-11-15 23:57:56,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:57:56,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:57:56,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:57:56,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:57:56,676 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:57:56,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0680b.c [2019-11-15 23:57:56,744 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/data/4defb50ae/8d3e0c2eeaf948539de24ff3c616e91e/FLAG439c35bf7 [2019-11-15 23:57:57,104 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:57:57,104 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/sv-benchmarks/c/float-newlib/double_req_bl_0680b.c [2019-11-15 23:57:57,112 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/data/4defb50ae/8d3e0c2eeaf948539de24ff3c616e91e/FLAG439c35bf7 [2019-11-15 23:57:57,515 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/data/4defb50ae/8d3e0c2eeaf948539de24ff3c616e91e [2019-11-15 23:57:57,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:57:57,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:57:57,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:57:57,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:57:57,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:57:57,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:57:57" (1/1) ... [2019-11-15 23:57:57,526 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4d9a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57, skipping insertion in model container [2019-11-15 23:57:57,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:57:57" (1/1) ... [2019-11-15 23:57:57,533 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:57:57,557 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:57:57,811 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:57:57,817 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:57:57,870 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:57:57,897 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:57:57,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57 WrapperNode [2019-11-15 23:57:57,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:57:57,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:57:57,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:57:57,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:57:57,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57" (1/1) ... [2019-11-15 23:57:57,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57" (1/1) ... [2019-11-15 23:57:57,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:57:57,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:57:57,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:57:57,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:57:57,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57" (1/1) ... [2019-11-15 23:57:57,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57" (1/1) ... [2019-11-15 23:57:58,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57" (1/1) ... [2019-11-15 23:57:58,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57" (1/1) ... [2019-11-15 23:57:58,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57" (1/1) ... [2019-11-15 23:57:58,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57" (1/1) ... [2019-11-15 23:57:58,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57" (1/1) ... [2019-11-15 23:57:58,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:57:58,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:57:58,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:57:58,100 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:57:58,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:57:58,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:57:58,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-15 23:57:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:57:58,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-15 23:57:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:57:58,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:57:58,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:57:58,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-15 23:57:58,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:57:58,950 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:57:58,951 INFO L284 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-15 23:57:58,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:57:58 BoogieIcfgContainer [2019-11-15 23:57:58,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:57:58,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:57:58,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:57:58,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:57:58,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:57:57" (1/3) ... [2019-11-15 23:57:58,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76481d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:57:58, skipping insertion in model container [2019-11-15 23:57:58,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:57:57" (2/3) ... [2019-11-15 23:57:58,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76481d26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:57:58, skipping insertion in model container [2019-11-15 23:57:58,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:57:58" (3/3) ... [2019-11-15 23:57:58,959 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0680b.c [2019-11-15 23:57:58,967 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:57:58,974 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:57:58,984 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:57:59,005 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:57:59,005 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:57:59,006 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:57:59,006 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:57:59,006 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:57:59,006 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:57:59,006 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:57:59,006 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:57:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-15 23:57:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:57:59,028 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:59,028 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:59,030 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:59,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:59,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2019-11-15 23:57:59,047 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:59,048 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026807063] [2019-11-15 23:57:59,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:59,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:59,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:57:59,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026807063] [2019-11-15 23:57:59,182 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:59,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:57:59,183 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900244237] [2019-11-15 23:57:59,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:57:59,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:57:59,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:57:59,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:57:59,202 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-15 23:57:59,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:59,251 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2019-11-15 23:57:59,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:57:59,252 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-15 23:57:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:59,263 INFO L225 Difference]: With dead ends: 224 [2019-11-15 23:57:59,263 INFO L226 Difference]: Without dead ends: 110 [2019-11-15 23:57:59,267 INFO L600 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-15 23:57:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-15 23:57:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-15 23:57:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 23:57:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2019-11-15 23:57:59,307 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2019-11-15 23:57:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:59,307 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2019-11-15 23:57:59,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:57:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2019-11-15 23:57:59,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 23:57:59,308 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:59,308 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:59,309 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:59,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:59,309 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2019-11-15 23:57:59,309 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:57:59,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674709807] [2019-11-15 23:57:59,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:59,310 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:57:59,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:57:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:57:59,608 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:57:59,608 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:57:59,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:57:59 BoogieIcfgContainer [2019-11-15 23:57:59,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:57:59,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:57:59,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:57:59,669 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:57:59,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:57:58" (3/4) ... [2019-11-15 23:57:59,673 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:57:59,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:57:59,676 INFO L168 Benchmark]: Toolchain (without parser) took 2155.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 942.1 MB in the beginning and 1.0 GB in the end (delta: -65.5 MB). Peak memory consumption was 65.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:59,676 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:57:59,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 942.1 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:59,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.01 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.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:59,679 INFO L168 Benchmark]: Boogie Preprocessor took 111.81 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:59,680 INFO L168 Benchmark]: RCFGBuilder took 853.05 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: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:59,681 INFO L168 Benchmark]: TraceAbstraction took 715.37 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: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:57:59,681 INFO L168 Benchmark]: Witness Printer took 4.04 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-15 23:57:59,688 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 966.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 942.1 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.01 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.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 111.81 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 853.05 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: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 715.37 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: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.04 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: 256]: 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 251, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 255. 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={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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] [L251] double x = -0.0; [L252] double y = 0.0; [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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] [L253] double res = __ieee754_atan2(y, x); [L255] COND TRUE res != pi VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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] [L256] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3: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, 113 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 161 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=113occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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-cad4683 [2019-11-15 23:58:01,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:58:01,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:58:01,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:58:01,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:58:01,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:58:01,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:58:01,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:58:01,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:58:01,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:58:01,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:58:01,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:58:01,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:58:01,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:58:01,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:58:01,896 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:58:01,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:58:01,898 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:58:01,899 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:58:01,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:58:01,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:58:01,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:58:01,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:58:01,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:58:01,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:58:01,920 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:58:01,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:58:01,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:58:01,922 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:58:01,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:58:01,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:58:01,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:58:01,925 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:58:01,926 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:58:01,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:58:01,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:58:01,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:58:01,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:58:01,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:58:01,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:58:01,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:58:01,933 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:58:01,945 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:58:01,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:58:01,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:58:01,947 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:58:01,947 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:58:01,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:58:01,948 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:58:01,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:58:01,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:58:01,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:58:01,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:58:01,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:58:01,949 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:58:01,949 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:58:01,950 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:58:01,950 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:58:01,950 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:58:01,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:58:01,951 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:58:01,951 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:58:01,951 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:58:01,951 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:58:01,952 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:58:01,952 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:58:01,952 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:58:01,952 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:58:01,953 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:58:01,953 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:58:01,953 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:58:01,953 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:58:01,954 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_359549a9-7231-4c78-bb07-d34b81499a07/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 -> 6672245f6516202a276f3cff39e39bf6cfceaf3d [2019-11-15 23:58:01,982 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:58:01,992 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:58:01,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:58:01,997 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:58:01,997 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:58:01,998 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_0680b.c [2019-11-15 23:58:02,046 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/data/11dd376e3/81593569b75242e993fe228bde323d8d/FLAG7f22b7449 [2019-11-15 23:58:02,440 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:58:02,441 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/sv-benchmarks/c/float-newlib/double_req_bl_0680b.c [2019-11-15 23:58:02,448 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/data/11dd376e3/81593569b75242e993fe228bde323d8d/FLAG7f22b7449 [2019-11-15 23:58:02,461 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/data/11dd376e3/81593569b75242e993fe228bde323d8d [2019-11-15 23:58:02,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:58:02,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:58:02,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:58:02,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:58:02,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:58:02,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:58:02" (1/1) ... [2019-11-15 23:58:02,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cbb7b01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02, skipping insertion in model container [2019-11-15 23:58:02,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:58:02" (1/1) ... [2019-11-15 23:58:02,480 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:58:02,521 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:58:02,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:58:02,851 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:58:02,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:58:02,961 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:58:02,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02 WrapperNode [2019-11-15 23:58:02,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:58:02,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:58:02,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:58:02,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:58:02,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02" (1/1) ... [2019-11-15 23:58:02,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02" (1/1) ... [2019-11-15 23:58:03,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:58:03,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:58:03,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:58:03,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:58:03,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02" (1/1) ... [2019-11-15 23:58:03,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02" (1/1) ... [2019-11-15 23:58:03,043 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02" (1/1) ... [2019-11-15 23:58:03,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02" (1/1) ... [2019-11-15 23:58:03,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02" (1/1) ... [2019-11-15 23:58:03,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02" (1/1) ... [2019-11-15 23:58:03,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02" (1/1) ... [2019-11-15 23:58:03,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:58:03,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:58:03,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:58:03,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:58:03,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:58:03,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-15 23:58:03,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-15 23:58:03,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:58:03,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-15 23:58:03,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:58:03,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:58:03,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:58:03,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:58:03,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:58:42,064 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:58:42,065 INFO L284 CfgBuilder]: Removed 44 assume(true) statements. [2019-11-15 23:58:42,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:58:42 BoogieIcfgContainer [2019-11-15 23:58:42,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:58:42,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:58:42,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:58:42,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:58:42,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:58:02" (1/3) ... [2019-11-15 23:58:42,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69396e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:58:42, skipping insertion in model container [2019-11-15 23:58:42,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:02" (2/3) ... [2019-11-15 23:58:42,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69396e50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:58:42, skipping insertion in model container [2019-11-15 23:58:42,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:58:42" (3/3) ... [2019-11-15 23:58:42,072 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_0680b.c [2019-11-15 23:58:42,081 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:58:42,089 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:58:42,097 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:58:42,116 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:58:42,116 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:58:42,116 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:58:42,116 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:58:42,117 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:58:42,117 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:58:42,117 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:58:42,117 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:58:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-11-15 23:58:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 23:58:42,140 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:42,141 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:42,143 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:42,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:42,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2019-11-15 23:58:42,156 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:58:42,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32264814] [2019-11-15 23:58:42,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-15 23:58:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:42,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 23:58:42,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:42,526 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:58:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:42,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32264814] [2019-11-15 23:58:42,531 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:42,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 23:58:42,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109472954] [2019-11-15 23:58:42,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:58:42,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:58:42,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:58:42,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:58:42,551 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-11-15 23:58:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:42,580 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2019-11-15 23:58:42,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:58:42,582 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-15 23:58:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:42,594 INFO L225 Difference]: With dead ends: 224 [2019-11-15 23:58:42,594 INFO L226 Difference]: Without dead ends: 110 [2019-11-15 23:58:42,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:58:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-15 23:58:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-15 23:58:42,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 23:58:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2019-11-15 23:58:42,636 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2019-11-15 23:58:42,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:42,637 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2019-11-15 23:58:42,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:58:42,637 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2019-11-15 23:58:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 23:58:42,638 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:42,638 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:42,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 23:58:42,855 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:42,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2019-11-15 23:58:42,856 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:58:42,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105512033] [2019-11-15 23:58:42,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-15 23:58:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:43,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:58:43,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:43,456 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:58:43,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:58:43,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:58:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:44,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105512033] [2019-11-15 23:58:44,047 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:44,047 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-15 23:58:44,047 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679596347] [2019-11-15 23:58:44,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:58:44,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:58:44,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:58:44,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:58:44,049 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand 12 states. [2019-11-15 23:58:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:45,759 INFO L93 Difference]: Finished difference Result 161 states and 226 transitions. [2019-11-15 23:58:45,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:58:45,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-11-15 23:58:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:45,762 INFO L225 Difference]: With dead ends: 161 [2019-11-15 23:58:45,764 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 23:58:45,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:58:45,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 23:58:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-15 23:58:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 23:58:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2019-11-15 23:58:45,775 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 12 [2019-11-15 23:58:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:45,776 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2019-11-15 23:58:45,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:58:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2019-11-15 23:58:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:58:45,777 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:45,777 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:45,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 23:58:45,991 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:45,991 INFO L82 PathProgramCache]: Analyzing trace with hash 810615587, now seen corresponding path program 1 times [2019-11-15 23:58:45,992 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:58:45,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471034806] [2019-11-15 23:58:45,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-15 23:58:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:46,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:58:46,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:46,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-15 23:58:46,439 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:58:46,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-15 23:58:46,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:46,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:46,468 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:46,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2019-11-15 23:58:46,469 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:46,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:46,479 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:46,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:46,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:58:46,492 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2019-11-15 23:58:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:46,552 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:58:46,649 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:46,649 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 39 [2019-11-15 23:58:46,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:46,685 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 35 [2019-11-15 23:58:46,685 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:46,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:46,714 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:46,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 19 [2019-11-15 23:58:46,715 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:46,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:46,720 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:46,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:46,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:58:46,736 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:20 [2019-11-15 23:58:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:46,787 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471034806] [2019-11-15 23:58:46,787 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:46,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-15 23:58:46,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770375120] [2019-11-15 23:58:46,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:58:46,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:58:46,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:58:46,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:58:46,788 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand 8 states. [2019-11-15 23:58:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:49,610 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2019-11-15 23:58:50,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:58:50,012 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-11-15 23:58:50,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:50,013 INFO L225 Difference]: With dead ends: 125 [2019-11-15 23:58:50,013 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 23:58:50,014 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:58:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 23:58:50,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-15 23:58:50,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 23:58:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2019-11-15 23:58:50,029 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 17 [2019-11-15 23:58:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:50,029 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2019-11-15 23:58:50,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:58:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2019-11-15 23:58:50,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:58:50,030 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:50,031 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:50,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 23:58:50,244 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:50,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:50,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1532035359, now seen corresponding path program 1 times [2019-11-15 23:58:50,245 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:58:50,245 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089486316] [2019-11-15 23:58:50,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-15 23:58:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:50,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:58:50,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:50,679 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:58:50,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:58:50,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:58:50,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:58:50,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:50,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089486316] [2019-11-15 23:58:50,881 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:50,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-15 23:58:50,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11829379] [2019-11-15 23:58:50,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:58:50,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:58:50,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:58:50,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:58:50,883 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand 11 states. [2019-11-15 23:58:54,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:54,112 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2019-11-15 23:58:54,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:58:54,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2019-11-15 23:58:54,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:54,117 INFO L225 Difference]: With dead ends: 130 [2019-11-15 23:58:54,120 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 23:58:54,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:58:54,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 23:58:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-15 23:58:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 23:58:54,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-11-15 23:58:54,131 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 17 [2019-11-15 23:58:54,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:54,131 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-11-15 23:58:54,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:58:54,131 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-11-15 23:58:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:58:54,132 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:54,132 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:54,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-15 23:58:54,348 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:54,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:54,348 INFO L82 PathProgramCache]: Analyzing trace with hash -255340040, now seen corresponding path program 1 times [2019-11-15 23:58:54,349 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:58:54,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61521188] [2019-11-15 23:58:54,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-15 23:58:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:54,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 23:58:54,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:54,908 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 23:58:55,230 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 23:58:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:55,232 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:58:56,348 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-11-15 23:58:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:56,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61521188] [2019-11-15 23:58:56,350 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:56,350 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-15 23:58:56,350 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910903055] [2019-11-15 23:58:56,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:58:56,351 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:58:56,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:58:56,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:58:56,351 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 8 states. [2019-11-15 23:58:56,842 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-11-15 23:58:57,355 WARN L191 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-15 23:58:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:58,574 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-11-15 23:58:58,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:58:58,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-15 23:58:58,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:58,579 INFO L225 Difference]: With dead ends: 75 [2019-11-15 23:58:58,579 INFO L226 Difference]: Without dead ends: 71 [2019-11-15 23:58:58,580 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:58:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-15 23:58:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-15 23:58:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-15 23:58:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2019-11-15 23:58:58,589 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 18 [2019-11-15 23:58:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:58,590 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2019-11-15 23:58:58,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:58:58,590 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2019-11-15 23:58:58,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:58:58,591 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:58,591 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:58,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-15 23:58:58,812 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:58,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:58,813 INFO L82 PathProgramCache]: Analyzing trace with hash 667658140, now seen corresponding path program 1 times [2019-11-15 23:58:58,813 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:58:58,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348589748] [2019-11-15 23:58:58,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-15 23:58:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:59,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:58:59,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:59,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:58:59,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:59,256 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:58:59,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:58:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:58:59,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348589748] [2019-11-15 23:58:59,473 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:59,473 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-15 23:58:59,473 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439611617] [2019-11-15 23:58:59,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:58:59,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:58:59,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:58:59,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:58:59,474 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 11 states. [2019-11-15 23:58:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:59,815 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2019-11-15 23:58:59,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:58:59,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-15 23:58:59,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:59,815 INFO L225 Difference]: With dead ends: 71 [2019-11-15 23:58:59,816 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:58:59,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:58:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:58:59,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:58:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:58:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:58:59,817 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-11-15 23:58:59,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:59,817 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:58:59,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:58:59,818 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:58:59,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:59:00,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-15 23:59:00,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:59:00,893 WARN L191 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-11-15 23:59:00,894 INFO L443 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-11-15 23:59:00,894 INFO L443 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-11-15 23:59:00,894 INFO L439 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-11-15 23:59:00,895 INFO L443 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-11-15 23:59:00,896 INFO L443 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-11-15 23:59:00,896 INFO L443 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-11-15 23:59:00,896 INFO L443 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-11-15 23:59:00,896 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-11-15 23:59:00,896 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-11-15 23:59:00,896 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 23:59:00,896 INFO L439 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (= (fp.neg (_ +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_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))))) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|) ULTIMATE.start___ieee754_atan2_~hx~1))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (= (bvor ULTIMATE.start___ieee754_atan2_~iy~0 ULTIMATE.start___ieee754_atan2_~ly~0) (_ bv0 32)) (exists ((|v_skolemized_q#valueAsBitvector_33| (_ BitVec 64)) (ULTIMATE.start___ieee754_atan2_~hy~0 (_ BitVec 32))) (and (= (bvor (bvand (_ bv1 32) (bvashr ULTIMATE.start___ieee754_atan2_~hy~0 (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_33|) (_ bv30 32)))) ULTIMATE.start___ieee754_atan2_~m~0) (= (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|)) (fp.neg (_ +zero 11 53))))) (= ~tiny_atan2~0 .cse0) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= |ULTIMATE.start___ieee754_atan2_#res| (fp.add roundNearestTiesToEven ~pi~0 .cse0)))) [2019-11-15 23:59:00,896 INFO L443 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-11-15 23:59:00,896 INFO L439 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-11-15 23:59:00,896 INFO L443 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-11-15 23:59:00,896 INFO L443 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-11-15 23:59:00,897 INFO L439 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-11-15 23:59:00,897 INFO L443 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-11-15 23:59:00,897 INFO L443 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-11-15 23:59:00,897 INFO L443 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-11-15 23:59:00,897 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-11-15 23:59:00,897 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-11-15 23:59:00,897 INFO L439 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0)))) [2019-11-15 23:59:00,897 INFO L443 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-11-15 23:59:00,897 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 23:59:00,897 INFO L443 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-11-15 23:59:00,897 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-11-15 23:59:00,898 INFO L443 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-11-15 23:59:00,898 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-11-15 23:59:00,898 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-11-15 23:59:00,898 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-11-15 23:59:00,898 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-11-15 23:59:00,898 INFO L443 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-11-15 23:59:00,898 INFO L443 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-15 23:59:00,898 INFO L439 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-15 23:59:00,898 INFO L443 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-15 23:59:00,898 INFO L439 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-15 23:59:00,898 INFO L443 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-11-15 23:59:00,899 INFO L439 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-11-15 23:59:00,899 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:59:00,899 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-11-15 23:59:00,899 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-11-15 23:59:00,899 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-15 23:59:00,900 INFO L443 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-11-15 23:59:00,900 INFO L443 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-11-15 23:59:00,900 INFO L439 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (and (= (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|))))) (exists ((|v_skolemized_q#valueAsBitvector_31| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_31|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_31|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_31|) ULTIMATE.start___ieee754_atan2_~hx~1))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0)))) [2019-11-15 23:59:00,900 INFO L443 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-11-15 23:59:00,900 INFO L443 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-11-15 23:59:00,901 INFO L443 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-11-15 23:59:00,901 INFO L443 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-11-15 23:59:00,901 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-11-15 23:59:00,901 INFO L443 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-11-15 23:59:00,901 INFO L443 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-11-15 23:59:00,902 INFO L443 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-11-15 23:59:00,902 INFO L443 ceAbstractionStarter]: For program point L255(lines 255 258) no Hoare annotation was computed. [2019-11-15 23:59:00,902 INFO L443 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-11-15 23:59:00,902 INFO L443 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-11-15 23:59:00,902 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-11-15 23:59:00,902 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-11-15 23:59:00,903 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-11-15 23:59:00,903 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-11-15 23:59:00,903 INFO L443 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-11-15 23:59:00,903 INFO L443 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-11-15 23:59:00,903 INFO L443 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-11-15 23:59:00,903 INFO L443 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-11-15 23:59:00,903 INFO L443 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-11-15 23:59:00,904 INFO L443 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-11-15 23:59:00,904 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:59:00,904 INFO L443 ceAbstractionStarter]: For program point L256(line 256) no Hoare annotation was computed. [2019-11-15 23:59:00,904 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 23:59:00,904 INFO L443 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-11-15 23:59:00,904 INFO L439 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-11-15 23:59:00,904 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-15 23:59:00,905 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-11-15 23:59:00,905 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-11-15 23:59:00,905 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 256) no Hoare annotation was computed. [2019-11-15 23:59:00,905 INFO L446 ceAbstractionStarter]: At program point L259(lines 244 260) the Hoare annotation is: true [2019-11-15 23:59:00,905 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:59:00,905 INFO L443 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-11-15 23:59:00,905 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-11-15 23:59:00,906 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-11-15 23:59:00,906 INFO L439 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-11-15 23:59:00,906 INFO L439 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-11-15 23:59:00,906 INFO L439 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-11-15 23:59:00,906 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-11-15 23:59:00,906 INFO L443 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-11-15 23:59:00,906 INFO L443 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-11-15 23:59:00,906 INFO L443 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-11-15 23:59:00,907 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 23:59:00,907 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-11-15 23:59:00,907 INFO L443 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-11-15 23:59:00,907 INFO L439 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-11-15 23:59:00,907 INFO L443 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-11-15 23:59:00,907 INFO L443 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-11-15 23:59:00,907 INFO L443 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-11-15 23:59:00,907 INFO L439 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-11-15 23:59:00,907 INFO L443 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-11-15 23:59:00,907 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-11-15 23:59:00,907 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:59:00,907 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 23:59:00,907 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-11-15 23:59:00,908 INFO L439 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-11-15 23:59:00,916 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,917 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,924 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,925 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,927 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,928 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,929 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,929 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,932 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,932 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:00,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:00,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:00,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:00,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-11-15 23:59:00,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:00,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:00,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:00,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:00,944 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,945 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,945 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,945 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:00,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:00,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:00,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:00,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:00,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-11-15 23:59:00,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:00,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:00,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:00,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:00,960 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,960 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,960 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,961 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:00,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:59:00 BoogieIcfgContainer [2019-11-15 23:59:00,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:59:00,964 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:59:00,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:59:00,964 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:59:00,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:58:42" (3/4) ... [2019-11-15 23:59:00,968 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:59:00,985 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-15 23:59:00,986 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-11-15 23:59:01,013 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_31[63:32] == hx)) && ~Pluszero~LONGDOUBLE() == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) [2019-11-15 23:59:01,013 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_v_prenex_22_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]) && hy == v_skolemized_v_prenex_22_3[63:32])) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_31[63:32] == hx)) && ~Pluszero~LONGDOUBLE() == y) && ~bvor32(iy, ly) == 0bv32) && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, ULTIMATE.start___ieee754_atan2_~hy~0 : bv32 :: ~bvor32(~bvand32(1bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hy~0, 31bv32)), ~bvand32(2bv32, ~bvashr32(v_skolemized_q#valueAsBitvector_33[63:32], 30bv32))) == m && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, pi, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) [2019-11-15 23:59:01,085 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_359549a9-7231-4c78-bb07-d34b81499a07/bin/uautomizer/witness.graphml [2019-11-15 23:59:01,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:59:01,088 INFO L168 Benchmark]: Toolchain (without parser) took 58623.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.2 MB). Free memory was 953.7 MB in the beginning and 1.0 GB in the end (delta: -68.4 MB). Peak memory consumption was 129.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:01,088 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:59:01,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:01,089 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.25 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-15 23:59:01,090 INFO L168 Benchmark]: Boogie Preprocessor took 69.05 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.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:01,090 INFO L168 Benchmark]: RCFGBuilder took 38975.11 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: 75.0 MB). Peak memory consumption was 75.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:01,090 INFO L168 Benchmark]: TraceAbstraction took 18896.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -1.6 MB). Peak memory consumption was 67.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:01,091 INFO L168 Benchmark]: Witness Printer took 123.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:59:01,093 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 494.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -157.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.25 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. * Boogie Preprocessor took 69.05 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.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 38975.11 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: 75.0 MB). Peak memory consumption was 75.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18896.56 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -1.6 MB). Peak memory consumption was 67.1 MB. Max. memory is 11.5 GB. * Witness Printer took 123.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 256]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 147]: Loop Invariant [2019-11-15 23:59:01,113 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,114 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,115 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && ~Pluszero~LONGDOUBLE() == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant [2019-11-15 23:59:01,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,120 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,120 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,122 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,123 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,124 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,124 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_31[63:32] == hx)) && ~Pluszero~LONGDOUBLE() == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant [2019-11-15 23:59:01,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:01,126 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:01,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:01,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:01,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,127 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,128 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-11-15 23:59:01,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:01,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:01,129 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:01,130 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:01,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,130 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,131 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:01,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:01,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:01,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_22_3,QUANTIFIED] [2019-11-15 23:59:01,132 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,133 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_31,QUANTIFIED] [2019-11-15 23:59:01,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-11-15 23:59:01,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:01,134 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:01,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:01,135 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_33,QUANTIFIED] [2019-11-15 23:59:01,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,135 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-15 23:59:01,136 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x && (\exists v_skolemized_v_prenex_22_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_22_3[63:63], v_skolemized_v_prenex_22_3[62:52], v_skolemized_v_prenex_22_3[51:0]) && hy == v_skolemized_v_prenex_22_3[63:32])) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ix == ~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_31[63:32]))) && (\exists v_skolemized_q#valueAsBitvector_31 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_31[63:63], v_skolemized_q#valueAsBitvector_31[62:52], v_skolemized_q#valueAsBitvector_31[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_31[63:32] == hx)) && ~Pluszero~LONGDOUBLE() == y) && ~bvor32(iy, ly) == 0bv32) && (\exists v_skolemized_q#valueAsBitvector_33 : bv64, ULTIMATE.start___ieee754_atan2_~hy~0 : bv32 :: ~bvor32(~bvand32(1bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hy~0, 31bv32)), ~bvand32(2bv32, ~bvashr32(v_skolemized_q#valueAsBitvector_33[63:32], 30bv32))) == m && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_33[63:63], v_skolemized_q#valueAsBitvector_33[62:52], v_skolemized_q#valueAsBitvector_33[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, pi, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 1 error locations. Result: SAFE, OverallTime: 18.7s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 487 SDtfs, 1483 SDslu, 500 SDs, 0 SdLazy, 169 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 190 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 84 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 174 ConstructedInterpolants, 55 QuantifiedInterpolants, 28911 SizeOfPredicates, 47 NumberOfNonLiveVariables, 785 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...