./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0682b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0682b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a90ab4b5fd896d7fe8c91ee95d37e83b559389ba ................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0682b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a90ab4b5fd896d7fe8c91ee95d37e83b559389ba ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:02:55,907 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:02:55,911 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:02:55,923 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:02:55,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:02:55,925 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:02:55,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:02:55,929 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:02:55,931 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:02:55,932 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:02:55,933 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:02:55,933 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:02:55,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:02:55,935 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:02:55,937 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:02:55,938 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:02:55,939 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:02:55,941 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:02:55,944 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:02:55,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:02:55,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:02:55,948 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:02:55,951 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:02:55,952 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:02:55,952 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:02:55,953 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:02:55,955 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:02:55,956 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:02:55,957 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:02:55,958 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:02:55,959 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:02:55,960 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:02:55,960 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:02:55,960 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:02:55,961 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:02:55,963 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:02:55,963 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:02:55,979 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:02:55,979 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:02:55,980 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:02:55,981 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:02:55,981 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:02:55,981 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:02:55,982 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:02:55,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:02:55,982 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:02:55,982 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:02:55,982 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:02:55,982 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:02:55,983 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:02:55,983 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:02:55,983 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:02:55,983 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:02:55,983 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:02:55,984 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:02:55,985 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:02:55,985 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:02:55,986 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:02:55,986 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:02:55,986 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:02:55,986 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:02:55,986 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:02:55,987 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:02:55,988 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:02:55,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:02:55,988 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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 -> a90ab4b5fd896d7fe8c91ee95d37e83b559389ba [2019-01-12 09:02:56,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:02:56,043 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:02:56,052 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:02:56,053 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:02:56,054 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:02:56,055 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0682b_true-unreach-call.c [2019-01-12 09:02:56,114 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188a612fb/7e85be03469041e7b1a4a7cfaea2129f/FLAGf36edb20f [2019-01-12 09:02:56,566 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:02:56,567 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0682b_true-unreach-call.c [2019-01-12 09:02:56,576 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188a612fb/7e85be03469041e7b1a4a7cfaea2129f/FLAGf36edb20f [2019-01-12 09:02:56,913 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188a612fb/7e85be03469041e7b1a4a7cfaea2129f [2019-01-12 09:02:56,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:02:56,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:02:56,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:02:56,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:02:56,923 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:02:56,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:02:56" (1/1) ... [2019-01-12 09:02:56,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1271ba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:56, skipping insertion in model container [2019-01-12 09:02:56,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:02:56" (1/1) ... [2019-01-12 09:02:56,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:02:56,963 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:02:57,223 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:02:57,231 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:02:57,297 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:02:57,326 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:02:57,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:57 WrapperNode [2019-01-12 09:02:57,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:02:57,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:02:57,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:02:57,329 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:02:57,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:57" (1/1) ... [2019-01-12 09:02:57,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:57" (1/1) ... [2019-01-12 09:02:57,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:02:57,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:02:57,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:02:57,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:02:57,509 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:57" (1/1) ... [2019-01-12 09:02:57,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:57" (1/1) ... [2019-01-12 09:02:57,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:57" (1/1) ... [2019-01-12 09:02:57,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:57" (1/1) ... [2019-01-12 09:02:57,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:57" (1/1) ... [2019-01-12 09:02:57,560 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:57" (1/1) ... [2019-01-12 09:02:57,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:57" (1/1) ... [2019-01-12 09:02:57,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:02:57,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:02:57,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:02:57,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:02:57,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:02:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:02:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:02:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:02:57,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:02:57,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:02:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:02:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:02:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-01-12 09:02:57,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:02:59,511 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:02:59,511 INFO L286 CfgBuilder]: Removed 52 assue(true) statements. [2019-01-12 09:02:59,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:02:59 BoogieIcfgContainer [2019-01-12 09:02:59,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:02:59,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:02:59,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:02:59,518 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:02:59,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:02:56" (1/3) ... [2019-01-12 09:02:59,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa6b7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:02:59, skipping insertion in model container [2019-01-12 09:02:59,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:57" (2/3) ... [2019-01-12 09:02:59,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fa6b7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:02:59, skipping insertion in model container [2019-01-12 09:02:59,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:02:59" (3/3) ... [2019-01-12 09:02:59,523 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682b_true-unreach-call.c [2019-01-12 09:02:59,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:02:59,545 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:02:59,563 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:02:59,597 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:02:59,598 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:02:59,598 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:02:59,598 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:02:59,598 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:02:59,598 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:02:59,599 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:02:59,599 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:02:59,599 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:02:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-01-12 09:02:59,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:02:59,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:59,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:59,629 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:59,635 INFO L82 PathProgramCache]: Analyzing trace with hash -617567418, now seen corresponding path program 1 times [2019-01-12 09:02:59,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:02:59,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:02:59,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:02:59,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:59,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:02:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:02:59,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:59,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:02:59,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:02:59,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:02:59,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:02:59,814 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-01-12 09:02:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:59,850 INFO L93 Difference]: Finished difference Result 246 states and 412 transitions. [2019-01-12 09:02:59,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:02:59,852 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-01-12 09:02:59,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:59,867 INFO L225 Difference]: With dead ends: 246 [2019-01-12 09:02:59,868 INFO L226 Difference]: Without dead ends: 120 [2019-01-12 09:02:59,874 INFO L631 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-01-12 09:02:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-12 09:02:59,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-01-12 09:02:59,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-12 09:02:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2019-01-12 09:02:59,926 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 15 [2019-01-12 09:02:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:59,926 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2019-01-12 09:02:59,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:02:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2019-01-12 09:02:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:02:59,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:59,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:59,928 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:59,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:59,929 INFO L82 PathProgramCache]: Analyzing trace with hash -397782484, now seen corresponding path program 1 times [2019-01-12 09:02:59,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:02:59,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:02:59,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:02:59,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:59,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:03:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:03:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:03:00,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:03:00,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:03:00,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:03:00,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:03:00,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:03:00,097 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand 3 states. [2019-01-12 09:03:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:03:00,186 INFO L93 Difference]: Finished difference Result 229 states and 326 transitions. [2019-01-12 09:03:00,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:03:00,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-12 09:03:00,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:03:00,190 INFO L225 Difference]: With dead ends: 229 [2019-01-12 09:03:00,190 INFO L226 Difference]: Without dead ends: 120 [2019-01-12 09:03:00,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:03:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-12 09:03:00,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-01-12 09:03:00,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-12 09:03:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2019-01-12 09:03:00,206 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 18 [2019-01-12 09:03:00,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:03:00,206 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2019-01-12 09:03:00,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:03:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2019-01-12 09:03:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:03:00,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:03:00,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:03:00,210 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:03:00,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:03:00,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1006577033, now seen corresponding path program 1 times [2019-01-12 09:03:00,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:03:00,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:03:00,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:03:00,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:03:00,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:03:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:03:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:03:00,926 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:03:00,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:03:00 BoogieIcfgContainer [2019-01-12 09:03:00,982 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:03:00,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:03:00,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:03:00,983 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:03:00,983 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:02:59" (3/4) ... [2019-01-12 09:03:00,987 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:03:00,988 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:03:00,988 INFO L168 Benchmark]: Toolchain (without parser) took 4071.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 947.3 MB in the beginning and 944.0 MB in the end (delta: 3.3 MB). Peak memory consumption was 145.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:03:00,991 INFO L168 Benchmark]: CDTParser took 1.57 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:03:00,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.45 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:03:00,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 164.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:03:00,993 INFO L168 Benchmark]: Boogie Preprocessor took 87.37 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:03:00,994 INFO L168 Benchmark]: RCFGBuilder took 1932.76 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: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:03:00,995 INFO L168 Benchmark]: TraceAbstraction took 1467.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 944.0 MB in the end (delta: 113.6 MB). Peak memory consumption was 113.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:03:00,996 INFO L168 Benchmark]: Witness Printer took 5.56 ms. Allocated memory is still 1.2 GB. Free memory is still 944.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:03:01,002 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.57 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.45 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 931.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 164.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -197.6 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.37 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1932.76 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: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1467.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 944.0 MB in the end (delta: 113.6 MB). Peak memory consumption was 113.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.56 ms. Allocated memory is still 1.2 GB. Free memory is still 944.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 285]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 52, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 284. 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={-1: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] [L276] double x = -1.0 / 0.0; [L277] double y = __VERIFIER_nondet_double(); [L246] __int32_t hx, lx; VAL [aT_atan={1:0}, atanhi_atan={-1: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] [L248] ieee_double_shape_type ew_u; [L249] ew_u.value = (x) [L250] EXPR ew_u.parts.msw [L250] (hx) = ew_u.parts.msw [L251] EXPR ew_u.parts.lsw [L251] (lx) = ew_u.parts.lsw [L253] hx &= 0x7fffffff [L254] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L255] hx = 0x7ff00000 - hx [L256] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [aT_atan={1:0}, atanhi_atan={-1: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] [L279] EXPR isinf_double(x) && isfinite_double(y) [L260] __int32_t hx; VAL [aT_atan={1:0}, atanhi_atan={-1: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] [L262] ieee_double_shape_type gh_u; [L263] gh_u.value = (x) [L264] EXPR gh_u.parts.msw [L264] (hx) = gh_u.parts.msw [L266] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [aT_atan={1:0}, atanhi_atan={-1: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] [L279] EXPR isinf_double(x) && isfinite_double(y) VAL [aT_atan={1:0}, atanhi_atan={-1: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] [L279] COND TRUE isinf_double(x) && isfinite_double(y) && 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={-1: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={-1: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={-1: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={-1: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] [L281] double res = __ieee754_atan2(y, x); [L284] COND TRUE res != pi VAL [aT_atan={1:0}, atanhi_atan={-1: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] [L285] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-1: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, 124 locations, 1 error locations. UNSAFE Result, 1.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 343 SDtfs, 0 SDslu, 163 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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-0ed9222-m [2019-01-12 09:03:03,395 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:03:03,397 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:03:03,409 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:03:03,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:03:03,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:03:03,412 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:03:03,414 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:03:03,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:03:03,417 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:03:03,418 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:03:03,419 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:03:03,420 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:03:03,421 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:03:03,423 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:03:03,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:03:03,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:03:03,427 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:03:03,429 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:03:03,431 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:03:03,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:03:03,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:03:03,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:03:03,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:03:03,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:03:03,443 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:03:03,446 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:03:03,447 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:03:03,447 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:03:03,448 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:03:03,449 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:03:03,453 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:03:03,454 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:03:03,454 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:03:03,455 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:03:03,458 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:03:03,458 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:03:03,486 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:03:03,486 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:03:03,488 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:03:03,491 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:03:03,491 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:03:03,492 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:03:03,492 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:03:03,492 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:03:03,492 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:03:03,492 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:03:03,492 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:03:03,493 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:03:03,493 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:03:03,493 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:03:03,493 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:03:03,493 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:03:03,493 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:03:03,494 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:03:03,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:03:03,497 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:03:03,497 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:03:03,497 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:03:03,497 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:03:03,498 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:03:03,498 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:03:03,498 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:03:03,498 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:03:03,499 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:03:03,500 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:03:03,501 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:03:03,501 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__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 -> a90ab4b5fd896d7fe8c91ee95d37e83b559389ba [2019-01-12 09:03:03,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:03:03,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:03:03,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:03:03,584 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:03:03,585 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:03:03,585 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0682b_true-unreach-call.c [2019-01-12 09:03:03,654 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d192ae71/0178d893fa2646ecba3be9b34b1d41fb/FLAG3b82fea5c [2019-01-12 09:03:04,163 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:03:04,165 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0682b_true-unreach-call.c [2019-01-12 09:03:04,175 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d192ae71/0178d893fa2646ecba3be9b34b1d41fb/FLAG3b82fea5c [2019-01-12 09:03:04,503 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d192ae71/0178d893fa2646ecba3be9b34b1d41fb [2019-01-12 09:03:04,507 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:03:04,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:03:04,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:03:04,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:03:04,515 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:03:04,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:03:04" (1/1) ... [2019-01-12 09:03:04,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1a718d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:04, skipping insertion in model container [2019-01-12 09:03:04,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:03:04" (1/1) ... [2019-01-12 09:03:04,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:03:04,572 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:03:04,946 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:03:04,959 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:03:05,033 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:03:05,170 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:03:05,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:05 WrapperNode [2019-01-12 09:03:05,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:03:05,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:03:05,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:03:05,172 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:03:05,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:05" (1/1) ... [2019-01-12 09:03:05,202 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:05" (1/1) ... [2019-01-12 09:03:05,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:03:05,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:03:05,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:03:05,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:03:05,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:05" (1/1) ... [2019-01-12 09:03:05,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:05" (1/1) ... [2019-01-12 09:03:05,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:05" (1/1) ... [2019-01-12 09:03:05,287 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:05" (1/1) ... [2019-01-12 09:03:05,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:05" (1/1) ... [2019-01-12 09:03:05,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:05" (1/1) ... [2019-01-12 09:03:05,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:05" (1/1) ... [2019-01-12 09:03:05,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:03:05,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:03:05,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:03:05,373 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:03:05,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:03:05,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 09:03:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:03:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:03:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-01-12 09:03:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:03:05,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:03:05,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:03:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:03:05,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:03:06,024 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:06,124 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:06,206 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:06,297 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:06,367 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:06,504 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:06,578 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:07,193 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:07,252 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:28,373 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:28,395 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:28,444 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:28,478 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:29,390 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:29,417 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:45,996 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:46,044 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:47,493 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:03:47,493 INFO L286 CfgBuilder]: Removed 52 assue(true) statements. [2019-01-12 09:03:47,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:03:47 BoogieIcfgContainer [2019-01-12 09:03:47,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:03:47,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:03:47,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:03:47,503 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:03:47,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:03:04" (1/3) ... [2019-01-12 09:03:47,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f552cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:03:47, skipping insertion in model container [2019-01-12 09:03:47,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:03:05" (2/3) ... [2019-01-12 09:03:47,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f552cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:03:47, skipping insertion in model container [2019-01-12 09:03:47,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:03:47" (3/3) ... [2019-01-12 09:03:47,510 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682b_true-unreach-call.c [2019-01-12 09:03:47,524 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:03:47,535 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:03:47,559 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:03:47,602 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:03:47,604 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:03:47,604 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:03:47,604 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:03:47,604 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:03:47,605 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:03:47,605 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:03:47,607 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:03:47,607 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:03:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-01-12 09:03:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:03:47,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:03:47,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:03:47,639 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:03:47,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:03:47,648 INFO L82 PathProgramCache]: Analyzing trace with hash -617567418, now seen corresponding path program 1 times [2019-01-12 09:03:47,655 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:03:47,656 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 09:03:47,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 09:03:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:03:48,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:03:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:03:48,081 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:03:48,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:03:48,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:03:48,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:03:48,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:03:48,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:03:48,121 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-01-12 09:03:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:03:48,156 INFO L93 Difference]: Finished difference Result 246 states and 412 transitions. [2019-01-12 09:03:48,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:03:48,158 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-01-12 09:03:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:03:48,174 INFO L225 Difference]: With dead ends: 246 [2019-01-12 09:03:48,174 INFO L226 Difference]: Without dead ends: 120 [2019-01-12 09:03:48,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-01-12 09:03:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-12 09:03:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-01-12 09:03:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-12 09:03:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2019-01-12 09:03:48,230 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 15 [2019-01-12 09:03:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:03:48,230 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2019-01-12 09:03:48,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:03:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2019-01-12 09:03:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:03:48,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:03:48,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:03:48,232 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:03:48,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:03:48,233 INFO L82 PathProgramCache]: Analyzing trace with hash -397782484, now seen corresponding path program 1 times [2019-01-12 09:03:48,234 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:03:48,234 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:03:48,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:03:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:03:48,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:03:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:03:48,563 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:03:48,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:03:48,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:03:48,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:03:48,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:03:48,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:03:48,582 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand 3 states. [2019-01-12 09:03:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:03:48,638 INFO L93 Difference]: Finished difference Result 229 states and 326 transitions. [2019-01-12 09:03:48,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:03:48,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-12 09:03:48,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:03:48,641 INFO L225 Difference]: With dead ends: 229 [2019-01-12 09:03:48,642 INFO L226 Difference]: Without dead ends: 120 [2019-01-12 09:03:48,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:03:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-12 09:03:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-01-12 09:03:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-12 09:03:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2019-01-12 09:03:48,661 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 18 [2019-01-12 09:03:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:03:48,662 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2019-01-12 09:03:48,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:03:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2019-01-12 09:03:48,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:03:48,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:03:48,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:03:48,664 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:03:48,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:03:48,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1006577033, now seen corresponding path program 1 times [2019-01-12 09:03:48,665 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:03:48,665 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:03:48,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:03:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:03:49,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:03:49,668 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:03:50,241 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-12 09:03:50,419 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:03:50,432 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:03:50,439 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:03:50,441 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:03:50,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2019-01-12 09:03:50,637 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-01-12 09:03:50,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:03:50,699 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:03:50,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2019-01-12 09:03:50,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:03:50,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 26 [2019-01-12 09:03:50,753 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:03:51,032 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:03:51,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2019-01-12 09:03:51,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:03:51,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2019-01-12 09:03:51,163 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:03:51,287 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:03:51,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-12 09:03:51,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:03:51,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2019-01-12 09:03:51,353 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:03:51,358 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:03:51,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:03:51,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-12 09:03:51,434 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:100, output treesize:57 [2019-01-12 09:03:54,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:03:54,183 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:03:54,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:03:54,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 09:03:54,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 09:03:54,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 09:03:54,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2019-01-12 09:03:54,206 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand 12 states. [2019-01-12 09:03:55,063 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-12 09:03:56,021 WARN L181 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-12 09:03:56,439 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-12 09:03:57,274 WARN L181 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-12 09:04:00,221 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-12 09:04:05,449 WARN L181 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 88 [2019-01-12 09:04:08,257 WARN L181 SmtUtils]: Spent 2.66 s on a formula simplification that was a NOOP. DAG size: 93 [2019-01-12 09:04:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:04:11,847 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2019-01-12 09:04:12,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 09:04:12,232 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-12 09:04:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:04:12,234 INFO L225 Difference]: With dead ends: 185 [2019-01-12 09:04:12,234 INFO L226 Difference]: Without dead ends: 100 [2019-01-12 09:04:12,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=111, Invalid=266, Unknown=3, NotChecked=0, Total=380 [2019-01-12 09:04:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-12 09:04:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2019-01-12 09:04:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 09:04:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2019-01-12 09:04:12,250 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 22 [2019-01-12 09:04:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:04:12,250 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2019-01-12 09:04:12,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 09:04:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2019-01-12 09:04:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:04:12,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:04:12,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:04:12,253 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:04:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:04:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash 906713717, now seen corresponding path program 1 times [2019-01-12 09:04:12,254 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:04:12,254 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 09:04:12,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:04:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:04:12,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:04:12,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:04:12,843 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:04:12,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:04:12,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:04:12,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:04:12,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:04:12,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:04:12,857 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand 7 states. [2019-01-12 09:04:13,249 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-12 09:04:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:04:15,834 INFO L93 Difference]: Finished difference Result 148 states and 196 transitions. [2019-01-12 09:04:15,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:04:15,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-12 09:04:15,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:04:15,838 INFO L225 Difference]: With dead ends: 148 [2019-01-12 09:04:15,840 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 09:04:15,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:04:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 09:04:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-12 09:04:15,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 09:04:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2019-01-12 09:04:15,870 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 27 [2019-01-12 09:04:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:04:15,871 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2019-01-12 09:04:15,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:04:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2019-01-12 09:04:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 09:04:15,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:04:15,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:04:15,872 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:04:15,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:04:15,874 INFO L82 PathProgramCache]: Analyzing trace with hash -188522611, now seen corresponding path program 1 times [2019-01-12 09:04:15,875 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:04:15,875 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 09:04:15,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:04:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:04:16,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:04:16,651 WARN L181 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 09:04:16,811 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 09:04:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:04:16,816 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:04:16,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:04:16,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:04:16,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:04:16,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:04:16,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:04:16,831 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand 5 states. [2019-01-12 09:04:17,275 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 09:04:17,688 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 09:04:20,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:04:20,863 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2019-01-12 09:04:20,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:04:20,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-01-12 09:04:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:04:20,865 INFO L225 Difference]: With dead ends: 89 [2019-01-12 09:04:20,865 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 09:04:20,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:04:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 09:04:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-12 09:04:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 09:04:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2019-01-12 09:04:20,883 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 28 [2019-01-12 09:04:20,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:04:20,883 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2019-01-12 09:04:20,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:04:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2019-01-12 09:04:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 09:04:20,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:04:20,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:04:20,887 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:04:20,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:04:20,887 INFO L82 PathProgramCache]: Analyzing trace with hash -953381006, now seen corresponding path program 1 times [2019-01-12 09:04:20,887 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:04:20,888 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 09:04:20,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:04:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:04:21,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:04:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:04:21,382 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:04:21,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:04:21,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:04:21,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:04:21,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:04:21,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:04:21,398 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand 7 states. [2019-01-12 09:04:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:04:24,562 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2019-01-12 09:04:24,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:04:24,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-01-12 09:04:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:04:24,567 INFO L225 Difference]: With dead ends: 89 [2019-01-12 09:04:24,569 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 09:04:24,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:04:24,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 09:04:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-12 09:04:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 09:04:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2019-01-12 09:04:24,595 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 28 [2019-01-12 09:04:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:04:24,596 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2019-01-12 09:04:24,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:04:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2019-01-12 09:04:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 09:04:24,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:04:24,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:04:24,599 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:04:24,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:04:24,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1555968818, now seen corresponding path program 1 times [2019-01-12 09:04:24,601 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:04:24,601 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-01-12 09:04:24,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:04:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:04:24,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:04:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:04:25,158 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:04:25,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:04:25,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:04:25,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:04:25,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:04:25,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:04:25,179 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 8 states. [2019-01-12 09:04:32,299 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 48 [2019-01-12 09:04:32,458 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-12 09:04:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:04:35,466 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2019-01-12 09:04:35,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:04:35,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-12 09:04:35,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:04:35,468 INFO L225 Difference]: With dead ends: 158 [2019-01-12 09:04:35,468 INFO L226 Difference]: Without dead ends: 94 [2019-01-12 09:04:35,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=53, Invalid=102, Unknown=1, NotChecked=0, Total=156 [2019-01-12 09:04:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-12 09:04:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 79. [2019-01-12 09:04:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-12 09:04:35,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions. [2019-01-12 09:04:35,485 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 29 [2019-01-12 09:04:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:04:35,486 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 96 transitions. [2019-01-12 09:04:35,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:04:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions. [2019-01-12 09:04:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-12 09:04:35,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:04:35,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:04:35,487 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:04:35,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:04:35,488 INFO L82 PathProgramCache]: Analyzing trace with hash -256764885, now seen corresponding path program 1 times [2019-01-12 09:04:35,488 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:04:35,488 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-01-12 09:04:35,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:04:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:04:36,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:04:36,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:04:36,651 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:04:36,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:04:36,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:04:36,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:04:36,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:04:36,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:04:36,669 INFO L87 Difference]: Start difference. First operand 79 states and 96 transitions. Second operand 8 states. [2019-01-12 09:04:47,487 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-12 09:04:48,690 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 48 [2019-01-12 09:04:50,856 WARN L181 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 49 [2019-01-12 09:04:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:04:50,859 INFO L93 Difference]: Finished difference Result 79 states and 96 transitions. [2019-01-12 09:04:50,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:04:50,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-01-12 09:04:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:04:50,860 INFO L225 Difference]: With dead ends: 79 [2019-01-12 09:04:50,860 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:04:50,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=53, Invalid=102, Unknown=1, NotChecked=0, Total=156 [2019-01-12 09:04:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:04:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:04:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:04:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:04:50,861 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-01-12 09:04:50,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:04:50,861 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:04:50,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:04:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:04:50,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:04:50,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:04:51,530 WARN L181 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-12 09:04:52,063 WARN L181 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-12 09:04:52,843 WARN L181 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 91 [2019-01-12 09:04:53,237 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-12 09:04:53,241 INFO L448 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:04:53,241 INFO L448 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:04:53,242 INFO L444 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-01-12 09:04:53,242 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:04:53,242 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 09:04:53,242 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-01-12 09:04:53,242 INFO L448 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-01-12 09:04:53,243 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 285) no Hoare annotation was computed. [2019-01-12 09:04:53,243 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-01-12 09:04:53,243 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-01-12 09:04:53,243 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-01-12 09:04:53,243 INFO L448 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-01-12 09:04:53,243 INFO L448 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-01-12 09:04:53,243 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 09:04:53,243 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-01-12 09:04:53,244 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:04:53,246 INFO L448 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-01-12 09:04:53,246 INFO L448 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:04:53,246 INFO L448 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-01-12 09:04:53,246 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-01-12 09:04:53,246 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:04:53,246 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:04:53,246 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 09:04:53,247 INFO L444 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (= .cse0 ULTIMATE.start_main_~x~0) (exists ((ULTIMATE.start___ieee754_atan2_~hy~0 (_ BitVec 32)) (v_prenex_72 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_72) ((_ extract 62 52) v_prenex_72) ((_ extract 51 0) v_prenex_72)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~m~0 (bvor (bvand (_ bv1 32) (bvashr ULTIMATE.start___ieee754_atan2_~hy~0 (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) v_prenex_72) (_ bv30 32))))))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (exists ((v_prenex_72 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_72) ((_ extract 62 52) v_prenex_72) ((_ extract 51 0) v_prenex_72)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) v_prenex_72)))) (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (= (fp.add roundNearestTiesToEven ~pi~0 .cse1) |ULTIMATE.start___ieee754_atan2_#res|) (= ~tiny_atan2~0 .cse1))) [2019-01-12 09:04:53,247 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-01-12 09:04:53,247 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-01-12 09:04:53,247 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:04:53,247 INFO L448 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-01-12 09:04:53,247 INFO L444 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-01-12 09:04:53,248 INFO L448 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:04:53,248 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-01-12 09:04:53,248 INFO L448 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-01-12 09:04:53,248 INFO L448 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-01-12 09:04:53,248 INFO L448 ceAbstractionStarter]: For program point L279-2(lines 279 288) no Hoare annotation was computed. [2019-01-12 09:04:53,248 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-01-12 09:04:53,248 INFO L448 ceAbstractionStarter]: For program point L279-4(lines 279 288) no Hoare annotation was computed. [2019-01-12 09:04:53,248 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-01-12 09:04:53,249 INFO L444 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~y~0) (exists ((v_prenex_67 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0) (= ((_ extract 63 32) v_prenex_67) ULTIMATE.start_isfinite_double_~hx~3))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (exists ((v_prenex_67 (_ BitVec 64))) (and (= |ULTIMATE.start_isfinite_double_#res| (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_67)) (_ bv2148532224 32)) (_ bv31 32))) (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0))) (fp.gt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (exists ((v_prenex_71 (_ BitVec 64))) (and (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_71)) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32))) (= (fp ((_ extract 63 63) v_prenex_71) ((_ extract 62 52) v_prenex_71) ((_ extract 51 0) v_prenex_71)) ULTIMATE.start___ieee754_atan2_~y))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))))) [2019-01-12 09:04:53,249 INFO L448 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-01-12 09:04:53,249 INFO L448 ceAbstractionStarter]: For program point L247-1(lines 247 252) no Hoare annotation was computed. [2019-01-12 09:04:53,249 INFO L444 ceAbstractionStarter]: At program point L247-2(lines 247 252) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~x~0) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2019-01-12 09:04:53,249 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 09:04:53,249 INFO L448 ceAbstractionStarter]: For program point L247-3(lines 247 252) no Hoare annotation was computed. [2019-01-12 09:04:53,249 INFO L448 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-01-12 09:04:53,249 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-01-12 09:04:53,249 INFO L448 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-01-12 09:04:53,249 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-01-12 09:04:53,250 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-01-12 09:04:53,250 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-01-12 09:04:53,254 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-01-12 09:04:53,254 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-01-12 09:04:53,254 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:04:53,254 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-01-12 09:04:53,254 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:04:53,254 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-01-12 09:04:53,254 INFO L448 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:04:53,255 INFO L444 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-01-12 09:04:53,255 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:04:53,255 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 287) no Hoare annotation was computed. [2019-01-12 09:04:53,255 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-01-12 09:04:53,255 INFO L448 ceAbstractionStarter]: For program point L285(line 285) no Hoare annotation was computed. [2019-01-12 09:04:53,255 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-01-12 09:04:53,255 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 09:04:53,255 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-01-12 09:04:53,255 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-01-12 09:04:53,256 INFO L444 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~y~0) (exists ((v_prenex_67 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0) (= ((_ extract 63 32) v_prenex_67) ULTIMATE.start_isfinite_double_~hx~3))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (exists ((v_prenex_67 (_ BitVec 64))) (and (= |ULTIMATE.start_isfinite_double_#res| (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_67)) (_ bv2148532224 32)) (_ bv31 32))) (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0))) (exists ((v_prenex_69 (_ BitVec 64)) (v_prenex_68 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) v_prenex_69)) (.cse1 ((_ extract 63 32) v_prenex_68))) (and (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) .cse1)) (= .cse2 ULTIMATE.start___ieee754_atan2_~lx~0) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_68) ((_ extract 62 52) v_prenex_68) ((_ extract 51 0) v_prenex_68))) (= ((_ extract 31 0) v_prenex_68) .cse2) (= .cse1 ((_ extract 63 32) v_prenex_69))))) (exists ((v_prenex_71 (_ BitVec 64))) (and (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_71)) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32))) (= (fp ((_ extract 63 63) v_prenex_71) ((_ extract 62 52) v_prenex_71) ((_ extract 51 0) v_prenex_71)) ULTIMATE.start___ieee754_atan2_~y))) (fp.gt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (exists ((v_prenex_73 (_ BitVec 64))) (and (= ((_ extract 63 32) v_prenex_73) ULTIMATE.start___ieee754_atan2_~hx~1) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_73) ((_ extract 62 52) v_prenex_73) ((_ extract 51 0) v_prenex_73))))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))))) [2019-01-12 09:04:53,256 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:04:53,256 INFO L448 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-01-12 09:04:53,256 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:04:53,256 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-12 09:04:53,256 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:04:53,256 INFO L448 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:04:53,256 INFO L448 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:04:53,257 INFO L448 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:04:53,257 INFO L448 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-01-12 09:04:53,257 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-01-12 09:04:53,257 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-01-12 09:04:53,257 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:04:53,257 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:04:53,257 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:04:53,257 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:04:53,257 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:04:53,257 INFO L448 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:04:53,258 INFO L448 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:04:53,258 INFO L448 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:04:53,259 INFO L448 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:04:53,259 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:04:53,259 INFO L444 ceAbstractionStarter]: At program point L256(lines 245 257) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~x~0) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2019-01-12 09:04:53,259 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 09:04:53,259 INFO L451 ceAbstractionStarter]: At program point L290(lines 269 291) the Hoare annotation is: true [2019-01-12 09:04:53,259 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-01-12 09:04:53,259 INFO L444 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-01-12 09:04:53,259 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 09:04:53,259 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-01-12 09:04:53,259 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-01-12 09:04:53,260 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:04:53,260 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-01-12 09:04:53,260 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 261 265) no Hoare annotation was computed. [2019-01-12 09:04:53,261 INFO L444 ceAbstractionStarter]: At program point L261-2(lines 261 265) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~y~0) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2019-01-12 09:04:53,261 INFO L448 ceAbstractionStarter]: For program point L261-3(lines 261 265) no Hoare annotation was computed. [2019-01-12 09:04:53,261 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-01-12 09:04:53,261 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-01-12 09:04:53,261 INFO L444 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-01-12 09:04:53,261 INFO L444 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-01-12 09:04:53,261 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-01-12 09:04:53,261 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-01-12 09:04:53,261 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-01-12 09:04:53,262 INFO L448 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-01-12 09:04:53,262 INFO L448 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-01-12 09:04:53,262 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 09:04:53,262 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-01-12 09:04:53,262 INFO L448 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-01-12 09:04:53,262 INFO L444 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-01-12 09:04:53,262 INFO L448 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-01-12 09:04:53,262 INFO L448 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-01-12 09:04:53,262 INFO L448 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-01-12 09:04:53,262 INFO L444 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-01-12 09:04:53,262 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-01-12 09:04:53,263 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-01-12 09:04:53,263 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:04:53,263 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 09:04:53,263 INFO L444 ceAbstractionStarter]: At program point L266(lines 259 267) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~y~0) (exists ((v_prenex_67 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0) (= ((_ extract 63 32) v_prenex_67) ULTIMATE.start_isfinite_double_~hx~3))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (exists ((v_prenex_67 (_ BitVec 64))) (and (= |ULTIMATE.start_isfinite_double_#res| (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_67)) (_ bv2148532224 32)) (_ bv31 32))) (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2019-01-12 09:04:53,263 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:04:53,263 INFO L444 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-01-12 09:04:53,284 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,285 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,287 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,287 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,287 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,293 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,294 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,295 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,296 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,296 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,307 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,308 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,308 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,309 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,309 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,309 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,309 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,312 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,314 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,314 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,315 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,315 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,320 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,321 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,322 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,322 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,322 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,322 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,324 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,329 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,329 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,330 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,330 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,331 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,332 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,335 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,336 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,336 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,341 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,342 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,342 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,342 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,343 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,343 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,345 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,345 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,355 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,355 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,356 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,356 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,356 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,356 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,357 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,357 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,361 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,363 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,363 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,364 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,364 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,365 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:53,370 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,370 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:53,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:53,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,380 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,381 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,381 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,382 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,389 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,389 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,389 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,394 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,395 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,397 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:53,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,399 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,399 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,399 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,399 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:53,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:53,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,400 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,401 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,405 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,405 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,406 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,406 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,413 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,413 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,413 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,413 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,415 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,416 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,417 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,417 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,418 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,419 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,419 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-01-12 09:04:53,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,425 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,427 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,427 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,430 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,431 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,431 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,431 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,431 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,434 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,434 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,436 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,436 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-01-12 09:04:53,438 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,439 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,439 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,439 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,440 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,440 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,440 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,440 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,441 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,441 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:04:53 BoogieIcfgContainer [2019-01-12 09:04:53,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:04:53,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:04:53,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:04:53,450 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:04:53,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:03:47" (3/4) ... [2019-01-12 09:04:53,458 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:04:53,488 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2019-01-12 09:04:53,489 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-12 09:04:53,490 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:04:53,528 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) [2019-01-12 09:04:53,528 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && ~fp.gt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_prenex_71 : bv64 :: !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_71[63:32]), 2148532224bv32), 31bv32) == 0bv32) && ~fp~LONGDOUBLE(v_prenex_71[63:63], v_prenex_71[62:52], v_prenex_71[51:0]) == y)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) [2019-01-12 09:04:53,529 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && (\exists v_prenex_69 : bv64, v_prenex_68 : bv64 :: (((ix == ~bvand32(2147483647bv32, v_prenex_68[63:32]) && v_prenex_69[31:0] == lx) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_68[63:63], v_prenex_68[62:52], v_prenex_68[51:0])) && v_prenex_68[31:0] == v_prenex_69[31:0]) && v_prenex_68[63:32] == v_prenex_69[63:32])) && (\exists v_prenex_71 : bv64 :: !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_71[63:32]), 2148532224bv32), 31bv32) == 0bv32) && ~fp~LONGDOUBLE(v_prenex_71[63:63], v_prenex_71[62:52], v_prenex_71[51:0]) == y)) && ~fp.gt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_prenex_73 : bv64 :: v_prenex_73[63:32] == hx && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_73[63:63], v_prenex_73[62:52], v_prenex_73[51:0]))) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) [2019-01-12 09:04:53,529 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && (\exists ULTIMATE.start___ieee754_atan2_~hy~0 : bv32, v_prenex_72 : bv64 :: ~fp~LONGDOUBLE(v_prenex_72[63:63], v_prenex_72[62:52], v_prenex_72[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && m == ~bvor32(~bvand32(1bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hy~0, 31bv32)), ~bvand32(2bv32, ~bvashr32(v_prenex_72[63:32], 30bv32))))) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && (\exists v_prenex_72 : bv64 :: ~fp~LONGDOUBLE(v_prenex_72[63:63], v_prenex_72[62:52], v_prenex_72[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && hx == v_prenex_72[63:32])) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && ~fp.add~DOUBLE(~roundNearestTiesToEven, pi, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) [2019-01-12 09:04:53,626 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:04:53,626 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:04:53,628 INFO L168 Benchmark]: Toolchain (without parser) took 109120.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.3 MB). Free memory was 951.3 MB in the beginning and 859.7 MB in the end (delta: 91.7 MB). Peak memory consumption was 292.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:53,629 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:04:53,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:53,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:53,630 INFO L168 Benchmark]: Boogie Preprocessor took 103.57 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:53,631 INFO L168 Benchmark]: RCFGBuilder took 42123.73 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: 74.3 MB). Peak memory consumption was 74.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:53,631 INFO L168 Benchmark]: TraceAbstraction took 65951.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.0 GB in the beginning and 874.5 MB in the end (delta: 159.4 MB). Peak memory consumption was 225.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:53,631 INFO L168 Benchmark]: Witness Printer took 176.25 ms. Allocated memory is still 1.2 GB. Free memory was 874.5 MB in the beginning and 859.7 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:53,637 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 661.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.57 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: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 42123.73 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: 74.3 MB). Peak memory consumption was 74.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 65951.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.0 GB in the beginning and 874.5 MB in the end (delta: 159.4 MB). Peak memory consumption was 225.5 MB. Max. memory is 11.5 GB. * Witness Printer took 176.25 ms. Allocated memory is still 1.2 GB. Free memory was 874.5 MB in the beginning and 859.7 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - 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_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - 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_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,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 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 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 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 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_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,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_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,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_prenex_73,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,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_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,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_prenex_73,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,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 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 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_prenex_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,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[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] - 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_prenex_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,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_prenex_72,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 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_prenex_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,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[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] - 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_prenex_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,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_prenex_72,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 Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 285]: 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-01-12 09:04:53,654 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,654 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,655 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,655 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,655 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,656 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,656 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,662 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,662 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,663 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,663 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,663 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,666 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,667 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && ~fp.gt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_prenex_71 : bv64 :: !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_71[63:32]), 2148532224bv32), 31bv32) == 0bv32) && ~fp~LONGDOUBLE(v_prenex_71[63:63], v_prenex_71[62:52], v_prenex_71[51:0]) == y)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - 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: 259]: Loop Invariant [2019-01-12 09:04:53,668 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,669 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,672 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,673 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,673 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,673 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,679 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,679 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,679 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,680 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,680 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,680 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,680 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,680 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,680 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,680 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,681 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,681 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 247]: Loop Invariant [2019-01-12 09:04:53,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 245]: Loop Invariant [2019-01-12 09:04:53,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,689 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,690 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,690 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,690 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,690 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant [2019-01-12 09:04:53,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,693 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,693 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,693 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,694 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:53,701 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,701 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:53,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:53,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,705 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,706 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,706 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,706 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,711 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,712 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,714 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,714 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,715 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:53,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:53,719 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,720 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:53,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:53,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:53,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,722 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:53,724 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,724 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,724 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,725 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:53,725 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && (\exists v_prenex_69 : bv64, v_prenex_68 : bv64 :: (((ix == ~bvand32(2147483647bv32, v_prenex_68[63:32]) && v_prenex_69[31:0] == lx) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_68[63:63], v_prenex_68[62:52], v_prenex_68[51:0])) && v_prenex_68[31:0] == v_prenex_69[31:0]) && v_prenex_68[63:32] == v_prenex_69[63:32])) && (\exists v_prenex_71 : bv64 :: !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_71[63:32]), 2148532224bv32), 31bv32) == 0bv32) && ~fp~LONGDOUBLE(v_prenex_71[63:63], v_prenex_71[62:52], v_prenex_71[51:0]) == y)) && ~fp.gt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && (\exists v_prenex_73 : bv64 :: v_prenex_73[63:32] == hx && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_73[63:63], v_prenex_73[62:52], v_prenex_73[51:0]))) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 261]: Loop Invariant [2019-01-12 09:04:53,726 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,726 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,727 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,728 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,728 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,728 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,729 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,729 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && x == y) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 142]: Loop Invariant [2019-01-12 09:04:53,729 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,729 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,730 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,730 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,730 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-01-12 09:04:53,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,731 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,731 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,732 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,738 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,739 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,741 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,741 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,742 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,742 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,742 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,743 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,743 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-01-12 09:04:53,743 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,749 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,750 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,750 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_72,QUANTIFIED] [2019-01-12 09:04:53,750 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,750 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,751 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,751 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:53,751 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && (\exists ULTIMATE.start___ieee754_atan2_~hy~0 : bv32, v_prenex_72 : bv64 :: ~fp~LONGDOUBLE(v_prenex_72[63:63], v_prenex_72[62:52], v_prenex_72[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && m == ~bvor32(~bvand32(1bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hy~0, 31bv32)), ~bvand32(2bv32, ~bvashr32(v_prenex_72[63:32], 30bv32))))) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && (\exists v_prenex_72 : bv64 :: ~fp~LONGDOUBLE(v_prenex_72[63:63], v_prenex_72[62:52], v_prenex_72[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) && hx == v_prenex_72[63:32])) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && ~fp.add~DOUBLE(~roundNearestTiesToEven, pi, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. SAFE Result, 65.6s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 52.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 810 SDtfs, 1467 SDslu, 1673 SDs, 0 SdLazy, 252 SolverSat, 31 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 24.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 218 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 31.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 30 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 29 NumberOfFragments, 469 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 98 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 190 ConstructedInterpolants, 54 QuantifiedInterpolants, 71252 SizeOfPredicates, 51 NumberOfNonLiveVariables, 1370 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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...