./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0680b_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_0680b_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 6672245f6516202a276f3cff39e39bf6cfceaf3d .................................................................................................................................................................................................................................................................................................................... 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_0680b_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 6672245f6516202a276f3cff39e39bf6cfceaf3d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:01:49,181 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:01:49,183 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:01:49,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:01:49,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:01:49,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:01:49,203 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:01:49,205 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:01:49,207 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:01:49,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:01:49,209 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:01:49,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:01:49,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:01:49,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:01:49,213 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:01:49,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:01:49,214 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:01:49,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:01:49,219 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:01:49,221 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:01:49,222 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:01:49,224 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:01:49,226 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:01:49,227 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:01:49,227 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:01:49,228 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:01:49,229 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:01:49,231 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:01:49,231 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:01:49,233 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:01:49,233 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:01:49,234 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:01:49,234 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:01:49,234 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:01:49,235 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:01:49,237 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:01:49,237 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:01:49,252 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:01:49,253 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:01:49,254 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:01:49,254 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:01:49,255 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:01:49,255 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:01:49,256 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:01:49,256 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:01:49,256 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:01:49,256 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:01:49,256 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:01:49,256 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:01:49,257 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:01:49,257 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:01:49,257 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:01:49,257 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:01:49,257 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:01:49,258 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:01:49,259 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:01:49,260 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:01:49,260 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:01:49,260 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:01:49,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:01:49,261 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:01:49,261 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:01:49,261 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:01:49,261 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:01:49,261 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:01:49,261 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 -> 6672245f6516202a276f3cff39e39bf6cfceaf3d [2019-01-12 09:01:49,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:01:49,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:01:49,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:01:49,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:01:49,351 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:01:49,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0680b_true-unreach-call.c [2019-01-12 09:01:49,421 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce82fa75b/2db52fb83e2e452a8efc62580a95f874/FLAG25f77fc59 [2019-01-12 09:01:49,879 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:01:49,881 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0680b_true-unreach-call.c [2019-01-12 09:01:49,892 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce82fa75b/2db52fb83e2e452a8efc62580a95f874/FLAG25f77fc59 [2019-01-12 09:01:50,230 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce82fa75b/2db52fb83e2e452a8efc62580a95f874 [2019-01-12 09:01:50,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:01:50,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:01:50,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:01:50,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:01:50,243 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:01:50,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:01:50" (1/1) ... [2019-01-12 09:01:50,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dae10eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:50, skipping insertion in model container [2019-01-12 09:01:50,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:01:50" (1/1) ... [2019-01-12 09:01:50,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:01:50,300 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:01:50,651 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:01:50,662 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:01:50,738 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:01:50,762 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:01:50,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:50 WrapperNode [2019-01-12 09:01:50,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:01:50,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:01:50,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:01:50,764 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:01:50,838 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:01:50" (1/1) ... [2019-01-12 09:01:50,858 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:01:50" (1/1) ... [2019-01-12 09:01:50,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:01:50,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:01:50,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:01:50,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:01:50,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:50" (1/1) ... [2019-01-12 09:01:50,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:50" (1/1) ... [2019-01-12 09:01:50,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:50" (1/1) ... [2019-01-12 09:01:50,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:50" (1/1) ... [2019-01-12 09:01:50,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:50" (1/1) ... [2019-01-12 09:01:50,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:50" (1/1) ... [2019-01-12 09:01:50,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:50" (1/1) ... [2019-01-12 09:01:50,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:01:51,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:01:51,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:01:51,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:01:51,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:50" (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:01:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:01:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:01:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:01:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:01:51,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:01:51,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:01:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:01:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-01-12 09:01:51,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:01:52,394 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:01:52,394 INFO L286 CfgBuilder]: Removed 44 assue(true) statements. [2019-01-12 09:01:52,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:01:52 BoogieIcfgContainer [2019-01-12 09:01:52,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:01:52,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:01:52,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:01:52,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:01:52,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:01:50" (1/3) ... [2019-01-12 09:01:52,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc60e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:01:52, skipping insertion in model container [2019-01-12 09:01:52,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:50" (2/3) ... [2019-01-12 09:01:52,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc60e43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:01:52, skipping insertion in model container [2019-01-12 09:01:52,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:01:52" (3/3) ... [2019-01-12 09:01:52,403 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0680b_true-unreach-call.c [2019-01-12 09:01:52,414 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:01:52,425 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:01:52,443 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:01:52,476 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:01:52,476 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:01:52,476 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:01:52,477 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:01:52,477 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:01:52,477 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:01:52,477 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:01:52,477 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:01:52,478 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:01:52,496 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-12 09:01:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:01:52,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:01:52,504 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:01:52,506 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:01:52,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:01:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2019-01-12 09:01:52,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:01:52,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:01:52,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:01:52,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:01:52,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:01:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:01:52,675 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:01:52,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:01:52,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:01:52,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:01:52,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:01:52,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:01:52,699 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-12 09:01:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:01:52,730 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2019-01-12 09:01:52,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:01:52,732 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:01:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:01:52,744 INFO L225 Difference]: With dead ends: 224 [2019-01-12 09:01:52,744 INFO L226 Difference]: Without dead ends: 110 [2019-01-12 09:01:52,748 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:01:52,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-12 09:01:52,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-12 09:01:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-12 09:01:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2019-01-12 09:01:52,794 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2019-01-12 09:01:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:01:52,795 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2019-01-12 09:01:52,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:01:52,795 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2019-01-12 09:01:52,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:01:52,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:01:52,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:01:52,796 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:01:52,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:01:52,797 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2019-01-12 09:01:52,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:01:52,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:01:52,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:01:52,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:01:52,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:01:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:01:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:01:53,100 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:01:53,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:01:53 BoogieIcfgContainer [2019-01-12 09:01:53,174 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:01:53,178 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:01:53,178 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:01:53,178 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:01:53,179 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:01:52" (3/4) ... [2019-01-12 09:01:53,184 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:01:53,185 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:01:53,186 INFO L168 Benchmark]: Toolchain (without parser) took 2950.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 950.0 MB in the beginning and 963.0 MB in the end (delta: -13.0 MB). Peak memory consumption was 60.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:53,189 INFO L168 Benchmark]: CDTParser took 0.49 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:01:53,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.18 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 933.9 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:01:53,190 INFO L168 Benchmark]: Boogie Procedure Inliner took 146.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -125.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:53,192 INFO L168 Benchmark]: Boogie Preprocessor took 91.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:01:53,193 INFO L168 Benchmark]: RCFGBuilder took 1393.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:53,194 INFO L168 Benchmark]: TraceAbstraction took 777.66 ms. Allocated memory is still 1.1 GB. Free memory was 997.9 MB in the beginning and 963.0 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:01:53,195 INFO L168 Benchmark]: Witness Printer took 7.66 ms. Allocated memory is still 1.1 GB. Free memory is still 963.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:01:53,203 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.49 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 525.18 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 933.9 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 146.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.4 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -125.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1393.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.5 MB). Peak memory consumption was 47.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 777.66 ms. Allocated memory is still 1.1 GB. Free memory was 997.9 MB in the beginning and 963.0 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Witness Printer took 7.66 ms. Allocated memory is still 1.1 GB. Free memory is still 963.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: 256]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 251, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 255. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L251] double x = -0.0; [L252] double y = 0.0; [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L253] double res = __ieee754_atan2(y, x); [L255] COND TRUE res != pi VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L256] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 161 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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:01:55,575 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:01:55,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:01:55,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:01:55,593 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:01:55,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:01:55,597 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:01:55,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:01:55,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:01:55,606 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:01:55,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:01:55,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:01:55,610 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:01:55,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:01:55,612 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:01:55,615 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:01:55,617 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:01:55,619 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:01:55,621 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:01:55,622 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:01:55,623 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:01:55,625 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:01:55,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:01:55,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:01:55,629 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:01:55,630 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:01:55,633 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:01:55,634 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:01:55,635 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:01:55,639 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:01:55,639 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:01:55,640 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:01:55,640 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:01:55,642 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:01:55,643 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:01:55,645 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:01:55,646 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:01:55,674 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:01:55,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:01:55,676 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:01:55,677 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:01:55,677 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:01:55,677 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:01:55,677 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:01:55,678 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:01:55,678 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:01:55,679 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:01:55,679 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:01:55,679 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:01:55,679 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:01:55,679 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:01:55,679 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:01:55,680 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:01:55,680 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:01:55,681 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:01:55,681 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:01:55,681 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:01:55,681 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:01:55,681 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:01:55,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:01:55,683 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:01:55,683 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:01:55,683 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:01:55,683 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:01:55,683 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:01:55,683 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:01:55,683 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:01:55,684 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 -> 6672245f6516202a276f3cff39e39bf6cfceaf3d [2019-01-12 09:01:55,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:01:55,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:01:55,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:01:55,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:01:55,754 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:01:55,755 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0680b_true-unreach-call.c [2019-01-12 09:01:55,824 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7dff59f2/60c5e785d4054ca4bed2a9805c22c0d9/FLAG98c6eff63 [2019-01-12 09:01:56,326 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:01:56,327 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0680b_true-unreach-call.c [2019-01-12 09:01:56,336 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7dff59f2/60c5e785d4054ca4bed2a9805c22c0d9/FLAG98c6eff63 [2019-01-12 09:01:56,647 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7dff59f2/60c5e785d4054ca4bed2a9805c22c0d9 [2019-01-12 09:01:56,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:01:56,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:01:56,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:01:56,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:01:56,661 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:01:56,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:01:56" (1/1) ... [2019-01-12 09:01:56,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64858af4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:56, skipping insertion in model container [2019-01-12 09:01:56,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:01:56" (1/1) ... [2019-01-12 09:01:56,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:01:56,726 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:01:57,103 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:01:57,114 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:01:57,212 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:01:57,345 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:01:57,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:57 WrapperNode [2019-01-12 09:01:57,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:01:57,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:01:57,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:01:57,348 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:01:57,358 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:01:57" (1/1) ... [2019-01-12 09:01:57,379 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:01:57" (1/1) ... [2019-01-12 09:01:57,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:01:57,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:01:57,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:01:57,429 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:01:57,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:57" (1/1) ... [2019-01-12 09:01:57,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:57" (1/1) ... [2019-01-12 09:01:57,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:57" (1/1) ... [2019-01-12 09:01:57,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:57" (1/1) ... [2019-01-12 09:01:57,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:57" (1/1) ... [2019-01-12 09:01:57,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:57" (1/1) ... [2019-01-12 09:01:57,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:57" (1/1) ... [2019-01-12 09:01:57,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:01:57,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:01:57,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:01:57,509 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:01:57,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01: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:01:57,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 09:01:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:01:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:01:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-01-12 09:01:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:01:57,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:01:57,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:01:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:01:57,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:01:58,055 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:01:58,293 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:00,542 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:00,577 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:00,733 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:00,838 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:00,911 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:01,020 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:01,111 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:03,043 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:03,089 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:03,107 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:03,145 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:36,324 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:36,759 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:39,118 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:02:39,119 INFO L286 CfgBuilder]: Removed 44 assue(true) statements. [2019-01-12 09:02:39,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:02:39 BoogieIcfgContainer [2019-01-12 09:02:39,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:02:39,122 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:02:39,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:02:39,132 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:02:39,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:01:56" (1/3) ... [2019-01-12 09:02:39,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26805672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:02:39, skipping insertion in model container [2019-01-12 09:02:39,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:01:57" (2/3) ... [2019-01-12 09:02:39,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26805672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:02:39, skipping insertion in model container [2019-01-12 09:02:39,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:02:39" (3/3) ... [2019-01-12 09:02:39,139 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0680b_true-unreach-call.c [2019-01-12 09:02:39,150 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:02:39,158 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:02:39,179 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:02:39,218 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:02:39,219 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:02:39,219 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:02:39,219 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:02:39,219 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:02:39,219 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:02:39,219 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:02:39,220 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:02:39,220 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:02:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-12 09:02:39,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:02:39,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:39,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:39,246 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:39,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2019-01-12 09:02:39,261 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:39,262 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) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 09:02:39,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:39,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:39,662 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:39,662 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:39,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:39,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:02:39,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:02:39,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:02:39,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:02:39,709 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2019-01-12 09:02:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:39,743 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2019-01-12 09:02:39,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:02:39,744 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:02:39,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:39,758 INFO L225 Difference]: With dead ends: 224 [2019-01-12 09:02:39,758 INFO L226 Difference]: Without dead ends: 110 [2019-01-12 09:02:39,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:39,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-12 09:02:39,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-12 09:02:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-12 09:02:39,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2019-01-12 09:02:39,808 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2019-01-12 09:02:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:39,809 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2019-01-12 09:02:39,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:02:39,809 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2019-01-12 09:02:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:02:39,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:39,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:39,811 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:39,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:39,811 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2019-01-12 09:02:39,812 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:39,812 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:02:39,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:40,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:40,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:02:40,651 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:40,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:40,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:02:40,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:02:40,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:02:40,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:02:40,675 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand 7 states. [2019-01-12 09:02:44,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:44,173 INFO L93 Difference]: Finished difference Result 161 states and 226 transitions. [2019-01-12 09:02:44,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:02:44,178 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-12 09:02:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:44,179 INFO L225 Difference]: With dead ends: 161 [2019-01-12 09:02:44,179 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 09:02:44,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:02:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 09:02:44,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 09:02:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 09:02:44,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2019-01-12 09:02:44,205 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 12 [2019-01-12 09:02:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:44,205 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2019-01-12 09:02:44,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:02:44,206 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2019-01-12 09:02:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:02:44,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:44,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:44,207 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:44,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:44,208 INFO L82 PathProgramCache]: Analyzing trace with hash 810615587, now seen corresponding path program 1 times [2019-01-12 09:02:44,210 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:44,211 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:02:44,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:44,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:44,624 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:02:44,626 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:02:44,630 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:02:44,631 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:02:44,638 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 47 treesize of output 76 [2019-01-12 09:02:44,662 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:02:44,665 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 63 [2019-01-12 09:02:44,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:02:44,708 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 20 treesize of output 16 [2019-01-12 09:02:44,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:02:44,735 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 37 treesize of output 29 [2019-01-12 09:02:44,762 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:02:44,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2019-01-12 09:02:44,764 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:02:44,774 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:02:44,782 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:02:44,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 09:02:44,803 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:64, output treesize:28 [2019-01-12 09:02:44,966 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:44,966 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:44,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:44,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:02:44,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:02:44,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:02:44,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:02:44,983 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand 5 states. [2019-01-12 09:02:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:47,313 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2019-01-12 09:02:47,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:02:47,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-12 09:02:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:47,703 INFO L225 Difference]: With dead ends: 125 [2019-01-12 09:02:47,704 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 09:02:47,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:02:47,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 09:02:47,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 09:02:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 09:02:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2019-01-12 09:02:47,722 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 17 [2019-01-12 09:02:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:47,722 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2019-01-12 09:02:47,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:02:47,722 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2019-01-12 09:02:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:02:47,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:47,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:47,724 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:47,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:47,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1532035359, now seen corresponding path program 1 times [2019-01-12 09:02:47,725 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:47,725 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) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:02:47,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:48,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:48,490 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2019-01-12 09:02:48,657 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:48,657 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:48,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:48,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:02:48,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:02:48,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:02:48,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:02:48,677 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand 7 states. [2019-01-12 09:02:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:52,085 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2019-01-12 09:02:52,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:02:52,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-01-12 09:02:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:52,090 INFO L225 Difference]: With dead ends: 130 [2019-01-12 09:02:52,091 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 09:02:52,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:02:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 09:02:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 09:02:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 09:02:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-01-12 09:02:52,124 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 17 [2019-01-12 09:02:52,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:52,124 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-01-12 09:02:52,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:02:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-01-12 09:02:52,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:02:52,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:52,125 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:52,125 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:52,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:52,126 INFO L82 PathProgramCache]: Analyzing trace with hash -255340040, now seen corresponding path program 1 times [2019-01-12 09:02:52,126 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:52,127 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:02:52,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:52,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:52,659 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 09:02:52,840 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-12 09:02:52,845 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:52,845 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:52,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:52,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:02:52,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:02:52,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:02:52,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:02:52,861 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 5 states. [2019-01-12 09:02:53,285 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 09:02:53,835 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 09:02:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:55,955 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2019-01-12 09:02:55,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:02:55,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-12 09:02:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:55,960 INFO L225 Difference]: With dead ends: 75 [2019-01-12 09:02:55,962 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 09:02:55,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:02:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 09:02:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 09:02:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 09:02:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2019-01-12 09:02:55,986 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 18 [2019-01-12 09:02:55,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:55,987 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2019-01-12 09:02:55,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:02:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2019-01-12 09:02:55,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:02:55,988 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:55,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:55,989 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:55,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:55,989 INFO L82 PathProgramCache]: Analyzing trace with hash 667658140, now seen corresponding path program 1 times [2019-01-12 09:02:55,990 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:02:55,990 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:02:55,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:56,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:02:56,530 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:56,531 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:02:56,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:56,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:02:56,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:02:56,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:02:56,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:02:56,549 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 7 states. [2019-01-12 09:02:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:57,096 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2019-01-12 09:02:57,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:02:57,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-01-12 09:02:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:57,097 INFO L225 Difference]: With dead ends: 71 [2019-01-12 09:02:57,097 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:02:57,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 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:02:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:02:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:02:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:02:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:02:57,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-01-12 09:02:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:57,100 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:02:57,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:02:57,101 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:02:57,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:02:57,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:02:57,475 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-01-12 09:02:58,511 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2019-01-12 09:02:58,514 INFO L448 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:02:58,514 INFO L448 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:02:58,514 INFO L444 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-01-12 09:02:58,514 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:02:58,514 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 09:02:58,514 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-01-12 09:02:58,514 INFO L448 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-01-12 09:02:58,515 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-01-12 09:02:58,515 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-01-12 09:02:58,515 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-01-12 09:02:58,515 INFO L448 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-01-12 09:02:58,515 INFO L448 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-01-12 09:02:58,515 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 09:02:58,515 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-01-12 09:02:58,515 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:02:58,515 INFO L448 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-01-12 09:02:58,516 INFO L448 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:02:58,516 INFO L448 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-01-12 09:02:58,516 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-01-12 09:02:58,516 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:02:58,516 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:02:58,516 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 09:02:58,517 INFO L444 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (exists ((v_prenex_61 (_ BitVec 64)) (|v_q#valueAsBitvector_18| (_ BitVec 64))) (let ((.cse1 ((_ extract 63 32) |v_q#valueAsBitvector_18|)) (.cse0 ((_ extract 31 0) v_prenex_61))) (and (= .cse0 .cse1) (= ULTIMATE.start___ieee754_atan2_~hy~0 .cse1) (= ULTIMATE.start___ieee754_atan2_~ly~0 .cse0) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|))) (= .cse0 ((_ extract 63 32) v_prenex_61))))) (exists ((|v_q#valueAsBitvector_17| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_17|)) ULTIMATE.start___ieee754_atan2_~iy~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_17|) ((_ extract 62 52) |v_q#valueAsBitvector_17|) ((_ extract 51 0) |v_q#valueAsBitvector_17|)) (_ +zero 11 53)))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (= (fp.add roundNearestTiesToEven ~pi~0 .cse2) |ULTIMATE.start___ieee754_atan2_#res|) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (exists ((ULTIMATE.start___ieee754_atan2_~hy~0 (_ BitVec 32)) (|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))) (= 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_q#valueAsBitvector_19|) (_ bv30 32))))))) (= ~tiny_atan2~0 .cse2) (exists ((|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_q#valueAsBitvector_19|)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_16|)) ULTIMATE.start___ieee754_atan2_~ix~1) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (fp.neg (_ +zero 11 53))))))) [2019-01-12 09:02:58,517 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-01-12 09:02:58,517 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-01-12 09:02:58,517 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:02:58,517 INFO L448 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-01-12 09:02:58,517 INFO L444 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-01-12 09:02:58,517 INFO L448 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:02:58,517 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-01-12 09:02:58,518 INFO L448 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-01-12 09:02:58,518 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-01-12 09:02:58,518 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-01-12 09:02:58,518 INFO L444 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (and (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2019-01-12 09:02:58,518 INFO L448 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-01-12 09:02:58,518 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 09:02:58,518 INFO L448 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-01-12 09:02:58,518 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-01-12 09:02:58,519 INFO L448 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-01-12 09:02:58,519 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-01-12 09:02:58,519 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-01-12 09:02:58,519 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-01-12 09:02:58,519 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-01-12 09:02:58,519 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-01-12 09:02:58,519 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:02:58,519 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-01-12 09:02:58,519 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:02:58,519 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-01-12 09:02:58,520 INFO L448 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:02:58,520 INFO L444 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-01-12 09:02:58,520 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:02:58,520 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-01-12 09:02:58,520 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-01-12 09:02:58,520 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 09:02:58,520 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-01-12 09:02:58,520 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-01-12 09:02:58,521 INFO L444 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (and (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (exists ((|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_q#valueAsBitvector_19|)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_16|)) ULTIMATE.start___ieee754_atan2_~ix~1) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (fp.neg (_ +zero 11 53)))))) [2019-01-12 09:02:58,521 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:02:58,521 INFO L448 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-01-12 09:02:58,521 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:02:58,521 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-12 09:02:58,521 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:02:58,521 INFO L448 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:02:58,521 INFO L448 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:02:58,521 INFO L448 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:02:58,521 INFO L448 ceAbstractionStarter]: For program point L255(lines 255 258) no Hoare annotation was computed. [2019-01-12 09:02:58,522 INFO L448 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-01-12 09:02:58,522 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-01-12 09:02:58,522 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-01-12 09:02:58,522 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:02:58,522 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:02:58,522 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:02:58,522 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:02:58,522 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:02:58,523 INFO L448 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:02:58,523 INFO L448 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:02:58,523 INFO L448 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:02:58,523 INFO L448 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:02:58,523 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:02:58,523 INFO L448 ceAbstractionStarter]: For program point L256(line 256) no Hoare annotation was computed. [2019-01-12 09:02:58,523 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 09:02:58,523 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-01-12 09:02:58,523 INFO L444 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-01-12 09:02:58,524 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 09:02:58,524 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-01-12 09:02:58,524 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-01-12 09:02:58,524 INFO L451 ceAbstractionStarter]: At program point L259(lines 244 260) the Hoare annotation is: true [2019-01-12 09:02:58,524 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:02:58,524 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 256) no Hoare annotation was computed. [2019-01-12 09:02:58,524 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-01-12 09:02:58,524 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-01-12 09:02:58,524 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-01-12 09:02:58,525 INFO L444 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-01-12 09:02:58,525 INFO L444 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-01-12 09:02:58,525 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-01-12 09:02:58,525 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-01-12 09:02:58,525 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-01-12 09:02:58,525 INFO L448 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-01-12 09:02:58,525 INFO L448 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-01-12 09:02:58,525 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 09:02:58,525 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-01-12 09:02:58,526 INFO L448 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-01-12 09:02:58,526 INFO L444 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-01-12 09:02:58,526 INFO L448 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-01-12 09:02:58,526 INFO L448 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-01-12 09:02:58,526 INFO L448 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-01-12 09:02:58,526 INFO L444 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-01-12 09:02:58,526 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-01-12 09:02:58,526 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-01-12 09:02:58,527 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:02:58,527 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 09:02:58,527 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:02:58,527 INFO L444 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-01-12 09:02:58,538 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,539 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,542 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,542 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,544 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,544 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,545 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,546 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,547 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,547 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,551 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,552 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,553 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,554 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,554 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,554 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,555 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,555 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-01-12 09:02:58,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,556 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,556 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,557 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,559 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,560 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,561 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,561 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,562 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,562 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,562 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-01-12 09:02:58,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,563 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,563 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,564 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,565 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:02:58 BoogieIcfgContainer [2019-01-12 09:02:58,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:02:58,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:02:58,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:02:58,572 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:02:58,573 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:39" (3/4) ... [2019-01-12 09:02:58,580 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:02:58,615 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-01-12 09:02:58,615 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-12 09:02:58,616 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:02:58,650 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_19 : bv64 :: hx == v_q#valueAsBitvector_19[63:32] && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]))) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) [2019-01-12 09:02:58,652 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_prenex_61 : bv64, v_q#valueAsBitvector_18 : bv64 :: (((v_prenex_61[31:0] == v_q#valueAsBitvector_18[63:32] && hy == v_q#valueAsBitvector_18[63:32]) && ly == v_prenex_61[31:0]) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_18[63:63], v_q#valueAsBitvector_18[62:52], v_q#valueAsBitvector_18[51:0])) && v_prenex_61[31:0] == v_prenex_61[63:32]) && (\exists v_q#valueAsBitvector_17 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_17[63:32]) == iy && ~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]) == ~Pluszero~LONGDOUBLE())) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~Pluszero~LONGDOUBLE() == y) && ~fp.add~DOUBLE(~roundNearestTiesToEven, pi, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists ULTIMATE.start___ieee754_atan2_~hy~0 : bv32, v_q#valueAsBitvector_19 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]) && m == ~bvor32(~bvand32(1bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hy~0, 31bv32)), ~bvand32(2bv32, ~bvashr32(v_q#valueAsBitvector_19[63:32], 30bv32))))) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_19 : bv64 :: hx == v_q#valueAsBitvector_19[63:32] && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]))) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) [2019-01-12 09:02:58,742 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:02:58,742 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:02:58,743 INFO L168 Benchmark]: Toolchain (without parser) took 62090.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:02:58,744 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:02:58,744 INFO L168 Benchmark]: CACSL2BoogieTranslator took 691.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:02:58,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:02:58,744 INFO L168 Benchmark]: Boogie Preprocessor took 79.83 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:02:58,745 INFO L168 Benchmark]: RCFGBuilder took 41611.55 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: 67.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:02:58,746 INFO L168 Benchmark]: TraceAbstraction took 19449.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -81.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:02:58,746 INFO L168 Benchmark]: Witness Printer took 170.51 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: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:02:58,748 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 691.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.83 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. * RCFGBuilder took 41611.55 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: 67.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19449.83 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -81.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 170.51 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: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation 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_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,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_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,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_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,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_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,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_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,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_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 256]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 147]: Loop Invariant [2019-01-12 09:02:58,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,754 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,755 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,755 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && 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: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant [2019-01-12 09:02:58,756 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,756 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,756 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,757 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,761 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,761 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,762 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] Derived loop invariant: ((((pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_19 : bv64 :: hx == v_q#valueAsBitvector_19[63:32] && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]))) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant [2019-01-12 09:02:58,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,763 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,768 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,769 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,770 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,770 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,770 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,770 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-01-12 09:02:58,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,775 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,775 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,776 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2019-01-12 09:02:58,778 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2019-01-12 09:02:58,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,782 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2019-01-12 09:02:58,783 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,783 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,783 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2019-01-12 09:02:58,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,784 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:02:58,784 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2019-01-12 09:02:58,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2019-01-12 09:02:58,785 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] Derived loop invariant: (((((((((\exists v_prenex_61 : bv64, v_q#valueAsBitvector_18 : bv64 :: (((v_prenex_61[31:0] == v_q#valueAsBitvector_18[63:32] && hy == v_q#valueAsBitvector_18[63:32]) && ly == v_prenex_61[31:0]) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_18[63:63], v_q#valueAsBitvector_18[62:52], v_q#valueAsBitvector_18[51:0])) && v_prenex_61[31:0] == v_prenex_61[63:32]) && (\exists v_q#valueAsBitvector_17 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_17[63:32]) == iy && ~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]) == ~Pluszero~LONGDOUBLE())) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~Pluszero~LONGDOUBLE() == y) && ~fp.add~DOUBLE(~roundNearestTiesToEven, pi, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists ULTIMATE.start___ieee754_atan2_~hy~0 : bv32, v_q#valueAsBitvector_19 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]) && m == ~bvor32(~bvand32(1bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hy~0, 31bv32)), ~bvand32(2bv32, ~bvashr32(v_q#valueAsBitvector_19[63:32], 30bv32))))) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_19 : bv64 :: hx == v_q#valueAsBitvector_19[63:32] && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]))) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 1 error locations. SAFE Result, 19.3s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 13.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 487 SDtfs, 1042 SDslu, 270 SDs, 0 SdLazy, 122 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 216 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 87 ConstructedInterpolants, 32 QuantifiedInterpolants, 17394 SizeOfPredicates, 37 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...